Abstract
Monte Carlo Tree Search (MCTS) techniques brought fresh breeze to the area of computer games where they significantly improved solving algorithms for games such as Go. MCTS also worked well when solving a real-life planning problem of the Petrobras company brought by the Fourth International Competition on Knowledge Engineering Techniques for Planning and Scheduling. In this paper we generalize the ideas of using MCTS techniques in planning, in particular for transportation problems. We highlight the difficulties of applying MCTS in planning, we show possible approaches to overcome these difficulties, and we propose a particular method for solving transportation problems.
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
Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time Analysis of the Multiarmed Bandit Problem. Machine Learning 47(2-3), 235–256 (2002)
Baudiš, P.: Balancing MCTS by Dynamically Adjusting Komi Value. ICGA Journal 34, 131–139 (2011)
Chaslot, G., Bakkes, S., Szita, I., Spronck, P.: Monte-Carlo Tree Search: A New Framework for Game AI. In: Proceedings of the 4th Artificial Intelligence for Interactive Digital Entertainment conference (AIIDE), pp. 216–217. AAAI Press (2008)
Dechter, R.: Constraint Processing. Morgan Kaufmann Publishers Inc. (2003)
Ghallab, M., Nau, D.S., Traverso, P.: Automated Planning: Theory and Practice. Elsiever Morgan Kaufmann, Amsterdam (2004)
Gerevini, A., Saetti, A., Serina, I.: Planning in PDDL2.2 Domains with LPG-TD. In: International Planning Competition, 14th International Conference on Automated Planning and Scheduling (IPC at ICAPS) (2004)
Kocsis, L., Szepesvári, 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)
Loth, M., Sebag, M., Hamadi, Y., Schoenauer, M., Schulte, C.: Hybridizing Constraint Programming and Monte-Carlo Tree Search: Application to the Job Shop Problem (unpublished)
Nakhost, H., Müller, M.: Monte-Carlo exploration for deterministic planning. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 1766–1771 (2009)
Olaya, A., López, C., Jiménez, S.: International Planning Competition (2011), http://ipc.icaps-conference.org/ (retrieved)
Schadd, M.P.D., Winands, M.H.M., van den Herik, H.J., Chaslot, G.M.J.B., Uiterwijk, J.W.H.M.: Single-player Monte-Carlo tree search. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 1–12. Springer, Heidelberg (2008)
Schadd, M.P.D., Winands, M.H.M., van den Herik, H.J., Aldewereld, H.: Addressing NP-Complete Puzzles with Monte-Carlo Methods. In: Proceedings of the AISB 2008 Symposium on Logic and the Simulation of Interaction and Reasoning vol. 9, (2008)
Toropila, D., Dvořák, F., Trunda, O., Hanes, M., Barták, R.: Three Approaches to Solve the Petrobras Challenge: Exploiting Planning Techniques for Solving Real-Life Logistics Problems. In: Proceedings of ICTAI 2012, pp. 191–198. IEEE Conference Publishing Services (2012)
Trunda, O.: Monte Carlo Techniques in Planning. Master’s thesis. Faculty of Mathematics and Physics, Charles University in Prague (2013)
Vaquero, T.S., Costa, G., Tonidandel, F., Igreja, H., Silva, J.R., Beck, C.: Planning and scheduling ship operations on petroleum ports and platform. In: Proceedings of the ICAPS Scheduling and Planning Applications Workshop, pp. 8–16 (2012)
Wickler, G.: Using planning domain features to facilitate knowledge engineering. In: Proceedings of the Workshop on Knowledge Engineering for Planning and Scheduling (KEPS 2011), pp. 39–46 (2011)
Xie, F., Nakhost, H., Müller, M.: A Local Monte Carlo Tree Search Approach in Deterministic Planning. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI 2011), pp. 1832–1833 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Trunda, O., Barták, R. (2013). Using Monte Carlo Tree Search to Solve Planning Problems in Transportation Domains. In: Castro, F., Gelbukh, A., González, M. (eds) Advances in Soft Computing and Its Applications. MICAI 2013. Lecture Notes in Computer Science(), vol 8266. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45111-9_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-45111-9_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45110-2
Online ISBN: 978-3-642-45111-9
eBook Packages: Computer ScienceComputer Science (R0)