Path planning and collision avoidance methods for distributed multi-robot systems in complex dynamic environments


 Multi-robot systems are experiencing increasing popularity in joint rescue, intelligent transportation, and other fields. However, path planning and navigation obstacle avoidance among multiple robots, as well as dynamic environments, raise significant challenges. We propose a distributed multi-mobile robot navigation and obstacle avoidance method in unknown environments. First, we propose a bidirectional alternating jump point search A* algorithm (BAJPSA*) to obtain the robot's global path in the prior environment and further improve the heuristic function to enhance efficiency. We construct a robot kinematic model based on the dynamic window approach (DWA), present an adaptive navigation strategy, and introduce a new path tracking evaluation function that improves path tracking accuracy and optimality. To strengthen the security of obstacle avoidance, we modify the decision rules and obstacle avoidance rules of the single robot and further improve the decision avoidance capability of multi-robot systems. Moreover, the mainstream prioritization method is used to coordinate the local dynamic path planning of our multi-robot systems to resolve collision conflicts, reducing the difficulty of obstacle avoidance and simplifying the algorithm. Experimental results show that this distributed multi-mobile robot motion planning method can provide better navigation and obstacle avoidance strategies in complex dynamic environments, which provides a technical reference in practical situations.
