The Experiment of the Local Minimum Value of the Algorithm for Path Planning
Yu Jian · Journal of Luoyang Institute of Technology · 2001
In this paper,the problem of path planning is studied for a moving robot in an environment field with obstacles which have shapes and positions known,and the collision free paths are found by using the algorithm based on neural network.To avoid local minimum value,different initial simulated anneal temperatures of each side of obstacles are set.The simulation results show that the computation is simple,the local minimum problem can be avoided,and the constructed path is optimal.