Mobile robot path planning with modified ant colony optimisation Online publication date: Tue, 21-Mar-2017
by Utkarsh Rajput; Madhu Kumari
International Journal of Bio-Inspired Computation (IJBIC), Vol. 9, No. 2, 2017
Abstract: Automated navigation is a pivotal task of robotics research and the key challenge lies in robot motion on unknown dynamic terrain. The large number of solutions to robotic path planning, especially in unknown and dynamic environments, mainly rely on the heuristic methods. The most important factor for this choice is the fast convergence towards solution without supervision. In the proposed scheme we have used a modified version of ant colony optimisation. We incorporated the directional movement history of robot on a grid into a vector as a probability multiplication factor which helps to achieve a faster convergence and avoid unnecessary movements, e.g., looping. In this work we have devised a novel pheromone updation scheme. Along with this we have applied path smoothing to lessen the number of turns on the candidate optimal path. Effectiveness is shown through several extensive experiments and results clearly indicate the aptness of the proposed scheme.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook