A Path Planning Method Based on Improved Single Player-Monte Carlo Tree Search

With the thorough application and development of Intelligent Logistics System, the Path Planning Problem, which is one of the key problems of logistics scheduling, is accelerating to the direction of dynamics, diversification and complexity. In order to better adapt to the new changes, this paper proposes a path planning method based on improved SP-MCTS (Single-Player Monte Carlo Tree Search) algorithm. Unlike the previous heuristic algorithms, SP-MCTS does not completely depend on parameters, and can more effectively solve variable combinatorial optimization problems. Aiming at the problem of path planning, this paper enhances the simulation process of SP-MCTS by clonal selection algorithm, in order to improve the algorithm's accuracy of locating high-potential branches, and further improve the accuracy of the decisions made by SP-MCTS. Experiments show that the method proposed in this paper is less affected by the parameters and can better solve the changing path planning problem. Compared with the existing path planning methods and original SP-MCTS algorithm, it can solve the changeable path planning problem more stably, faster and more accurately.