An improved shuffled frog leaping algorithm for robot path planning

Path planning is one of the most significant and challenging subjects in robot control field. In this paper, a path planning method based on an improved shuffled frog leaping algorithm is proposed. In the proposed approach, a novel updating mechanism based on the median strategy is used to avoid loc...

Full description

Saved in:
Bibliographic Details
Published in2014 10th International Conference on Natural Computation (ICNC) pp. 545 - 549
Main Authors Jianjun Ni, Xiahong Yin, Junfeng Chen, Xinyun Li
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.2014
Subjects
Fitness function
Heuristic algorithms
Mobile robots
Path planning
Robot path planning
Robot sensing systems
Shuffled frog leaping algorithm
Sociology
Statistics
Updating mechanism
Online AccessGet full text
ISSN2157-9555
DOI10.1109/ICNC.2014.6975893

Cover

More Information
Summary:Path planning is one of the most significant and challenging subjects in robot control field. In this paper, a path planning method based on an improved shuffled frog leaping algorithm is proposed. In the proposed approach, a novel updating mechanism based on the median strategy is used to avoid local optimal solution problem in the general shuffled frog leaping algorithm. Furthermore, the fitness function is modified to make the path generated by the shuffled frog leaping algorithm smoother. In each iteration, the globally best frog is obtained and its position is used to lead the movement of the robot. Finally, some simulation experiments are carried out. The experimental results show the feasibility and effectiveness of the proposed algorithm in path planning for mobile robots.
ISSN:2157-9555
DOI:10.1109/ICNC.2014.6975893