Optimal Robot Path Planning With Cellular Neural Network

2019 ◽  
pp. 491-511
Author(s):  
Yongmin Zhong ◽  
Bijan Shirinzadeh ◽  
Xiaobu Yuan

This paper presents a new methodology based on neural dynamics for optimal robot path planning by drawing an analogy between cellular neural network (CNN) and path planning of mobile robots. The target activity is treated as an energy source injected into the neural system and is propagated through the local connectivity of cells in the state space by neural dynamics. By formulating the local connectivity of cells as the local interaction of harmonic functions, an improved CNN model is established to propagate the target activity within the state space in the manner of physical heat conduction, which guarantees that the target and obstacles remain at the peak and the bottom of the activity landscape of the neural network. The proposed methodology cannot only generate real-time, smooth, optimal, and collision-free paths without any prior knowledge of the dynamic environment, but it can also easily respond to the real-time changes in dynamic environments. Further, the proposed methodology is parameter-independent and has an appropriate physical meaning.

Author(s):  
Yongmin Zhong ◽  
Bijan Shirinzadeh ◽  
Xiaobu Yuan

This paper presents a new methodology based on neural dynamics for optimal robot path planning by drawing an analogy between cellular neural network (CNN) and path planning of mobile robots. The target activity is treated as an energy source injected into the neural system and is propagated through the local connectivity of cells in the state space by neural dynamics. By formulating the local connectivity of cells as the local interaction of harmonic functions, an improved CNN model is established to propagate the target activity within the state space in the manner of physical heat conduction, which guarantees that the target and obstacles remain at the peak and the bottom of the activity landscape of the neural network. The proposed methodology cannot only generate real-time, smooth, optimal, and collision-free paths without any prior knowledge of the dynamic environment, but it can also easily respond to the real-time changes in dynamic environments. Further, the proposed methodology is parameter-independent and has an appropriate physical meaning.


Author(s):  
Yongmin Zhong ◽  
Bijan Shirinzadeh ◽  
Xiaobu Yuan

This paper presents a new methodology based on neural dynamics for optimal robot path planning by drawing an analogy between cellular neural network (CNN) and path planning of mobile robots. The target activity is treated as an energy source injected into the neural system and is propagated through the local connectivity of cells in the state space by neural dynamics. By formulating the local connectivity of cells as the local interaction of harmonic functions, an improved CNN model is established to propagate the target activity within the state space in the manner of physical heat conduction, which guarantees that the target and obstacles remain at the peak and the bottom of the activity landscape of the neural network. The proposed methodology cannot only generate real-time, smooth, optimal, and collision-free paths without any prior knowledge of the dynamic environment, but it can also easily respond to the real-time changes in dynamic environments. Further, the proposed methodology is parameter-independent and has an appropriate physical meaning.


2019 ◽  
Vol 43 (8) ◽  
pp. 2071-2093 ◽  
Author(s):  
Olimpiya Saha ◽  
Prithviraj Dasgupta ◽  
Bradley Woosley

Author(s):  
Rahul Kala ◽  
Anupam Shukla ◽  
Ritu Tiwari

AbstractWe solve the problem of robot path planning using Dynamic Programming (DP) designed to perform well in case of a sudden path blockage. A conventional DP algorithm works well for real time scenarios only when the update frequency is high i.e. changes can be readily propagated. In case updates are costly, for a sudden blockage the robot continues moving along the wrong path or stands stationary. We propose a modified DP that has nodes with additional processing (called accelerating nodes) to enable different segments of the map to become informed about the blockage rapidly. We further quickly compute an alternative path in case of a blockage. Experimental results verify that usage of accelerating nodes makes the robot follow optimal paths in dynamic environments.


Sign in / Sign up

Export Citation Format

Share Document