IDEAS home Printed from https://ideas.repec.org/a/igg/jsda00/v2y2013i2p1-13.html
   My bibliography  Save this article

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

Author

Listed:
  • Yi Zhou

    (School of Software, Shanghai Jiao Tong University, Shanghai, China)

  • Kai Xiao

    (School of Software, Shanghai Jiao Tong University, Shanghai, China)

  • Yiheng Wang

    (School of Software, Shanghai Jiao Tong University, Shanghai, China)

  • Alei Liang

    (School of Software, Shanghai Jiao Tong University, Shanghai, China)

  • Aboul Ella Hassanien

    (Information Technology Department, Cairo University, Giza, Egypt)

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.

Suggested Citation

  • Yi Zhou & Kai Xiao & Yiheng Wang & Alei Liang & Aboul Ella Hassanien, 2013. "A PSO-Inspired Multi-Robot Map Exploration Algorithm Using Frontier-Based Strategy," International Journal of System Dynamics Applications (IJSDA), IGI Global, vol. 2(2), pages 1-13, April.
    • Handle: RePEc:igg:jsda00:v:2:y:2013:i:2:p:1-13
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijsda.2013040101
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jsda00:v:2:y:2013:i:2:p:1-13. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.