English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  Contingent Planning via Heuristic Forward Search with Implicit Belief States

Hoffmann, J., & Brafman, R. (2005). Contingent Planning via Heuristic Forward Search with Implicit Belief States. In 15th International Conference on Automated Planning and Scheduling (pp. 71-80). Menlo Park, USA: AAAI.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-261E-B Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-261F-9
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Hoffmann, Jörg1, Author           
Brafman, Ronen, Author
Biundo, Susanne, Editor
Meyers, Karen, Editor
Rajan, Kanna, Editor
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 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.

Details

show
hide
Language(s): eng - English
 Dates: 2006-04-252005
 Publication Status: Issued
 Pages: -
 Publishing info: Menlo Park, USA : AAAI
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 279080
Other: Local-ID: C1256104005ECAFC-4FD396134AD94B31C1256FA3005CB23E-HoffmannBrafman2005a
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Monterey, USA
Start-/End Date: 2005-06-05

Legal Case

show

Project information

show

Source 1

show
hide
Title: 15th International Conference on Automated Planning and Scheduling
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Menlo Park, USA : AAAI
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 71 - 80 Identifier: ISBN: 1-57735-220-3