Abstract
This article presents a hierarchical planner to actuate in uncertain domains named HIPU – Hierarchical Planner under Uncertainty. The uncertainties treated by HIPU include the probabilistic distribution of the operators effects and a distribution of probabilities on the possible initial states of the domain. HIPU automatically creates the abstraction hierarchy that will be used during planning, and for this it uses an extension of the Alpine method, adapted to act under uncertainty conditions. The planning process in HIPU happens initially in the highest level of abstraction, and the solution found in this level is refined by lower levels, until reaching the lowest level. During the search the plan evaluation is carried out, indicating if the plan achieves the goal with a success probability larger or equal to a previously defined value. To evaluate this probability, the planner uses the forward projection method.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Blyte, J.: Planning Under Uncertainty in Dynamic Domains. Doctor Thesis. Carnegie Mellon University, Pittsburgh, PA (May 1998)
Tadepalli, P., Givan, R., Driessens, K.: Relational Reinforcement Learning: An Overview. In: Procs. ICML 2004, Workshop on RRL, Canada (2004)
Kushmerick, N., Hanks, S., Weld, D.: An Algorithm for Probabilistic Planning. Artificial Intelligence (1994)
Hanks, S.: Classical Planning under Uncertainty. In: proceedings ARPI (1996)
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)
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)
Draper, D., Hanks, S., Weld, D.: Probabilistic planning with information gathering and contingent execution. In: Proc. 2nd International Conference on Artificial Intelligence Planning Systems, pp. 31–37. AAAI Press, Menlo Park (1994)
Nau, D., Cao, Y., Lotem, A., Munoz-Avila, H.: Shop: Simple hierarchical ordered planner. In: Procs of the Int. Joint Conference on AI, August 1999, pp. 968–973 (1999)
Korf, R.: Planning as search: A quantitative approach. Artificial Intelligence 33, 65–88 (1987)
Knoblock, C.: Automatically Generating Abstractions for Problem Solving. Doctoral Thesis, Carnegie Mellon University (May 1991)
Knoblock, C.: Automatically generating abstractions for planning. Artificial Intelligence 68(2), 243–302 (1994)
Fikes, R.E., Nilsson, N.J.: STRIPS: A new approach to the application of theorem proving to problem solving. Atificial Intelligence 2, 189–208 (1971)
Russel, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach, p. 932. Prentice-Hall, Englewood Cliffs (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Friske, L.M., Ribeiro, C.H.C. (2006). Planning Under Uncertainty with Abstraction Hierarchies. In: Corchado, E., Yin, H., Botti, V., Fyfe, C. (eds) Intelligent Data Engineering and Automated Learning – IDEAL 2006. IDEAL 2006. Lecture Notes in Computer Science, vol 4224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11875581_126
Download citation
DOI: https://doi.org/10.1007/11875581_126
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45485-4
Online ISBN: 978-3-540-45487-8
eBook Packages: Computer ScienceComputer Science (R0)