In this work, a method for finding the optimal path from an initial point to a final one in a previously defined static search map is presented, based on Ant Colony Optimization Meta-Heuristic (ACO-MH). The proposed algorithm supports the avoidance of dynamic obstacles; that is, once the optimal path is found and the robot starts navigating, if the robot's route is interrupted by a new obstacle that was sensed at time t, it will recalculate an alternative optimal path from the actual robot position in order to surround this blocking object and reach the goal. © 2007 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Porta García, M. A., Montiel, O., Castillo, O., & Sepúlveda, R. (2007). Optimal path planning for autonomous mobile robot navigation using ant colony optimization and a fuzzy cost function evaluation. Advances in Soft Computing, 41, 790–798. https://doi.org/10.1007/978-3-540-72432-2_79
Mendeley helps you to discover research relevant for your work.