Collision Avoidance among Multiple Mobile Robots

Abstract

This paper presents a local approach for real-time collision avoidance among autonomous mobile robots based on non-linear programming. Here, we consider multiple mobile robots travelling to their own destinations in a two-dimensional workspace, e. g., automated guided vehicles in a factory shop. Each robot is assumed to have its identical area and limited sensing area represented by closed circles. In this approach, a distance function between neighbouring two robots is introduced to set up the velocity vector constraint for robots. The desired velocity vector, which enables a robot to navigate without collision by following it, is given as the optimal solution of the objective function under this velocity vector constraint. Our method is implemented using the computer simulated robots. The feasibility and effectiveness of our method are also discussed through the simulation results.