Finding Robotic Wide Free Space Path in Dynamic Environment by Improving MAX–MIN Ant System Algorithm
DOI:
https://doi.org/10.3991/ijim.v17i13.41513Keywords:
Max-Min ACO Algorithm, Mobile Robot Path Planning, Obstacle Avoidance Method, and Dynamic Environment.Abstract
— This paper proposes a new obstacle avoidance method for finding an optimal path passing through wide free space based on the optimized MAX-MIN Ant System (MMAS) algorithm in dynamic environments. The proposed improvement of the MMAS algorithm occurs in two stages. The first stage analyses the environment with two modifications by proposing a new relation of pheromone trail updating to construct the consequence modified (deposited) pheromone trail update in each iteration based on adding a new parameter (clean) to calculate the possible wide empty locations. Another alteration at this level involves checking and identifying the four horizontal and vertical states. Suppose the two nodes on either side of the four diagonal nodes are barriers in the next neighbor locations. In that case, the Tight Tunnel state is then attained, and it is managed by sealing this location to prevent passing through it before the robot movement stage. Another alteration is made to the robot-moving stage by recommending a new relation of tour building probabilities to determine the best option for moving the robot from the start node through a dynamic environment that incorporates dynamic obstacles moving through free space by locating and exhibiting the ideal path via broad free space. The main outcome of the experiment simulation of the new method involves that the robot avoids going through narrow tunnels and chooses the best course through open areas to reach its destination without running into any impediments in various dynamic environments conditions. In addition, the comparison of average time occupied to find the paths by the new method reduces to 54.32% as compared with that required with the method of hybrid the basic D* algorithm with the Lbest PSO algorithm, and to 11.95% in comparison to the time occupied recorded when applying the method of the improved MAX–MIN ACO algorithm.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 Haider TH.Salim ALRikabi; Ali Hadi Hasan, Hasanen S. Abdullah, Mohamad AB. Saleh
This work is licensed under a Creative Commons Attribution 4.0 International License.
The submitting author warrants that the submission is original and that she/he is the author of the submission together with the named co-authors; to the extend the submission incorporates text passages, figures, data or other material from the work of others, the submitting author has obtained any necessary permission.
Articles in this journal are published under the Creative Commons Attribution Licence (CC-BY What does this mean?). This is to get more legal certainty about what readers can do with published articles, and thus a wider dissemination and archiving, which in turn makes publishing with this journal more valuable for you, the authors.
By submitting an article the author grants to this journal the non-exclusive right to publish it. The author retains the copyright and the publishing rights for his article without any restrictions.
This journal has been awarded the SPARC Europe Seal for Open Access Journals (What's this?)