Exploratory path planning using the Max-min ant system algorithm

In the path planning problem for autonomous mobile robots, robots have to plan their path from the start position to the goal. In this paper, we investigate the application of the MMAS algorithm to the exploratory path planning problem, in which the robots should explore the environment at the same time they plan the path. Max-min ant system is an ant colony optimization algorithm that exploits the best solutions found. In addition, to analyze the quality of solutions obtained, we also analyze the traveled distance spent by robots in the first iteration of the algorithm. The environment is previously unknown to the robots, although it is represented by a topological map, that does not require precise information from the environment and provides a simple way to execute the navigation of the path. Thus, the paths are represented by a sequence of actions that the robots should execute to reach the goal. The navigation of the best solution found was implemented in a realistic robotic simulator. The proposed algorithm provides a very good performance in relation to a genetic algorithm and the well-known A* algorithm that deal with this problem.