Home Page for the Workshop on
Planning as Combinatorial Search:
Propositional, Graph-Based, and Disjunctive Planning Methods
Sunday, June 7, 1998
Carnegie Mellon University
Pittsburgh, PA
http://www.cs.washington.edu/homes/kautz/aips98ws/
in conjunction with
The Fourth International Conference on
Artificial Intelligence Planning Systems (AIPS-98)
Description
Recently very efficient planning systems have been build around local
search, graph search, A* search, dynamic programming, integer
programming, and other general combinatorial search techniques. This
workshop will examine the common threads that link these different
efforts and look for new ways that mature combinatorial algorithms
from different areas of computer science can be fruitfully applied to
AI planning systems.
Workshop Format
The workshop will include panels, invited talks, discussions, and a
few short paper presentations. The sessions will be:
-
introduction and invited talk
-
probabilistic planning
-
extending graphplan
-
control knowledge
-
unifying frameworks and logical approaches
-
operations research and scheduling
-
benchmarks and evaluation
-
wrapup & open challenges
Attendance and Registration
Registration is by invitation only. See the
Call for Participation
for details.
See
http://www.cs.cmu.edu/~aips98
for registration information.
The list of invited participants as of April
29, 1998.
Working Notes
The
Table of Contents of the working notes.
Organizing Committee
- Henry Kautz (AT&T Labs), kautz@research.att.com
- Avrim Blum, (Carnegie Mellon University), avrim@cs.cmu.edu
- Subbarao Kambhampati (Arizona State University), rao@asu.edu
- Bart Selman (Cornell University), selman@cs.cornell.edu
Tue Apr 28 16:57:57 EDT 1998
Home page for Henry Kautz:
http://www.cs.washington.edu/homes/kautz