Sciweavers

ECAI
2010
Springer
14 years 16 days ago
Compiling Uncertainty Away in Non-Deterministic Conformant Planning
It has been shown recently that deterministic conformant planning problems can be translated into classical problems that can be solved by off-the-shelf classical planners. In this...
Alexandre Albore, Héctor Palacios, Hector G...
AAAI
1998
14 years 24 days ago
Conformant Graphplan
Planning under uncertainty is a difficult task. If sensory information is available, it is possible to do contingency planning
David E. Smith, Daniel S. Weld
AIPS
2004
14 years 25 days ago
Conformant Planning via Heuristic Forward Search: A New Approach
Conformant planning is the task of generating plans given uncertainty about the initial state and action effects, and without any sensing capabilities during plan execution. The p...
Ronen I. Brafman, Jörg Hoffmann
AAAI
2006
14 years 25 days ago
Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes)
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
Héctor Palacios, Hector Geffner
CAEPIA
2005
Springer
14 years 5 months ago
Mapping Conformant Planning into SAT Through Compilation and Projection
Conformant planning is a variation of classical AI planning where the initial state is partially known and actions can have nondeterministic effects. While a classical plan must a...
Héctor Palacios, Hector Geffner