The path planning for mobile robot based on bat algorithm
by Jinchao Guo; Yu Gao; Guangzhao Cui
International Journal of Automation and Control (IJAAC), Vol. 9, No. 1, 2015

Abstract: This article presents a novel method of global optimal path planning based on the Dijkstra algorithm and bat algorithm. This method consists of three steps: the first step is establishing the working space of mobile robot by adopting the MAKLINK graph theory, the second step is utilising the Dijkstra algorithm to obtain the sub-optimal path from the start point to the goal point, and the third step is adopting the bat algorithm to optimise the sub-optimal path so as to get the global optimal path of the robot. The result of the simulation experiment shows the proposed method is effective and can meet the real-time requirements of mobile robot. At the same time, the experiment also proves the optimal path planning of mobile robot based on bat algorithm is superior to particle swarm optimisation algorithm.

Online publication date: Sun, 15-Mar-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Automation and Control (IJAAC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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