Complete Coverage Path Planning of Mobile Robots: Biologically Inspired Neural Network and Heuristic Template Approach
QIU XueNa1, 2, LIU ShiRong1, YU JinShou2, Simon X. Yang3
1.Research Institute of Electrical Engineering and Automation, Ningbo University, Ningbo 315211 2.Research Institute of Automation, East China University of Science and Technology, Shanghai 200237 3.School of Engineering, The University of Guelph, Guelph, Ontario, Canada N1G 2W1
Abstract In this paper, a novel complete coverage path planning method based on biologically inspired neural network for mobile robot motion planning is developed, which integrates heuristic searching algorithm, templatebased model and obstacle approaching algorithm. The biological neural network that is described by the shunting cooperativecompetitive feedback network is used to model the environment of the workspace of mobile robot. The templatebased model, heuristic searching algorithm and obstacle approaching algorithm are employed to plan the motion path of a mobile robot with obstacle avoidance. The obstacle approaching algorithm is used to cover the vicinity areas of the irregular obstacles so that the coverage area of the path planning is further improved. The simulation studies show that the performance of the path generated by the proposed method, such as the rate of the repeated coverage, is improved obviously, and the proposed algorithm is computationally simple and effective.
[1] Hodgkin A L, Huxley A F. A Quantitative Description of Membrane Current and Its Application to Conduction and Excitation in Nerve. The Journal of Physiology, 1952, 117(4): 500-544 [2] Grossberg S. Nonlinear Neural Networks: Principles, Mechanism, and Architectures. Neural Networks, 1988, 1(1): 17-61 [3] Yang S X, Meng M Q H. Neural Network Approaches to Dynamic Collision-Free Trajectory Generation. IEEE Trans on Systems, Man, and Cybernetics—Part B: Cybernetics, 2001, 31(3) : 302-318 [4] Yang S X, Meng M Q H. An Efficient Neural Network Approach to Dynamic Robot Motion Planning. Neural Networks, 2000,13(2): 143-148 [5] Yang S X, Luo C. A Neural Network Approach to Complete Coverage Path Planning. IEEE Trans on Systems, Man, and Cybernetics—Part B: Cybernetics, 2004, 34(1): 718-725 [6]Li K S, Zhang H H, Fei R Y, Zong G H. Research on Path Planning of Mobile Robot with Covering-Path Feature. Robot, 2001, 23(6): 486-492 (in Chinese) (李开生,张慧慧,费仁元,宗光华.具有遍历特性的移动机器人规划方法的研究.机器人, 2001, 23(6): 486-492)
2006, Vol. 19 
