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.
展开▼
