Robotic path planning using hybrid genetic algorithm particle swarm optimisation Online publication date: Wed, 29-Aug-2012
by Rahul Kala; Anupam Shukla; Ritu Tiwari
International Journal of Information and Communication Technology (IJICT), Vol. 4, No. 2/3/4, 2012
Abstract: The problem of robotic path planning has always attracted the interests of a significantly large number of researchers due to the various constraints and issues related to it. The optimisation in terms of time and path length and validity of the non-holonomic constraints, especially in large sized maps of high resolution, pose serious challenges for the researchers. In this paper we propose hybrid genetic algorithm particle swarm optimisation (HGAPSO) algorithm for solving the problem. Diversity preservation measures are introduced in this applied evolutionary technique. The novelty of the algorithm is threefold. Firstly, the algorithm generates paths of increasing complexity along with time. This ensures that the algorithm generates the best path for any type of map. Secondly, the algorithm is efficient in terms of computational time which is done by introducing the concept of momentum-based exploration in its fitness function. The indicators contributing to fitness function can only be measured by exploring the path represented. This exploration is vague at start and detailed at the later stages. Thirdly, the algorithm uses a multi-objective optimisation technique to optimise the total path length, the distance from obstacle and the maximum number of turns. These multi-objective parameters may be altered according to the robot design.
Online publication date: Wed, 29-Aug-2012
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 Information and Communication Technology (IJICT):
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 email@example.com