Abstract
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-based algorithm which gave very good results in computer games, and especially in Computer Go, with heuristic search in order to obtain an anytime planner that provides partial plans before finding a solution plan, and furthermore finding an optimal plan. The algorithm is evaluated in different classical planning problems and compared to some major planning algorithms. Finally, our results highlight the capacity of MHSP to return partial plans which tend to an optimal plan over the time.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Auer, P., Cesa-Bianchi, N., Fisher, P.: Finite-time Analysis of the Multiarmed Bandit Problem. Machine Learning 47(2–3), 235–256 (2002)
Bonet, B., Geffner, H.: Planning as Heuristic Search. Artificial Intelligence 129(1–2), 5–33 (2001)
Chaslot, G., Winands, M., van den Herik, H., Uiterwijk, J., Bouzy, B.: Progressive Strategies for Monte-Carlo Tree Search. New Mathematics and Natural Computation 4(3), 343–357 (2008)
Chen, Y., Huang, R., Zhang, W.: Fast Planning by Search in Domain Transition Graphs. In: Proc. AAAI, pp. 886–891 (2008)
Gelly, S., Wang, Y., Munos, R., Teytaud, O.: Modification of UCT with Patterns in Monte-Carlo Go. Tech. Rep. RR-6062, INRIA (2006)
Gerevini, A., Serina, I.: LPG: A Planner Based on Local Search for Planning Graphs with Action Costs. In: Proc. ICAPS, pp. 13–22 (2002)
Grandcolas, S., Pain-Barre, C.: Filtering, Decomposition and Search Space Reduction for Optimal Sequential Planning. In: Proc. AAAI (2007)
Hansen, E.A., Zhou, R.: Anytime Heuristic Search. JAIR 28(1), 267–297 (2007)
Hayes-Roth, B.: An architecture for adaptive intelligent systems. Artificial Intelligence 72, 329–365 (1995)
Hoffmann, J., Nebel, B.: The FF Planning System: Fast Plan Generation Through Heuristic Search. JAIR 14(1), 253–302 (2001)
Hsu, C.W., Wah, B., Huang, R., Chen, Y.: Handling Soft Constraints and Goals Preferences in SGPlan. In: Proc. of the ICAPS Workshop on Preferences and Soft Constraints in Planning (2006)
Kautz, H.A., Selman, B.: Unifying SAT-based and Graph-based Planning. In: Proc. IJCAI, pp. 318–325 (1999)
Kocsis, L., Szepesvari, C.: Bandit-based Monte-Carlo Planning. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282–293. Springer, Heidelberg (2006)
Koehler, J., Nebel, B., Hoffmann, J., Dimopoulos, Y.: Extending planning graphs to an ADL subset. In: Steel, S. (ed.) ECP 1997. LNCS, vol. 1348, pp. 273–285. Springer, Heidelberg (1997)
Korf, R.: Real-Time Heuristic Search. Artificial Intelligence 42(2-3), 189–211 (1990)
Musliner, D., Goldman, R., Krebsbach, K.: Deliberation scheduling strategies for adaptive mission planning in real-time environments. In: Proceedings of the Third International Workshop on Self Adaptive Software (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pellier, D., Bouzy, B., Métivier, M. (2010). An UCT Approach for Anytime Agent-Based Planning. In: Demazeau, Y., Dignum, F., Corchado, J.M., Pérez, J.B. (eds) Advances in Practical Applications of Agents and Multiagent Systems. Advances in Intelligent and Soft Computing, vol 70. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12384-9_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-12384-9_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12383-2
Online ISBN: 978-3-642-12384-9
eBook Packages: EngineeringEngineering (R0)