Title :
A neural computational algorithm for coverage path planning in changing environments
Author :
Yang, Simon X. ; Luo, Chaomin ; Meng, Max
Author_Institution :
Sch. of Eng., Guelph Univ., Ont., Canada
fDate :
29 June-1 July 2002
Abstract :
Coverage path planning requires the robot path to cover every part of the workspace, which is an essential issue in cleaning robots and many other robotic applications. In this paper, a novel biologically inspired neural computational algorithm is proposed for coverage path planning with sudden changes and moving obstacles in a varying environment. The dynamics of each neuron in the topologically organized neural network is characterized by an additive equation derived from Hodgkin and Huxley´s (1952) membrane equation. The computational complexity linearly depends on the neural network size. The robot path is autonomously generated from the dynamic activity landscape of the neural network and the previous robot location. The proposed model algorithm is computationally efficient. Two case studies of coverage path planning in changing environments are conducted to demonstrate the effectiveness of the proposed algorithm.
Keywords :
computational complexity; mobile robots; neural nets; path planning; robot programming; Hodgkin-Huxley membrane equation; autonomous robot workspace path generation; biologically inspired neural computation; changing environment CPP; cleaning robots; collision-free paths; computational complexity; coverage path planning neural computational algorithms; mobile robots; moving obstacles; neural network dynamic activity landscape; neural network size; obstacle avoidance; robot location; topologically organized neural network neuron dynamics; Biology computing; Biomembranes; Cleaning; Computational complexity; Computational modeling; Equations; Neural networks; Neurons; Path planning; Robots;
Conference_Titel :
Communications, Circuits and Systems and West Sino Expositions, IEEE 2002 International Conference on
Print_ISBN :
0-7803-7547-5
DOI :
10.1109/ICCCAS.2002.1178993