Abstract
To realize the intellectualization of the industrial park and liberate the employees from the repetitive work, the material distribution method based on muti robot needs to be studied. This paper explores and improves two multi robot path planning algorithms HCA and CBS based on A * algorithm through the specific analysis of the environment in the industrial park, so that the robot can avoid dynamic obstacles. Furthermore, after simulation through webots, the advantages and disadvantages of the two algorithms are compared. Finally, through the demand analysis of the industrial park, a feasible scheme for multi-robot path planning in the industrial park is obtained.
Publisher
Darcy & Roy Press Co. Ltd.