By Topic

Mobile robot path planning by new structured multi-objective genetic algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Sedaghat, N. ; Comput. Eng. Dept., Islamic Azad Univ., Mashhad, Iran

Path planning problem of mobile robot is one that has intrigued and has received much attention throughout the history of robotics, since it is at the essence of what a mobile robot needs to be considered truly “autonomous”. A mobile robot must be able to find collision-free paths to move from one location to another, and in order to truly show a level of intelligence these paths must be optimized under some criteria that are important to the robot, working space and given problem. In this paper we propose a new structured multi-objective genetic algorithm to solve this problem. In our method we explore only valid search space that results in a smaller search space. Also we show the defect of earlier evaluation function and present a new evaluation function. To evaluate our idea we compare our evaluation function with other ones and show the performance of our method. Experiments show the ability of our method in finding best paths with low generation and population.

Published in:

Soft Computing and Pattern Recognition (SoCPaR), 2011 International Conference of

Date of Conference:

14-16 Oct. 2011