Using Monte Carlo Tree Search to Solve Planning Problems in Transportation Domains

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.

[1]  Ivan Serina,et al.  Planning in PDDL2.2 Domains with LPG-td , 2004 .

[2]  Neil D. Lawrence,et al.  Missing Data in Kernel PCA , 2006, ECML.

[3]  Peter Auer,et al.  Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.

[4]  Maarten P. D. Schadd,et al.  Addressing NP-Complete Puzzles with Monte-Carlo Methods 1 , 2008 .

[5]  Petr Baudis,et al.  Balancing MCTS by Dynamically Adjusting the Komi Value , 2011, J. Int. Comput. Games Assoc..

[6]  Gerhard Wickler Using Planning Domain Features to Facilitate Knowledge Engineering , 2011 .

[7]  Martin Müller,et al.  Monte-Carlo Exploration for Deterministic Planning , 2009, IJCAI.

[8]  Roman Barták,et al.  Three Approaches to Solve the Petrobras Challenge: Exploiting Planning Techniques for Solving Real-Life Logistics Problems , 2012, 2012 IEEE 24th International Conference on Tools with Artificial Intelligence.

[9]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

[10]  Zongmin Ma,et al.  Computers and Games , 2008, Lecture Notes in Computer Science.

[11]  Csaba Szepesvári,et al.  Bandit Based Monte-Carlo Planning , 2006, ECML.

[12]  Otakar Trunda Monte Carlo Techniques in Planning , 2013 .

[13]  Paolo Traverso,et al.  Automated planning - theory and practice , 2004 .

[14]  Michèle Sebag,et al.  Hybridizing Constraint Programming and Monte-Carlo Tree Search: Application to the Job Shop Problem , 2013, LION.

[15]  Martin Müller,et al.  A Local Monte Carlo Tree Search Approach in Deterministic Planning , 2011, AAAI.

[16]  Pieter Spronck,et al.  Monte-Carlo Tree Search: A New Framework for Game AI , 2008, AIIDE.

[17]  H. Jaap van den Herik,et al.  Single-Player Monte-Carlo Tree Search , 2008, Computers and Games.