Initial and Target Nodes Planning for Multi Mobile Robots

Abstract

A novel algorithm for planning initial and target nodes for multi mobile robots in complex environment where all robots have the same functionality is presented. The algorithm assigns an initial node to each target node based on a ranking method. The ranking method takes into consideration the path length between the two nodes, the effort of the robot while moving between the two nodes, and the possibility to block other robots movements while moving between the two nodes. The algorithm also tries to solve collision between robots using the proposed ranking method and taking robots performance into consideration.