The Study on Mobile Robot Path Planning Based on Frog Leaping Algorithm


Article Preview

We have proposed a method of robot path planning in a partially unknown environment in this paper. We regard the problem of robot path planning as an optimization problem and solve it with the SFL algorithm. The position of globally best frog in each iterative is selected, and reached by the robot in sequence. The obstacles are detected by the robot sensors are applied to update the information of the environment. The optimal path is generated until the robot reaches its target. The simulation results validate the feasibility of the proposed method.



Advanced Materials Research (Volumes 490-495)

Edited by:

Ran Chen and Wen-Pei Sung




Z. R. Zhang and J. Y. Yin, "The Study on Mobile Robot Path Planning Based on Frog Leaping Algorithm", Advanced Materials Research, Vols. 490-495, pp. 808-812, 2012

Online since:

March 2012




[1] M. Sharir, Algorithmic motion planning in robotics, Computer, vol. 22, no. 3, pp.9-19, March (2009).

[2] E. Rimon and D. E. Doditschek, Exact robot navigation using artificial potential fields, IEEE Trans. Robotics and Automation, vol. 8, 2009, pp.501-518.


[3] S. X. Yang and M. Meng, An efficient neural network approach to dynamic robot motion planning, Neural Networks, vol. 13, 2000, pp.143-148.


[4] Y. Hu and S. X. Yang, A knowledge based genetic a1gorithm for path Planning of a mobile robot, in Proc. IEEE Int. Conf. Robotics & Automation, New Orleans, LA, April (2004).

[5] L. Lei, H. Wang and Q. Wu, Improved genetic algorithms based path planning of mobile robot under dynamic and unknown environment, in Proc. IEEE Int. Conf. Mechatronics and Automation, June 25 – 28, 2010, Luoyang, China.


[6] C. Xin, Y.M. Li, Smooth path Planning of a mobile robot using stochastic particle swarm optimization, in Proc. IEEE. Int. Conf. Mechatronics and Automation Luoyang, China, 2010, p.1722–1727.


[7] Y. Q. Qin, D. B. Sun, N. Li and Y. G . Cen, Path planning for mobile robot using the particle swarm optimization with mutation operator, in Proc. 3th Int. Conf. Machine Learning and Cybernetics, Shanghai, 2004, p.2473–2478.