Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Weak, strong, and strong cyclic planning via symbolic model checking
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Efficient on-the-fly algorithms for the analysis of timed games
CONCUR 2005 - Concurrency Theory
A Planning Graph Heuristic for Forward-Chaining Adversarial Planning
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Solving non-deterministic planning problems with pattern database heuristics
KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
Simple and fast strong cyclic planning for fully-observable nondeterministic planning problems
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
| Hi-index | 0.01 |
In this paper, we propose a symbolic planner based on BDDs, which calculates strong and strong cyclic plans for a given non-deterministic input. The efficiency of the planning approach is based on a translation of the nondeterministic planning problems into a two-player turn-taking game, with a set of actions selected by the solver and a set of actions taken by the environment. The formalism we use is a PDDL-like planning domain definition language that has been derived to parse and instantiate general games. This conversion allows to derive a concise description of planning domains with a minimized state vector, thereby exploiting existing static analysis tools for deterministic planning.