AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Conformant planning via symbolic model checking and heuristic search
Artificial Intelligence
Conformant planning via heuristic forward search: a new approach
Artificial Intelligence
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
Planning graph heuristics for belief space search
Journal of Artificial Intelligence Research
Compiling uncertainty away in conformant planning problems with bounded width
Journal of Artificial Intelligence Research
A translation-based approach to contingent planning
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Domain-independent multi-agent plan repair
Journal of Network and Computer Applications
Hi-index | 0.00 |
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 work, we aim to extend this formulation to non-deterministic conformant planning. We start with the well known observation that non-deterministic effects can be eliminated by using hidden conditions that must be introduced afresh each time a non-deterministic action is applied. This observation, however, leads to translations that have to be recomputed as the search for plans proceeds. We then introduce other translations, that while incomplete, appear to be quite effective and result in classical planning problems that need to be solved only once. A number of experimental results over existing and new domains are reported.