IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v9y2013i12p560579.html
   My bibliography  Save this article

An Adaptive Particle Swarm Optimization Algorithm for Distributed Search and Collective Cleanup in Complex Environment

Author

Listed:
  • Yi Cai
  • Zhutian Chen
  • Jun Li
  • Qing Li
  • Huaqing Min

Abstract

Distributed coordination is critical for a multirobot system in collective cleanup task under a dynamic environment. In traditional methods, robots easily drop into premature convergence. In this paper, we propose a Swarm Intelligence based algorithm to reduce the expectation time for searching targets and removing. We modify the traditional PSO algorithm with a random factor to tackle premature convergence problem, and it can achieve a significant improvement in multi-robot system. It performs well even in a obstacle environment. The proposed method has been implemented on self-developed simulator for searching task. The simulation results demonstrate the feasibility, robustness, and scalability of our proposed method compared to previous methods.

Suggested Citation

  • Yi Cai & Zhutian Chen & Jun Li & Qing Li & Huaqing Min, 2013. "An Adaptive Particle Swarm Optimization Algorithm for Distributed Search and Collective Cleanup in Complex Environment," International Journal of Distributed Sensor Networks, , vol. 9(12), pages 560579-5605, December.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:12:p:560579
    DOI: 10.1155/2013/560579
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/560579
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/560579?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:sae:intdis:v:9:y:2013:i:12:p:560579. 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: SAGE Publications (email available below). General contact details of provider: .

    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.