Journal of System Simulation ›› 2022, Vol. 34 ›› Issue (12): 2659-2669.doi: 10.16182/j.issn1004731x.joss.22-FZ0926

• VV&A Technology • Previous Articles     Next Articles

Multi-robot Path Planning Based on CBS Algorithm

Qiao Qiao(), Yan Wang(), Zhicheng Ji   

  1. Engineering Research Center of Internet of Things Technology Applications Ministry of Education, Jiangnan University, Wuxi 214122, China
  • Received:2022-08-07 Revised:2022-09-23 Online:2022-12-31 Published:2022-12-21
  • Contact: Yan Wang E-mail:905523350@qq.com;wangyan@jiangnan.edu.cn

Abstract:

Aiming at the long multi-robot planning path and long one-way search running time of conflict-based search(CBS) in the multi-agent path finding(MAPF), an improved CBS algorithm is proposed, which in a two-way A* focus search is used to optimize the search direction and search method. The suboptimal factorωis introduced into the underlying search function of the CBS algorithm to improve the efficiency of path search. The one-way search in the conflict search algorithm is optimized to a two-way A* search. The experimental results show that the path cost of the improved CBS algorithm is shortened by 14.82%, and the total running time is shortened by 10.63%.

Key words: multi-agent path finding(MAPF), two-way search, focus search, path planning, conflict-based search(CBS)

CLC Number: