Multi-robot path planning based on improved D* Lite Algorithm

摘要

This paper proposes an improved multi-robot path planning algorithm for finding the path via interacting with multiple robots. The task is to find the path with a minimum amount of computation time by using fast re-planning algorithm. To solve multi-robot path planning problem which cannot be executed in real-time, we regard other robots, exclusive the origin robot, as obstacles. Therefore, the robot uploads location information to the MySQL server to plan a safe distance between robots.