Multiple Robot motion Planning Considering shortest and safest trajectory

Document Type: Original Article


1 Department of software engineering, ATYRAU State University named after Khalel Dosmukhamedov, Kazakhstan

2 Department of Industrial Engineering, College of Technical and Engineering, Saveh Branch, Islamic Azad University (IAU), Saveh, Iran

3 Power System Planning and Operation Research Department, Niroo Research Institute, Tehran, Iran

4 Faculty of Electrical Engineering, Shahid Beheshti University, Evin, Tehran, Iran


Extending multiple robot motion planning in unknown workspaces is a interesting scope in the Robot motion planning that in this paper is considered. It is used from radiation robots sensors in order to detect their surroundings and positions of the other robots. In this article a new approach considering two objectives is introduced. Finding safest path is as the first objective. The second objective is achieving a trajectory with minimum length. For finding the safest path, it is used from Voronoi Diagram (VD). To provide the safest path, minimizing the distance to the VS is as important criterion. Due to the VD is a geometric location with a distance from all obstacles to the workspace, therefore it is can be a suitable criteria for finding the safest path. For achieving the shortest path as the secondary objective, it is applied Euclidean distance the current position of the robot to goal position. Algorithm that applied for solving this problem is particle swarm optimization (PSO).