Sciweavers

5 search results - page 1 / 1
» Compiling Uncertainty Away: Solving Conformant Planning Prob...
Sort
View
AAAI
2006
13 years 6 months 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
ECAI
2010
Springer
13 years 5 months 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...
AIPS
2009
13 years 5 months ago
Automatic Derivation of Memoryless Policies and Finite-State Controllers Using Classical Planners
Finite-state and memoryless controllers are simple action selection mechanisms widely used in domains such as videogames and mobile robotics. Memoryless controllers stand for func...
Blai Bonet, Héctor Palacios, Hector Geffner
AIPS
2004
13 years 6 months 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
2010
13 years 6 months ago
Automatic Derivation of Finite-State Machines for Behavior Control
Finite-state controllers represent an effective action selection mechanisms widely used in domains such as video-games and mobile robotics. In contrast to the policies obtained fr...
Blai Bonet, Héctor Palacios, Hector Geffner