Approximate reasoning about actions in presence of sensing and incomplete information
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Computational complexity of planning and approximate planning in the presence of incompleteness
Artificial Intelligence
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Polynomial-Length Planning Spans the Polynomial Hierarchy
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Some Results on the Complexity of Planning with Incomplete Information
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Planning as Heuristic Search: New Results
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Constraint Processing
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
Conformant planning for domains with constraints: a new approach
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
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
A translation-based approach to contingent planning
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Using CSP look-back techniques to solve real-world SAT instances
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Brothers in Arms? On AI Planning and Cellular Automata
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Compiling Uncertainty Away in Non-Deterministic Conformant Planning
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
A translation based approach to probabilistic conformant planning
ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
Generalized planning: synthesizing plans that work for multiple environments
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Planning under partial observability by classical replanning: theory and experiments
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Replanning in domains with partial information and sensing actions
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
COLIN: planning with continuous linear numeric change
Journal of Artificial Intelligence Research
SAP speaks PDDL: exploiting a software-engineering model for planning in business process management
Journal of Artificial Intelligence Research
Online speedup learning for optimal planning
Journal of Artificial Intelligence Research
A conformant planner based on approximation: CpA(H)
ACM Transactions on Intelligent Systems and Technology (TIST) - Special section on agent communication, trust in multiagent systems, intelligent tutoring and coaching systems
An approximative inference method for solving ∃∀SO satisfiability problems
Journal of Artificial Intelligence Research
Replanning in domains with partial information and sensing actions
Journal of Artificial Intelligence Research
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Optimal delete-relaxed (and semi-relaxed) planning with conditional effects
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
Conformant planning is the problem of finding a sequence of actions for achieving a goal in the presence of uncertainty in the initial state or action effects. The problem has been approached as a path-finding problem in belief space where good belief representations and heuristics are critical for scaling up. In this work, a different formulation is introduced for conformant problems with deterministic actions where they are automatically converted into classical ones and solved by an off-the-shelf classical planner. The translation maps literals L and sets of assumptions t about the initial situation, into new literals KL/t that represent that L must be true if t is initially true. We lay out a general translation scheme that is sound and establish the conditions under which the translation is also complete. We show that the complexity of the complete translation is exponential in a parameter of the problem called the conformant width, which for most benchmarks is bounded. The planner based on this translation exhibits good performance in comparison with existing planners, and is the basis for T0, the best performing planner in the Conformant Track of the 2006 International Planning Competition.