For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

King's College London

Return to search Previous output Next output
Output 0 of 0 in the submission
Article title

Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width

Type
D - Journal article
Title of journal
Journal Artificial Intelligence Research
Article number
-
Volume number
35
Issue number
-
First page of article
623
ISSN of journal
1076-9757
Year of publication
2009
URL
-
Number of additional authors
1
Additional information

<22>Conformant planning is planning in the presence of uncertainty but no feedback. The paper shows that conformant planning problems can be translated into classical planning problems, and that this translation can be achieved in time and space that exponential in a width parameter that it is bounded and small in almost all benchmarks.

The conformant planner based on this approach won the Conformant Track of the 2006 International Planning Competition, and it provides the basis for the state-of-the-art contingent planners that handle partial observability. This paper received the 2012 IJCAI-JAIR Best Paper Prize.

Interdisciplinary
-
Cross-referral requested
-
Research group
C - Planning
Citation count
-
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-