IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-3-030-70281-6_12.html
   My bibliography  Save this book chapter

Particle Swarm Optimization in Global Path Planning for Swarm of Robots

In: Applying Particle Swarm Optimization

Author

Listed:
  • Ritesh Kumar Halder

    (IIT Kanpur)

Abstract

Planning of the optimal path of an autonomous swarm of mobile robots is quite challenging since they may need to meet multiple targets while avoiding obstacles. This chapter addresses the problem using a method of global navigation based on particle swarm optimization technique. Since it is a meta-heuristic search technique, the path can be found following any optimization criteria such as shortest distance or minimum time. The chapter explores different traditional path planning approaches in contrast with the evolutionary algorithms. The PSO algorithm is tested in different scenarios. Several modifications were implemented in the algorithm for optimization improvements and faster convergence, leading to better results. Geometrical illustrations were used to explain the changes in position of the particles with respect to the environment and obstacles. Consequently, the experiments are conducted on a simulated robot, and the visualizations demonstrated the feasibility of the technique to solve global path planning problem.

Suggested Citation

  • Ritesh Kumar Halder, 2021. "Particle Swarm Optimization in Global Path Planning for Swarm of Robots," International Series in Operations Research & Management Science, in: Burcu Adıgüzel Mercangöz (ed.), Applying Particle Swarm Optimization, edition 1, chapter 0, pages 209-232, Springer.
    • Handle: RePEc:spr:isochp:978-3-030-70281-6_12
    DOI: 10.1007/978-3-030-70281-6_12
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:isochp:978-3-030-70281-6_12. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.