Optimal tour constructions for multiple mobile robots

The attempts to use mobile robots in a variety of environments are currently being limited by their navigational capability,thus a set of robots must be configured for one specific environment. the problem of navigating an environment is the fundamental problem in mobile robotic where various methods including exact and heuristic approaches have been proposed to solve the problem. this paper proposed a solution to the navigation problem via the use of multiple robots to explore the environment employing heuristic methods to navigate the environment using a variant of a traveling salesman problem (tsp) known as multiple traveling salesman problem (m-tsp). © school of engineering,taylors university.