A PSO-Inspired Multi-Robot Map Exploration Algorithm Using Frontier-Based Strategy

  • Authors:

  • Yi Zhou;Kai Xiao;Yiheng Wang;Alei Liang;Aboul Ella Hassanien

  • Affiliations:

  • School of Software, Shanghai Jiao Tong University, Shanghai, China;School of Software, Shanghai Jiao Tong University, Shanghai, China;School of Software, Shanghai Jiao Tong University, Shanghai, China;School of Software, Shanghai Jiao Tong University, Shanghai, China;Information Technology Department, Cairo University, Giza, Egypt

  • Venue:
  • International Journal of System Dynamics Applications
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Map exploration is a fundamental problem in mobile robots. This paper presents a distributed algorithm that coordinates a team of autonomous mobile robots to explore an unknown environment. The proposed strategy is based on frontiers which are the regions on the boundary between open and unexplored space. With this strategy, robots are guided to move constantly to the nearest frontier to reduce the size of unknown region. Based on the Particle Swarm Optimization PSO model incorporated in the algorithm, robots are navigated towards remote frontier after exploring the local area. The exploration completes when there is no frontier cell in the environment. The experiments implemented on both simulated and real robot scenarios show that the proposed algorithm is capable of completing the exploration task. Compared to the conventional method of randomly selecting frontier, the proposed algorithm proves its efficiency by the decreased 60% exploration time at least. Additional experimental results show the decreased coverage time when the number of robots increases, which further suggests the validity, efficiency and scalability.