IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0308264.html
   My bibliography  Save this article

Optimised path planning using Enhanced Firefly Algorithm for a mobile robot

Author

Listed:
  • Mohd Nadhir Ab Wahab
  • Amril Nazir
  • Ashraf Khalil
  • Benjamin Bhatt
  • Mohd Halim Mohd Noor
  • Muhammad Firdaus Akbar
  • Ahmad Sufril Azlan Mohamed

Abstract

Path planning is a crucial element of mobile robotics applications, attracting considerable interest from academics. This paper presents a path-planning approach that utilises the Enhanced Firefly Algorithm (EFA), a new meta-heuristic technique. The Enhanced Firefly Algorithm (FA) differs from the ordinary FA by incorporating a linear reduction in the α parameter. This modification successfully resolves the constraints of the normal FA. The research involves experiments on three separate maps, using the regular FA and the suggested Enhanced FA in 20 different runs for each map. The evaluation criteria encompass the algorithms’ ability to move from the initial location to the final position without experiencing any collisions. The assessment of path quality relies on elements such as the distance of the path and the algorithms’ ability to converge and discover optimum solutions. The results demonstrate significant improvements made by the Enhanced FA, with a 10.270% increase in the shortest collision-free path for Map 1, a 0.371% increase for Map 2, and a 0.163% increase for Map 3, compared to the regular FA. This work highlights the effectiveness of the Enhanced Firefly Algorithm in optimising path planning for mobile robotics applications, providing potential improvements in navigation efficiency and collision avoidance.

Suggested Citation

  • Mohd Nadhir Ab Wahab & Amril Nazir & Ashraf Khalil & Benjamin Bhatt & Mohd Halim Mohd Noor & Muhammad Firdaus Akbar & Ahmad Sufril Azlan Mohamed, 2024. "Optimised path planning using Enhanced Firefly Algorithm for a mobile robot," PLOS ONE, Public Library of Science, vol. 19(8), pages 1-22, August.
  • Handle: RePEc:plo:pone00:0308264
    DOI: 10.1371/journal.pone.0308264
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0308264
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0308264&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0308264?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:plo:pone00:0308264. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.