Journal of Jilin University Science Edition

Previous Articles     Next Articles

Path Planning in Dynamic Environment Based on Improved Shuffled Frog Leaping Algorithm

WANG Wenfa, XU Chun, YIN Binbin, DU Zhijie   

  1. College of Computer Science, Yan’an University, Yan’an 716000, Shaanxi Province, China
  • Received:2015-10-12 Online:2016-07-26 Published:2016-07-20
  • Contact: WANG Wenfa E-mail:ydwangwenfa@163.com

Abstract:

Aiming at the unknown and dynamic path planning in complex scene, the traditional method could not solve the problem of path planning, we designed an improved shuffled frog leaping algorithm for robot path planning in order to improve the accuracy of path planning in dynamic environment. Firstly, we analyzed the research status of dynamic environment path planning, and established its mathematical model. Secondly, we used the shuffled frog leaping al
gorithm to solve the model, and improved the shortage of basic shuffled frog leaping algorithm. Finally, we tested effectiveness of the path planning  by simulation experiments. The results show that the proposed algorithm can accurately find the optimal path planning scenarios, and can be used in more complex scene path planning, and its performance is better than that of other path planning methods.

Key words: path planning, shuffled frog leaping algorithm, unknown environment, collision obstacle

CLC Number: 

  • TP391