[robotics-worldwide] CFP: 2009 Symposium on Combinatorial Search (SoCS-09)

skoenig skoenig at usc.edu
Fri Dec 26 09:42:13 PST 2008


The following IJCAI workshop encourages submissions on path and motion
planning!

Cheers,
Sven



 		      Call for Papers
       International Symposium on Combinatorial Search

        July 9-10, 2009 in Lake Arrowhead, California
       (directly before IJCAI in Pasadena, California)

 	     Submission Deadline: April 7, 2009
 		 www.search-conference.org

This event continues the tradition started last year by the
Symposium on Search Techniques in AI and Robotics
(STAIR-08), but with an even broader scope to include
techniques originating in any computing field, including
contraint programming, operations research, planning, and
bioinformatics.  Papers on both complete and incomplete
methods are welcome.  Work discussing a specific application
domain (for example, robotic motion planning, timetabling,
temporal planning, ...)  is welcomed, as long as the
emphasis is on the search strategy employed and an effort is
made to suggest how the ideas could be relevant in another
domain.

Relevant topics include (but are not limited to):

     * Analysis of search algorithms
     * Continuous problem solving
     * External-memory and parallel search
     * Incremental and active learning in search
     * Meta-reasoning and search
     * Methodology and critiques of current practice
     * Model-based 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
     * Self-configuring and self-tuning algorithms
     * Time, memory, and solution quality tradeoffs

Attendence will be limited to those who have either a
regular technical paper (AAAI style, 6 pages preferred, 8
pages maximum) or short research statement (2 pages maximum)
accepted.  Papers will be carefully peer-reviewed by
multiple reviewers and low-quality or off-topic papers will
not be accepted.  Please see the website for more
information.

SoCS is organized in cooperation with SARA (Symposium on
Abstraction, Reformulation, and Approximation).  SARA is
focussed on abstraction, while SoCS is focussed on search.
The last day of SARA and the first day of SoCS will be an
overlap day on the use of abstraction in search. It will be
possible to register for either or both symposia.

Organizing Committee

Sven Koenig, University of Southern California
Wheeler Ruml, University of New Hampshire
Rong Zhou, Palo Alto Research Center

Program Committee

Adi Botea (NICTA)
Blai Bonet (Universidad Simon Bolivar)
Ariel Felner (Ben-Gurion University)
Eric Hansen (Mississippi State University)
Malte Helmert (Albert-Ludwigs-Universitat Freiburg)
Robert Holte (University of Alberta)
Maxim Lihkachev (University of Pennsylvania)
Michela Milano (Universita di Bologna)
Nathan Sturtevant (University of Alberta)
Patrik Haslum (NICTA)
Bart Selman (Cornell University)
Sheila McIlraith (University of Toronto)
Stefan Edelkamp (Technische Universitat Dortmund)
Susan Epstein (Hunter College, CUNY)
Youssef Hamadi (Microsoft Research, Cambridge)
Weixiong Zhang (Washington University in St Louis)



---

Sven Koenig
University of Southern California (USC)
Computer Science Department
Henry Salvatori Computer Center (SAL) 312
941 W 37th Street
Los Angeles, CA 90089-0781, USA
Email: skoenig at usc.edu
WWW:   idm-lab.org





More information about the robotics-worldwide mailing list