Metaheuristic global path planning algorithm for mobile robots
by Stojanche Panov; Saso Koceski
International Journal of Reasoning-based Intelligent Systems (IJRIS), Vol. 7, No. 1/2, 2015

Abstract: A new metaheuristic method applied to the global path planning for mobile robots in dynamic environments is presented. This algorithm, named the quad harmony search method, consists of dividing the robot's environment into free regions by applying the quad-tree algorithm and utilising this information to accelerate the next phase which implements the harmony search optimisation method to provide the optimal route. The presented results have displayed that this method gives best results when compared to other metaheuristic techniques and is therefore applicable to the global path planning problem.

Online publication date: Fri, 31-Jul-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 Reasoning-based Intelligent Systems (IJRIS):
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