Cited By
View all- Bryce DCushing WKambhampati S(2019)State agnostic planning graphsArtificial Intelligence10.1016/j.artint.2010.12.002175:3-4(848-889)Online publication date: 2-Jan-2019
Improving heuristics for planning as search in belief space
Pages 143 - 152
Abstract
Search in the space of beliefs has been proposed as a convenient framework for tackling planning under uncertainty. Significant improvements have been recently achieved, especially thanks to the use of symbolic model checking techniques such as Binary Decision Diagrams. However, the problem is extremely complex, and the heuristics available so far are unable to provide enough guidance for an informed search.
In this paper we tackle the problem of defining effective heuristics for driving the search in belief space. The basic intuition is that the "degree of knowledge" associated with the belief states reached by partial plans must be explicitly taken into account when deciding the search direction. We propose a way of ranking belief states depending on their degree of knowledge with respect to a given set of boolean functions. This allows us to define a planning algorithm based on the identification and solution of suitable "knowledge subgoals", that are used as intermediate steps during the search. The solution of knowledge subgoals is based on the identification of "knowledge acquisition conditions", i.e. subsets of the state space from where it is possible to perform knowledge acquisition actions. We show the effectiveness of the proposed ideas by observing substantial improvements in the conformant planning algorithms of MBP.
References
[1]
Bertoli, P.; Cimatti, A.; Pistore, M.; Roveri, M.; and Traverso, P. 2001a. MBP: a Model Based Planner. In Proc. of the IJCAI'01 Workshop on Planning under Uncertainty and Incomplete Information.
[2]
Bertoli, P.; Cimatti, A.; Roveri, M.; and Traverso, P. 2001b. Planning in Nondeterministic Domains under Partial Observability via Symbolic Model Checking. In Proc. 7th International Joint Conference on Artificial Intelligencof (IJCAI-01). AAAI Press.
[3]
Bertoli, P.; Cimatti, A.; and Roveri, M. 2001a. Conditional Planning under Partial Observability as Heuristic-Symbolic Search in Belief Space. In A. Cesta, D. B., ed., Proceedings ECP'01.
[4]
Bertoli, P.; Cimatti, A.; and Roveri, M. 2001b. Heuristic Search + Symbolic Model Checking = Efficient Conformant Planning. In Proc. 7th International Joint Conference on Artificial Intelligencof (IJCAI-01). AAAI Press.
[5]
Bonet, B., and Geffner, H. 2000. Planning with Incomplete Information as Heuristic Se arch in Belief Space. In Chien, S.; Kambhampati, S.; and Knoblock, C., eds., 5th International Conference on Artificial Intelligence Planning and Scheduling, 52-61. AAAI-Press.
[6]
Bryant, R. E. 1992. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys 24(3):293-318.
[7]
Castellini, C.; Giunchiglia, E.; and Tacchella, A. 2001. Improvements to SAT-based Conformant Planning. In A. Cesta, D. B., ed., Proceedings ECP'01.
[8]
Cimatti, A., and Roveri, M. 2000. Conformant Planning via Symbolic Model Checking. Journal of Artificial Intelligence Research (JAIR) 13:305-338.
[9]
Cimatti, A.; Clarke, E.; Giunchiglia, F.; and Roveri, M. 1998. NuSMV: a reimplementation of SMV. In Proceeding of the International Workshop on Software Tools for Technology Transfer (STTT-98), 25-31. Aalborg, Denmark: BRICS Notes Series, NS-98-4. Also IRST-Technical Report 9801-06, Trento, Italy.
[10]
Cimatti, A.; Roveri, M.; and Bertoli, P. 2001. Searching Powerset Automata by Combining Explicit-State and Symbolic Model Checking. In Proceedings of the 7th International Conference on Tools and Algorithms for the Construction of Systems, 313-327. Springer.
[11]
Cimatti, A.; Roveri, M.; and Traverso, P. 1998a. Automatic OBDD-based Generation of universal Plans in Non-Deterministic Domains. In Proceeding of the Fifteenth National Conference on Artificial Intelligence (AAAI-98). Madison, Wisconsin: AAAI-Press. Also IRST-Technical Report 9801-10, Trento, Italy.
[12]
Cimatti, A.; Roveri, M.; and Traverso, P. 1998b. Strong Planning in Non-Deterministic Domains via Model Checking. In Proceeding of the Fourth International Conference on Artificial Intelligence Planning Systems (AIPS-98). Carnegie Mellon university, Pittsburgh, uSA: AAAI-Press.
[13]
De Giacomo, G., and Vardi, M. 1999. Automata-Theoretic Approach to Planning for Temporally Extended Goals. In Biundo, S., ed., Proceeding of the Fifth European Conference on Planning, Lecture Notes in Artificial Intelligence. Durham, United Kingdom: Springer-Verlag.
[14]
Eiter, T.; Faber, W.; Leone, N.; Pfeifer, G.; and Polleres, A. 2001. The DLVk Planning System. In Proceedings of the IJCAI-01 Workshop on Planning with Uncertainty and Incomplete Information.
[15]
Filzi, A.; Pirri, F.; and Reiter, R. 2000. Open world planning in the situation calculus. In Proceedings of Seventeenth National Conference on Artificial Intelligence (AAAI'00). Austin, Texas: AAAI Press.
[16]
Giunchiglia, E.; Kartha, G. N.; and Lifschitz, V. 1997. Representing action: Indeterminacy and ramifications. Artificial Intelligence 95(2):409-438.
[17]
Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14:253-302.
[18]
Kabanza, F.; Barbeau, M.; and St-Denis, R. 1997. Planning control rules for reactive agents. Artificial Intelligence 95(1):67-113.
[19]
Kurien, J.; Nayak, P. P.; and Smith, D. 2001. Fragment-based Conformant Planning. Unpublished document.
[20]
Pixley, C.; Jeong, S.-W.; and Hachtel, G. D. 1992. Exact calculation of synchronization sequences based on binary decision diagrams. In Proceedings of the 29th Conference on Design Automation, 620-623. Los Alamitos, CA, USA: IEEE Computer Society Press.
[21]
Pryor, L., and Collins, G. 1996. Planning for Contingency: a Decision Based Approach. J. of Artificial Intelligence Research 4:81-120.
[22]
Rho, J.-K.; Somenzi, F.; and Pixley, C. 1993. Minimum length synchronizing sequences of finite state machine. In IEEE, A.-S., ed., Proceedings of the 30th ACM/IEEE Design Automation Conference, 463-168. Dallas, TX: ACM Press.
[23]
Rintanen, J. 1999. Constructing conditional plans by a theorem-prover. Journal of Artificial Intellegence Research 10:323-352.
[24]
Smith, D. E., and Weld, D. S. 1998. Conformant graph-plan. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98) and of the 10th Conference on Innovative Applications of Artificial Intelligence (IAAI-98), 889-896. Menlo Park: AAAI Press.
[25]
Somenzi, F. 1997. CUDD: CU Decision Diagram package — release 2.1.2. Department of Electrical and Computer Engineering — University of Colorado at Boulder.
[26]
Thiebaux, S., and Cordier, M. 2001. Supply restoration in power distribution systems - a benchmark for planning under uncertainty. In A. Cesta, D. B., ed., Proceedings ECP'01.
[27]
Weld, D. S.; Anderson, C. R.; and Smith, D. E. 1998. Extending graphplan to handle uncertainty and sensing actions. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98) and of the 10th Conference on Innovative Applications of Artificial Intelligence (IAAI-98), 897-904. Menlo Park: AAAI Press.
Recommendations
Planning graph heuristics for belief space search
Some recent works in conditional planning have proposed reachability heuristics to improve planner scalability, but many lack a formal description of the properties of their distance estimates. To place previous work in context and extend work on ...
Planning with incomplete information as heuristic search in belief space
AIPS'00: Proceedings of the Fifth International Conference on Artificial Intelligence Planning SystemsThe formulation of planning as heuristic search with heuristics derived from problem representations has turned out to be a fruitful approach for classical planning. In this paper, we pursue a similar idea in the context planning with incomplete ...
Contingent planning via heuristic forward search with implicit belief states
ICAPS'05: Proceedings of the Fifteenth International Conference on International Conference on Automated Planning and SchedulingContingent planning is the task of generating a conditional plan given uncertainty about the initial state and action effects, but with the ability to observe some aspects of the current world state. Contingent planning can be transformed into an And-Or ...
Comments
Information & Contributors
Information
Published In
Sponsors
- Centre National de la Recherche Scientifique
- AAAI: American Association for Artificial Intelligence
- NASA Ames Research Center: NASA Ames Research Center
- INRIA: Institut Natl de Recherche en Info et en Automatique
- Association Française des Sciences et Technologies de I'Information
Publisher
AAAI Press
Publication History
Published: 23 April 2002
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 13 Jan 2025
Other Metrics
Citations
Cited By
View all- Bryce DCushing WKambhampati S(2019)State agnostic planning graphsArtificial Intelligence10.1016/j.artint.2010.12.002175:3-4(848-889)Online publication date: 2-Jan-2019