The First International Symposium on
Search Techniques in Artificial Intelligence and Robotics

July 13-14, 2008, Chicago, Illinois

Symposium Description  Symposium Schedule  Important Dates  Submission Procedure  Contact Information Related Meetings

If you have not done so yet, please consider
joining the search-list on google groups

*** Updates ***

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: 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:

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

Previous Meetings on Related Topics