|
The Fourth International Planning Competition will be held in
conjunction with the International Conference on
Automated Planning and Scheduling. The competition provides a forum for researchers
to compare planning techniques and systems in a friendly head-to-head competition.
Classical Planning Competition The classical part of the
competition continues the tradition of a biannual public challenge on
deterministic planning benchmark domains. This year, there will be
two minor language extensions to the domain definitions: "derived
predicates" and "timed initial literals", added on top of the PDDL2.1
language used at IPC-3.
The web page at
https://ipc04.icaps-conference.org has all information on IPC-4. It
includes a download of a document that gives the syntax and semantics
of the input planning description language PDDL2.2 and downloads of
testing examples for the new language features.
Deadline for registration is January 27, 2004. However, the sooner
we know how many systems will participate, and what language classes
they will be able to handle, the better it will be for the
organization of the competition. (The data collection phase is in
between February and April 2004.)
Iterested researchers should
contact the organizers by
sending mail to
stefan.edelkamp@cs.uni-dortmund.de
or
hoffmann@informatik.uni-freiburg.de
Important Dates for Classical Competition
| |
Planner Registration: |
Tuesday, January 27, 2004 |
| |
Start Data Collection: |
Tuesday, February 3, 2004 |
| |
Abstracts Due: |
Wednesday, March 31st, 2004 |
Probabilistic Planning Competition
The First International Probabilistic Planning Competition will be
held in conjunction with the 2004 International Conference on
Automated Planning and Scheduling (ICAPS-04). The competition is
being organized as a parallel track of the Fourth International
Planning Competition (IPC) at ICAPS-04.
Previous IPCs have focused exclusively on classical
planning---sequential decision making when the effects of all
decisions are deterministic. Over the past decade, as computers have
become more and more integrated with the physical world, researchers
have begun to study models that can represent the inherent uncertainty
present in the effects of many decisions. In this setting, plans are
evaluated by how likely they are to achieve desired outcomes.
The challenge tasks for the competition will be expressed in a new
probabilistic extension of PDDL. This domain description language
provides for an object-based format for compactly expressing Markov
decision processes (MDPs), the prevailing model for defining
decision-theoretic planning problems. The competition will also
include a non-deterministic demonstration track for researchers
interested in showcasing their planners that address problems with
non-probabilistic uncertainty.
Important Dates for Probabilistic Competition
| |
Server made public: |
August 15, 2003 |
| |
Statement of interest due from participants: |
October 15, 2003 |
| |
Domain problems distributed to participants: |
January 15, 2004 |
| |
Evaluations begin: |
March 15, 2004 |
Interested researchers should contact the organizers by sending mail
to mlittman @ cs.rutgers.edu
We look forward to your participation in IPC-4.
|
