Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
Zur Ablage hinzufügen
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  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

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-261E-B Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-261F-9
Genre: Konferenzbeitrag

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Hoffmann, Jörg1, Autor           
Brafman, Ronen, Autor
Biundo, Susanne, Herausgeber
Meyers, Karen, Herausgeber
Rajan, Kanna, Herausgeber
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: 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

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2006-04-252005
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: Menlo Park, USA : AAAI
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 279080
Anderer: Local-ID: C1256104005ECAFC-4FD396134AD94B31C1256FA3005CB23E-HoffmannBrafman2005a
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: Untitled Event
Veranstaltungsort: Monterey, USA
Start-/Enddatum: 2005-06-05

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: 15th International Conference on Automated Planning and Scheduling
Genre der Quelle: Konferenzband
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: Menlo Park, USA : AAAI
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 71 - 80 Identifikator: ISBN: 1-57735-220-3