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 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.

[1]  Max Q.-H. Meng,et al.  Neural network approaches to dynamic collision-free trajectory generation , 2001, IEEE Trans. Syst. Man Cybern. Part B.

[2]  Marc Carreras,et al.  A survey on coverage path planning for robotics , 2013, Robotics Auton. Syst..

[3]  Wenbo Wu,et al.  An Improved VFF Approach for Robot Path Planning in Unknown and Dynamic Environments , 2014 .

[4]  Deyu Tang,et al.  Grid Task Scheduling Strategy Based on Differential Evolution-Shuffled Frog Leaping Algorithm , 2012, 2012 International Conference on Computer Science and Service System.

[5]  Ping Luo,et al.  Modified shuffled frog leaping algorithm based on new searching strategy , 2011, 2011 Seventh International Conference on Natural Computation.

[6]  Simon X. Yang,et al.  Bioinspired Neural Network for Real-Time Cooperative Hunting by Multirobots in Unknown Environments , 2011, IEEE Transactions on Neural Networks.

[7]  B. Vahidi,et al.  Bacterial Foraging-Based Solution to the Unit-Commitment Problem , 2009, IEEE Transactions on Power Systems.

[8]  Mao Yang,et al.  Multi-robot task allocation for fire-disaster response based on reinforcement learning , 2009, 2009 International Conference on Machine Learning and Cybernetics.

[9]  Francisco Jurado,et al.  Shuffled frog-leaping algorithm for parameter estimation of a double-cage asynchronous machine , 2012 .

[10]  Quan Dang,et al.  Path planning approach in unknown environment , 2010, Int. J. Autom. Comput..

[11]  Simon X. Yang,et al.  A Fuzzy-Logic Based Chaos GA for Cooperative Foraging of Multi-Robots in Unknown Environments , 2012, Int. J. Robotics Autom..

[12]  Mohammad Ali Badamchizadeh,et al.  Mobile robot path planning based on shuffled frog leaping optimization algorithm , 2010, 2010 IEEE International Conference on Automation Science and Engineering.

[13]  Yunlong Huang.  Intelligent Technique for Robot Path planning Using Artificial Neural Network and Adaptive Ant Colony Optimization , 2012 .

[14]  Xia Li,et al.  Solving TSP with Shuffled Frog-Leaping Algorithm , 2008, 2008 Eighth International Conference on Intelligent Systems Design and Applications.

[15]  Cai Wenbin,et al.  Path Planning Based on Biphasic Ant Colony Algorithm and Fuzzy Control in Dynamic Environment , 2010, 2010 Second International Conference on Intelligent Human-Machine Systems and Cybernetics.

[16]  Simon X. Yang,et al.  Dynamic Task Assignment and Path Planning of Multi-AUV System Based on an Improved Self-Organizing Map and Velocity Synthesis Method in Three-Dimensional Underwater Workspace , 2013, IEEE Transactions on Cybernetics.

[17]  Soh Chin Yun,et al.  Improved genetic algorithms based optimum path planning for mobile robot , 2010, 2010 11th International Conference on Control Automation Robotics & Vision.

[18]  Li Ming,et al.  Path Planning of Inspection Robot Based on Ant Colony Optimization Algorithm , 2010, 2010 International Conference on Electrical and Control Engineering.

[19]  Chen Zhi.  Mobile robot path planning based on improved artificial potential field method , 2011 .

[20]  Moncef Gabbouj,et al.  Fractional Particle Swarm Optimization in Multidimensional Search Space , 2010, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[21]  G B Gharehpetian,et al.  Unit Commitment Problem Solution Using Shuffled Frog Leaping Algorithm , 2011, IEEE Transactions on Power Systems.