MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Proceedings Article, Paper


@InProceedings
Beitrag in Tagungsband, Workshop
Author, Editor
Author(s):
Hoffmann, Jörg
Brafman, Ronen		dblp
dblp
Not MPG Author(s):
Brafman, Ronen
Editor(s):
Biundo, Susanne
Meyers, Karen
Rajan, Kanna		dblp
dblp
dblp
Not MPII Editor(s):
Biundo, Susanne
Meyers, Karen
Rajan, Kanna
BibTeX cite key*:
HoffmannBrafman2005a
Title, Booktitle
Title*:
Contingent Planning via Heuristic Forward Search with Implicit Belief States
Booktitle*:
15th International Conference on Automated Planning and Scheduling
Event, URLs
Conference URL::
Downloading URL:
Event Address*:
Monterey, USA
Language:
English
Event Date*
(no longer used):
Organization:
Event Start Date:
5 June 2005
Event End Date:
10 June 2005
Publisher
Name*:
AAAI
URL:
Address*:
Menlo Park, USA
Type:
Vol, No, Year, pp.
Series:
Volume:
Number:
Month:
June
Pages:
71-80
Year*:
2005
VG Wort Pages:
10
ISBN/ISSN:
1-57735-220-3
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:
 Contingent planning is the task of generating a conditional plan
given uncertainty about the initial state and action effects, but
with the ability to observe some aspects of the current world state.
Contingent planning can be transformed into an And-Or search problem
in belief space, the space whose elements are sets of possible
worlds. In \cite{CFF}, we introduced a method for implicitly
representing a belief state using a propositional formula that
describes the sequence of actions leading to that state. This
representation trades off space for time and was shown to be quite
effective for conformant planning within a heuristic forward-search
planner based on the \ff\ system. In this paper we apply the same
architecture to contingent planning. The changes required to adapt
the search space representation are small. More effort is required
to adapt the relaxed planning problems whose solution informs the
forward search algorithm. We propose the targeted use of an
additional relaxation, mapping the relaxed {\em contingent} problem
into a relaxed {\em conformant} problem. Experimental results show
that the resulting planning system, \contff, is highly competitive
with the state-of-the-art contingent planners \pond\ and \mbp.
Keywords:
planning, planning under uncertainty, heuristic search
Download
Access Level:
Public

Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Programming Logics Group
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, CCL bibliography, VG Wort



BibTeX Entry:
@INPROCEEDINGS{HoffmannBrafman2005a,
AUTHOR = {Hoffmann, J{\"o}rg and Brafman, Ronen},
 EDITOR = {Biundo, Susanne and Meyers, Karen and Rajan, Kanna},
 TITLE = {Contingent Planning via Heuristic Forward Search with Implicit Belief States},
 BOOKTITLE = {15th International Conference on Automated Planning and Scheduling},
 PUBLISHER = {AAAI},
 YEAR = {2005},
 PAGES = {71--80},
 ADDRESS = {Monterey, USA},
 MONTH = {June},
 ISBN = {1-57735-220-3},
}

Entry last modified by Christine Kiesel, 01/28/2008
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Jörg Hoffmann		Created
02/09/2005 05:52:29 PM
Revisions
3.
2.
1.
0.
Editor(s)
Christine Kiesel
Jörg Hoffmann
Jörg Hoffmann
Jörg Hoffmann
Edit Dates
25.04.2006 21:04:45
04/20/2006 08:53:13 PM
02/09/2005 05:56:55 PM
02/09/2005 05:52:29 PM