Journal of System Simulation
Abstract
Abstract: Multiple robots path planning problem in dynamic environment is one of the significant and basic problems of cluster robot perception and coordination. The planning problem is decomposed into two modules: the path planning and the conflict coordination. By introducing time-cost function, the Time Integrated A* algorithm (TI-A*) is introduced. Variable speed is employed simultaneously to coordinate the motion and hereby to avoid the deadlock and conflict. By adjusting the timing when the coordination phase is involved, two different coordination TI-A* algorithms are presented, including the speed-changing algorithm and path-changing algorithm. The two algorithms are compared and the respective environments are summarized. The simulation results verify that the mobile robot can apply the dynamic path planning in the complex environment so that the algorithm proposed in this paper can solve the existing problems of the existing A * algorithm.
Recommended Citation
Ping, Zhao; Lei, Xinyu; Chen, Bozhi; and Yang, Jiaoyun
(2019)
"TI-A* Based Multi-robot Dynamic Planning and Coordination Method,"
Journal of System Simulation: Vol. 31:
Iss.
5, Article 13.
DOI: 10.16182/j.issn1004731x.joss.17-0280
Available at:
https://dc-china-simulation.researchcommons.org/journal/vol31/iss5/13
First Page
925
Revised Date
2017-08-01
DOI Link
https://doi.org/10.16182/j.issn1004731x.joss.17-0280
Last Page
935
CLC
TP242
Recommended Citation
Zhao Ping, Lei Xinyu, Chen Bozhi, Yang Jiaoyun. TI-A* Based Multi-robot Dynamic Planning and Coordination Method[J]. Journal of System Simulation, 2019, 31(5): 925-935.
DOI
10.16182/j.issn1004731x.joss.17-0280
Included in
Artificial Intelligence and Robotics Commons, Computer Engineering Commons, Numerical Analysis and Scientific Computing Commons, Operations Research, Systems Engineering and Industrial Engineering Commons, Systems Science Commons