*** Updates ***
- 6/12/08 The schedule for the symposium is now available online.
- 3/25/08 The "Submission Procedure" section has been updated. We
have provided details on the type of submissions we
are looking for. We are now accepting submissions through EasyChair.
Symposium Description
Heuristic search and combinatorial optimization are currently very
active areas of research. For example, researchers investigate how to
search in real-time, how to search with limited (possibly external)
memory, how to solve sequences of similar search problems faster than
with isolated searches, how to improve the runtime of the searches
over time, how to trade-off between the runtime and memory consumption
of the search and the resulting solution quality, and how to focus the
searches with sophisticated heuristics such as pattern
databases. Their results are published in different conferences such
as the IJCAI, AAAI, ICAPS, NIPS, ICRA, and IROS. This symposium is
meant to bring these researchers together to exchange their ideas and
cross-fertilize the field. Thus, in addition to seeking separate
answers to questions like how to design more accurate memory-based
heuristics, more I/O-efficient disk-based search algorithms, or more
efficient clause-learning strategies, the symposium will stimulate
thoughts on combining various techniques originated from different
areas of search.
Topics relevant to this symposium include, but are not limited to:
- Clause learning
- Continuous problem solving (e.g., solving sequences of similar search problems)
- External-memory and parallel search
- Incremental and active learning in search
- Random vs systematic search strategy selection
- Pattern databases
- Portfolios of search algorithms
- Real-time search
- Search focus in goal-directed problem solving
- Search space discretization for continuous state-space problems
- Time, memory, and solution quality tradeoffs
Submissions that connect together multiple search topics
listed or not listed above will be given precedence.
Tentative Dates
Submission deadline: |
April 7, 2008 at 5pm PST (Pacific standard time) |
Notification of acceptance: |
April 21, 2008
|
Camera-ready copy due to organizers: |
May 5, 2008 |
Camera-ready copy due to AAAI: |
May 12, 2008 |
AAAI early registration deadline: |
|
AAAI late registration deadline: |
|
Our symposium: |
July 13-14, 2008 |
AAAI conference: |
July 13-17, 2008 |
Submission Procedure
We intend to foster a discussion regarding a recurring specialized
venue for heuristic search and related algorithms. Those interested in
attending should submit either a technical paper (6 pages preferred, 8
pages maximum) or a statement of research interests (2 pages maximum)
in PDF format through EasyChair.
Instructions on formatting using the AAAI style are available at:
http://aaai.org/Publications/Author/author.php
We will accept papers recently published at conferences if they are clearly
marked as such. All submitted papers will be carefully peer-reviewed
by multiple reviewers and low-quality or off-topic papers will not be
accepted.
Note that all symposium participants must register for the main
AAAI-08 conference.
Contact Information
David Furcy
Computer Science Department
University of Wisconsin Oshkosh
800 Algoma Boulevard
Oshkosh, WI 54901-8643
furcyd _AT_ uwosh _DOT_ edu
920-424-1182 (phone)
920-424-0045 (shared fax, please use a cover page)
|
Sven Koenig
Computer Science Department
University of Southern California (USC)
300 Henry Salvatori Computer Science Center (SAL)
941 W 37th Street
Los Angeles, CA 90089-0781
skoenig _AT_ usc _DOT_ edu
213-740-6491 (phone)
213-740-7285 (fax)
|
Wheeler Ruml
Deaprtment of Computer Science
University of New Hampshire
Kingsbury Hall
33 College Road
Durham, NH 03824
ruml _AT_ cs _DOT_ unh _DOT_ edu
603-862-2683 (phone)
|
Rong Zhou
Palo Alto Research Center, Room 2526
3333 Coyote Hill Road
Palo Alto, CA 94304-1314
rzhou _AT_ parc _DOT_ com
650-812-4734 (phone)
650-812-4334 (shared fax, please use a cover page)
|
Program Committee
- Chris Beck (jcb _AT_ mie _DOT_ utoronto _DOT_ ca)
- Blai Bonet (bonet _AT_ ldc _DOT_ usb _DOT_ ve)
- Stefan Edelkamp (stefan _DOT_ edelkamp _AT_ cs _DOT_ uni-dortmund _DOT_ de)
- Susan Epstein (sepstein _AT_ hunter _DOT_ cuny _DOT_ edu)
- Ariel Felner (felner _AT_ bgu _DOT_ ac _DOT_ il)
- David Furcy
- David Ferguson (dif _AT_ cmu _DOT_ edu)
- Hector Geffner (hector _DOT_ geffner _AT_ upf _DOT_ edu)
- Youssef Hamadi (youssefh _AT_ microsoft _DOT_ com)
- Eric Hansen (hansen _AT_ cse _DOT_ msstate _DOT_ edu)
- Patrik Haslum (Patrik _DOT_ Haslum _AT_ nicta _DOT_ com _DOT_ au)
- Robert Holte (holte _AT_ cs _DOT_ ualberta _DOT_ ca)
- Lydia Kavraki (kavraki _AT_ rice _DOT_ edu>
- Sven Koenig
- Richard Korf (korf _AT_ cs _DOT_ ucla _DOT_ edu)
- James Kuffner (kuffner _AT_ cs _DOT_ cmu _DOT_ edu)
- Maxim Lihkachev (maxim+ _AT_ cs _DOT_ cmu _DOT_ edu)
- Wheeler Ruml
- Jonathan Schaeffer (jonathan _AT_ cs _DOT_ ualberta _DOT_ ca)
- Bart Selman (selman _AT_ cs _DOT_ cornell _DOT_ edu)
- Shlomo Zilberstein (shlomo _AT_ cs _DOT_ umass _DOT_ edu)
- Toby Walsh (tw _AT_ cse _DOT_ unsw _DOT_ edu _DOT_ au)
- Weixiong Zhang (zhang _AT_ cse _DOT_ wustl _DOT_ edu)
- Rong Zhou
Previous Meetings on Related Topics
- Learning for Search,
Wheeler Ruml and Frank Hutter, AAAI Workshop '06
- Heuristic Search,
Memory Based Heuristics and Their Applications, Ariel Felner,
Hector Geffner, and Robert Holte, AAAI Workshop '06
- Planning and Learning
in A Priori Unknown or Dynamic Domains, Vadim Bulitko and Sven Koenig,
IJCAI Workshop '05
- Planning
and Learning, Daniel Borrajo and Manuela Veloso, ICAPS Tutorial '04
- Stochastic Search Algorithms,
Holger Hoos and Thomas Stuetzle, IJCAI Workshop '01 and IJCAI Workshop '03