IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v15y2024i7d10.1007_s13198-024-02281-3.html
   My bibliography  Save this article

Image-based extension to ant colony algorithm for path finding in gird-based environments

Author

Listed:
  • Aaron Rasheed Rababaah

    (American University of Kuwait)

Abstract

We propose a technique (IPEAC) that extends the Ant Colony Optimization (ACO) for shortest path finding. In a grid-based environment, when the ACO converges, the optimal path needs to be identified among other emerging paths. Our proposed approach utilizes an image processing algorithm named Connected Component Analysis (CCA). In our implementation, the result of the ACO is an image that models the system elements of source, destination, obstacles, background and agents. This image is fed into CCA which applies a sequence of operators to find the optimal path and calculates its coordinates so that it can be traversed. IPEAC was tested against Dijkstra and A* algorithms. Our experimental work showed that IPEAC is effective and produced an accuracy of 97.8% compared to the A* and 91.8% compared to Dijkstra, however the A* was superior in terms of time efficiency and IPEAC was 60% more efficient that Dijkstra.

Suggested Citation

  • Aaron Rasheed Rababaah, 2024. "Image-based extension to ant colony algorithm for path finding in gird-based environments," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 15(7), pages 2853-2867, July.
  • Handle: RePEc:spr:ijsaem:v:15:y:2024:i:7:d:10.1007_s13198-024-02281-3
    DOI: 10.1007/s13198-024-02281-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-024-02281-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s13198-024-02281-3?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ijsaem:v:15:y:2024:i:7:d:10.1007_s13198-024-02281-3. 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.