scholarly journals Multi-goal feasible path planning using ant colony optimization

Author(s):  
Brendan Englot ◽  
Franz Hover
Symmetry ◽  
2021 ◽  
Vol 13 (2) ◽  
pp. 280
Author(s):  
Viswanathan Sangeetha ◽  
Raghunathan Krishankumar ◽  
Kattur Soundarapandian Ravichandran ◽  
Fausto Cavallaro ◽  
Samarjit Kar ◽  
...  

Path planning can be perceived as a combination of searching and executing the optimal path between the start and destination locations. Deliberative planning capabilities are essential for the motion of autonomous unmanned vehicles in real-world scenarios. There is a challenge in handling the uncertainty concerning the obstacles in a dynamic scenario, thus requiring an intelligent, robust algorithm, with the minimum computational overhead. In this work, a fuzzy gain-based dynamic ant colony optimization (FGDACO) for dynamic path planning is proposed to effectively plan collision-free and smooth paths, with feasible path length and the minimum time. The ant colony system’s pheromone update mechanism was enhanced with a sigmoid gain function for effective exploitation during path planning. Collision avoidance was achieved through the proposed fuzzy logic control. The results were validated using occupancy grids of variable size, and the results were compared against existing methods concerning performance metrics, namely, time and length. The consistency of the algorithm was also analyzed, and the results were statistically verified.


2020 ◽  
Vol 38 (3A) ◽  
pp. 343-351
Author(s):  
Mohammed I. Abdulakareem ◽  
Firas A. Raheem

n this paper, a unique combination among probabilistic roadmap, ant colony optimization, and third order B-spline curve has been proposed to solve path-planning problem in complex and very complex environments. This proposed method can be divided into three stages. First stage is to construct a random map depending on the environment complexity using probabilistic roadmap algorithm. This could be done by sampling N nodes randomly in complex and very complex static environments, then connecting these nodes together according to some criteria or conditions. The constructed roadmap contains huge number of possible random paths that may connect the start and the goal points together. Second stage includes finding path within the pre-constructed roadmap. Ant colony optimization is selected to find or to search the best path between start and goal points. Finally, the third stage uses B-spline curve to smooth and reduce total length of the found path in the previous stage where path’s length has been reduced by 1% in first environment and by 15% in second environment. The results of the proposed approach ensure feasible path between start and goal points in complex and very complex environment. In addition, the path is guaranteed to be shortest, smooth, continues and safe.


2021 ◽  
Author(s):  
Ming-Yuan Gao ◽  
Bin-Bin Hu ◽  
Bin Liu ◽  
Ning Qiu ◽  
Hai-Tao Zhang

Sign in / Sign up

Export Citation Format

Share Document