Toward a mathematical theory of plan synthesis
Toward a mathematical theory of plan synthesis
Conditional nonlinear planning
Proceedings of the first international conference on Artificial intelligence planning systems
Automatic OBDD-based generation of universal plans in non-deterministic domains
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Extending Graphplan to handle uncertainty and sensing actions
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
Formalizing sensing actions—a transition function based approach
Artificial Intelligence
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Knowledge, action, and the frame problem
Artificial Intelligence
Planning for contingencies: a decision-based approach
Journal of Artificial Intelligence Research
Constructing conditional plans by a theorem-prover
Journal of Artificial Intelligence Research
What is planning in the presence of sensing?
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Automated composition of Web services via planning in asynchronous domains
Artificial Intelligence
On-line planning and scheduling: an application to controlling modular printers
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
In this paper, we present a state-based regression function for planning domains where an agent does not have complete information and may have sensing actions. We consider binary domains, and employ the 0-approximation (Son & Baral 2001) to define the regression function. In binary domains, the use of 0-approximation means using 3-valued states. Although planning using this approach is incomplete with respect to the full semantics, we adopt it to have a lower complexity. We prove the soundness and completeness of our regression formulation with respect to the definition of progression and develop a conditional planner that utilizes our regression function.