Optimal Path Planning of Mobile Robot with Multiple Target Using Ant Colony Optimization
In this paper, we present a path-planning algorithm for mobile robots in an environment with obstacles. We investigate the used of Ant Colony Optimization (ACO) for determining the optimal path for a wheeled mobile robot to visit multiple targets. THe environment in which the robot operates is modeled in the form of discrete cells and the robot is modeled as a point probot. The robot has knowledge about the targets' positions but has limited local sensing capability to sense obstacles. The paper investiages the use of multiple autonomous robots for solving the shortest path problem. ACO algorithm is used for dynamic planning of the path to avoid obstacles visit all the targets.
S. Ramakrishnan et al., "Optimal Path Planning of Mobile Robot with Multiple Target Using Ant Colony Optimization," Intelligent Systems Through Artificial Neural Networks Smart Engineering Systems Design, American Society of Mechanical Engineers (ASME), Jan 2006.
Engineering Management and Systems Engineering
Keywords and Phrases
Optimization; Path Planning; Robot Control
Article - Conference proceedings
© 2006 American Society of Mechanical Engineers (ASME), All rights reserved.
This document is currently not available here.