A Multi-robot Path Planning Algorithm for Underground Pipeline Network Environment

被引：0
|
作者：
He Z. [1 ]
Mao J. [1 ]
Yang Z. [1 ]
Zhang K. [2 ]
Zhang S. [2 ]
Fu L. [1 ]
机构：
[1] School of Information Engineering and Automation, Kunming University of Science and Technology, Kunming
[2] School of Mechanical and Electrical Engineering, Kunming University of Science and Technology, Kunming
来源：
Jiqiren/Robot | 2024年 / 46卷 / 01期
关键词：
deterministic re-scheduling; end point blocking; intermediate point; multi-robot; path planning; position interlocking; SIPP (safe-interval path planning) algorithm;
D O I：
10.13973/j.cnki.robot.230159
中图分类号：
学科分类号：
摘要：
Currently, path planning algorithms struggle to effectively address challenges in multi-robot tasks in underground pipeline networks due to the fact that each channel can only accommodate one robot, such as the issues of numerous endpoint blockages and position interlocking. Therefore, a dynamic priority SIPP (safe-interval path planning) algorithm with intermediate point is proposed, named DPiSIPP. Firstly, a deterministic re-scheduling method is proposed to prioritize the planning of robots that encounter endpoint blockages, thereby facilitating their removal. Then, an intermediate point is incorporated into the segmented planning process for robots experiencing position interlocking. This approach aims to either directly resolve the interlocking relationship or transform the position interlocking issue into an endpoint blocking problem for resolution. The experimental results demonstrate that the success rate of the proposed DPiSIPP algorithm can outperform Anytime SIPP, WSIPPd (weighted SIPP with duplicate states), and enhanced CBS (conflict-based search) algorithms by up to 30%, 30%, and 10%, respectively, in the context of underground pipeline networks, indicating that the proposed algorithm has a clear advantage over the aforementioned algorithms in terms of solving performance. © 2024 Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码：94 / 104and117
相关论文
共 25 条
  • [1] ANDREYCHUK A, YAKOVLEV K, BOYARSKI E, Et al., Improving continuous-time conflict based search, 14th International Symposium on Combinatorial Search, pp. 145-146, (2021)
  • [2] XUAN Z W, MAO J L, ZHANG K X., Low-expansion A<sup>∗</sup> algorithm based on CBS framework for complex map, Acta Electronica Sinica, 50, 8, pp. 1943-1950, (2022)
  • [3] REN Z Q, RATHINAM S, CHOSET H., Subdimensional expansion for multi-objective multi-agent path finding, IEEE Robotics and Automation Letters, 6, 4, pp. 7153-7160, (2021)
  • [4] ZHANG K X, MAO J L, XIANG F H, Et al., B-IHCA<sup>∗</sup> multi robot path planning algorithm based on bargaining game mechanism, Acta Automatica Sinica, 49, 7, pp. 1483-1497, (2023)
  • [5] SOLIS I, MOTES J, SANDSTROM R, Et al., Representation-optimal multi-robot motion planning using conflict-based search, IEEE Robotics and Automation Letters, 6, 3, pp. 4608-4615, (2021)
  • [6] CHEN X, LI Y J, LIU L T., A coordinated path planning algorithm for multi-robot in intelligent warehouse, IEEE International Conference on Robotics and Biomimetics, pp. 2945-2950, (2019)
  • [7] SHARON G, STERN R, FELNER A, Et al., Conflict-based search for optimal multi-agent pathfinding, Artificial Intelligence, 219, pp. 40-66, (2015)
  • [8] BOYARSKI E, FELNER A, STERN R, Et al., ICBS: The improved conflict-based search algorithm for multi-agent path finding, 8th International Symposium on Combinatorial Search, pp. 223-225, (2015)
  • [9] FELNER A, LI J, BOYARSKI E, Et al., Adding heuristics to conflict-based search for multi-agent path finding, 28th International Conference on Automated Planning and Scheduling, pp. 83-87, (2018)
  • [10] ANDREYCHUK A, YAKOVLEV K, SURYNEK P, Et al., Multi-agent pathfinding with continuous time, Artificial Intelligence, (2022)
123