skip to main content

Ant Colony Algorithms for Mobile Robot Path Planning - a state of the art review

*Prianggada Indra Tanaya scopus  -  Department of Industrial Engineering, Indonesia
Deni Mahdiana  -  Magister Ilmu Komputer, Fakultas Teknologi Informasi, Indonesia
Open Access Copyright (c) 2022 ROTASI

Citation Format:

Mobile robots require path planning to move from start position toward the target position (end point). Along the movement, the mobile robot manipulates in static and/or dynamic condition of obstacles and collison avoidance. Path trajectories (path planning) are generated in the robot motion controller. Path trajectory is generated using exact or heuristic method. From the mobile robot point of view, there is local and global environment. Path planning that is generated encounter a problem in local optimum and slow convergence speed. Ant Colony algorithm is a metaheuristic search algorithm. In this paper, the path planning based on Ant Colony System is studied. The problem encountered using Ant Colony path planning is the decision of local and/or global planning to reach convergences. To solve that encountered problem, many researchers proposed novel additional methods to Ant Colony Algorithm to optimize. Futher, discussion of those method will be presented


Fulltext View|Download
Keywords: Ant Colony, Algorithm, Mobile Robot, Path Planning, Simulation

Article Metrics:

Last update:

No citation recorded.

Last update: 2023-12-10 22:20:57

No citation recorded.