IDEAS home Printed from https://ideas.repec.org/a/hin/complx/8863526.html
   My bibliography  Save this article

Exploration Enhanced RPSO for Collaborative Multitarget Searching of Robotic Swarms

Author

Listed:
  • Jian Yang
  • Ruilin Xiong
  • Xinhao Xiang
  • Yuhui Shi

Abstract

Particle Swarm Optimization (PSO) is an excellent population-based optimization algorithm. Meanwhile, because of its inspiration source and the velocity update feature, it is also widely used in the collaborative searching tasks for swarm robotics. One of the PSO-based models for robotic swarm searching tasks is Robotic PSO (RPSO). It adds additional items for obstacle avoidance into standard PSO and has been applied to many single-target search tasks. However, due to PSO’s global optimization characteristics, it is easy to converge to a specific position in the search space and lose the ability to explore further. When faced with the problem of multitarget searching, it may become inefficient or even invalid. This paper proposes an Exploration Enhanced Robotic PSO (E2RPSO) method for multitarget searching problems for robotic swarms. The proposed method modifies the third item in the RPSO as an additional attraction term. This item not only enables the robot to avoid collisions but also guides the swarm to search unexplored regions as much as possible. This operation increases the swarm’s task-specific (top-down) diversity, making the system cover a broader search area and avoid falling into local optimums. Besides, the aggregation degree and evolution speed factors are also included in determining the inertia weight of the proposed method, which adjusts the swarm’s internal (bottom-up) diversity dynamically. The comparison results show that this method can balance the relationship between exploration and exploitation well, which has the potential to be applied to multitarget searching scenarios.

Suggested Citation

  • Jian Yang & Ruilin Xiong & Xinhao Xiang & Yuhui Shi, 2020. "Exploration Enhanced RPSO for Collaborative Multitarget Searching of Robotic Swarms," Complexity, Hindawi, vol. 2020, pages 1-12, November.
  • Handle: RePEc:hin:complx:8863526
    DOI: 10.1155/2020/8863526
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2020/8863526.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/8503/2020/8863526.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2020/8863526?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:hin:complx:8863526. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.