Complete Coverage Path Planning with Designated Starting and Target Locations Using a Neural Network Paradigm
Complete coverage path planning requires the robot path to cover all the unoccupied areas in the workspace. In some real world applications, the start and target locations have to be specified. It is desirable that a mobile robot is not only capable of starting from a specified location, planning a complete coverage path, and finally reaching a designated location after the cleaning is done, i.e., the robot performs a task by integrating the complete coverage path planning and the conventional pointto-point path planning. In this paper, a novel biologically inspired neural network paradigm is proposed for complete coverage path planning with designated starting and target locations in a nonstationary environment. The dynamics of each neuron in the discrete topologically organized neural network is characterized by a biologically inspired shunting equation. There are only local lateral connections among neurons. Therefore, the. computational complexity linearly depends upon the neural network size. The real-time robot path is autonomously generated from the dynamic activity landscape of the neural network and the previous robot location. No prior knowledge of the dynamic environment is needed. The main novelty of the proposed approach is that not only the robot is capable of autonomously performing the complete coverage path planning task with obstacle avoidance, but also it is able to start from a designated location and end in a designated target location.
Complete coverage path planning neural networks neural dynamics neighboring neurons structure
Chaomin Luo Simon X. Yang
ARIS (Advanced Robotics & Intelligent Systems) Lab School of Engineering, University of Guelph Guelph, Ontario NIG 2W1, Canada
国际会议
8th International Conference on Neural Information Processing(ICONIP 2001)(第八届国际神经信息处理大会)
上海
英文
1195-1201
2001-11-14（万方平台首次上网日期，不代表论文的发表时间）