A neural network approach for solving the path planning problem

Author(s):  
H.T. Chan ◽  
K.S. Tam ◽  
N.K. Leung
1991 ◽  
Vol 3 (3) ◽  
pp. 350-362 ◽  
Author(s):  
Michael Lemmon

This paper proposes a neural network solution to path planning by two degree-of-freedom (DOF) robots. The proposed network is a two-dimensional sheet of neurons forming a distributed representation of the robot's workspace. Lateral interconnections between neurons are “cooperative,” so that the field exhibits oscillatory behavior. This paper shows how that oscillatory behavior can be used to solve the path-planning problem. The results reported show that the proposed neural network finds the variational solution of Bellman's dynamic programming equation.


Robotica ◽  
1998 ◽  
Vol 16 (4) ◽  
pp. 415-423 ◽  
Author(s):  
Kimmo Pulakka ◽  
Veli Kujanpää

In this paper a path planning method for off-line programming of a joint robot is described. The method can automatically choose the easiest and safest route for an industrial robot from one position to another. The method is based on the use of a Self Organised Feature Map (SOFM) neural network. By using the SOFM neural network the method can adapt to different working environments of the robot. According to test results one can conclude that the SOFM neural network is a useful tool for the path planning problem of a robot.


2018 ◽  
Vol 15 (3) ◽  
pp. 172988141878422 ◽  
Author(s):  
Pengchao Zhang ◽  
Chao Xiong ◽  
Wenke Li ◽  
Xiaoxiong Du ◽  
Chuan Zhao

In the course of the task, the mobile robot should find the shortest and most smooth obstacle-free path to move from the current point to the target point efficiently, which is namely the path planning problem of the mobile robot. After analyzing a large number of planning algorithms, it is found that the combination of traditional planning algorithm and heuristic programming algorithm based on artificial intelligence have outstanding performance. Considering that the basic rapidly exploring random tree algorithm is widely used for some of its advantages, meanwhile there are still defects such as poor real-time performance and rough planned path. So, in order to overcome these shortcomings, this article proposes target bias search strategy and a new metric function taking both distance and angle into account to improve the basic rapidly exploring random tree algorithm, and the neural network is used for curve post-processing to obtain a smooth path. Through simulating in complex environment and comparison with the basic rapidly exploring random tree algorithm, it shows good real-time performance and relatively shorter and smoother planned path, proving that the improved algorithm has good performance in handling path planning problem.


Author(s):  
Simon X. Yang

A novel biologically inspired neural network approach is proposed for real-time simultaneous map building and path planning with limited sensor information in a non-stationary environment. The dynamics of each neuron is characterized by a shunting equation with both excitatory and inhibitory connections. There are only local connections in the proposed neural network. The map of the environment is built during the real-time robot navigation with its sensor information that is limited to a short range. The real-time robot path is generated through the dynamic activity landscape of the neural network. The effectiveness and the efficiency are demonstrated by simulation studies.


Sign in / Sign up

Export Citation Format

Share Document