Abstract
This paper is a report on research towards the development of an abstraction-based framework for decision-theoretic planning. We make use of two planning approaches in the context of probabilistic planning: planning by abstraction and planning graphs. To create abstraction hierarchies our planner uses an adapted version of a hierarchical planner under uncertainty, and to search for plans, we propose a probabilistic planning algorithm based on Pgraphplan. The article outlines the main framework characteristics, and presents results on some problems found in the literature. Our preliminary results suggest that our planner can reduce the size of the search space, when compared with Pgraphplan, hierarchical planning under uncertainty and top-down dynamic programming.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Geffner, H., Bonet, B.: Solving Large POMDPs Using Real Time Dynamic Programming. In: Working Notes Fall AAAI Symposium on POMDPS (1998)
Bonet, B., Geffner, H.: Planning and Control in Artificial Intelligence: A Unifying Perspective. Appl. Intell. 14(3), 237–252 (2001)
Younes, H.L.S., Littman, M.L.: PPDDL1.0: An extension to PDDL for expressing planning domains with probabilistic effects. Technical Report CMU-CS-04-167, Pittsburgh (2004)
Kushmerick, N., Hanks, S., Weld, D.: An Algorithm for Probabilistic Planning. Artificial Intelligence. 76, 239–286 (1994)
Blyte, J.: Planning Under Uncertainty in Dynamic Domains. Doctor Thesis. Carnegie Mellon University, Pittsburgh, PA (May 1998)
Bougerra, A., Karlsson, L.: Hierarchical Task Planning under Uncertainty. In: 3rd Italian Workshop on Planning and Scheduling, Perugia, Italy (2004)
Doan, A., Haddawy, P.: Decision-Theoretic Refinement Planning: Principles and Application. Technical Report TR 95-01-01 (February 1995)
Blum, A.L., Langford, J.C.: Probabilistic planning in the graphplan framework. proceedings EPC, 319–332 (1999)
Blum, A.L., Langford, J.C.: Probabilistic planning in the graphplan framework. In: AIPS 1998 Workshop on Planning as Combinatorial Search (June 8-12, 1998)
Little, I., Thiébaux, S.: Concurrent Probabilistic Planning in the Graphplan Framework. In: ICAPS 2006. Proceedings: 16th International Conference on Automated Planning and Scheduling (2006)
Little, I., Aberdeen, D., Thiébaux, S.: Prottle: A probabilistic temporal planner. In: AAAI 2005. Proc. of the 20th American Nat. Conf. on Artificial Intelligence (2005)
Nau, D., Cao, Y., Lotem, A., Munoz-Avila, H.: Shop: Simple hierarchical ordered planner. In: Procs. of the Int. Joint Conference on AI, pp. 968–973 (1999)
Giunchiglia, F., Villaorita, A., Walsh, T.: Theories of abstraction. AI Communication 10(3-4), 167–176 (1997)
Knoblock, C.: An analysis of Abstrips. In: Artificial Intelligence Planning Systems: Proceedings of the first international conference (1992)
Knoblock, C.: Automatically generating abstractions for planning. Artificial Intelligence 68(2), 243–302 (1994)
Armano, G., Cherchi, G., Vargiu, E.: A Parametric Hierarchical Planner for Experimenting Abstraction Techniques. In: IJCAI 2003, pp. 936–941 (2003)
Blum, A., Furst, M.: Fast Planning through Planning Graph Analysis. Artificial Intelligence 90, 281–300 (1997)
Friske, L.M., Ribeiro, C.H.C.: Planning Under Uncertainty with Abstraction Hierarchies. In: Corchado, E., Yin, H., Botti, V., Fyfe, C. (eds.) IDEAL 2006. LNCS, vol. 4224, pp. 1057–1066. Springer, Heidelberg (2006)
Ghallab, M., Nau, D., Traverso, P.: Automated Planning Theory and Pratice. Morgan Kaufmann Publishers, San Francisco (2004)
Wenxiang, G., Rixian, L., Huajie, O., Minghao, Y.: An Improved Probabilistic Planning Algorithm Based on Pgraphplan. In: Proceedings of the Third International Conference on Machine Learning and Cybernetics, vol. 4, pp. 2374–2377 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Friske, L., Ribeiro, C.H.C. (2007). HPGP: An Abstraction-Based Framework for Decision-Theoretic Planning. In: Yin, H., Tino, P., Corchado, E., Byrne, W., Yao, X. (eds) Intelligent Data Engineering and Automated Learning - IDEAL 2007. IDEAL 2007. Lecture Notes in Computer Science, vol 4881. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77226-2_44
Download citation
DOI: https://doi.org/10.1007/978-3-540-77226-2_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77225-5
Online ISBN: 978-3-540-77226-2
eBook Packages: Computer ScienceComputer Science (R0)