| 避免路径规划NA算法局部极小值的仿真试验 |
| |
| 引用本文： | 禹建丽. 避免路径规划NA算法局部极小值的仿真试验[J]. 河南科技大学学报(自然科学版), 2001, 22(3): 50-52 |
| |
| 作者姓名： | 禹建丽 |
| |
| 作者单位： | 洛阳工学院应用数学系 |
| |
| 基金项目： | 河南省自然科学基金资助项目 ( 0 1110 6 0 40 0 ) |
| |
| 摘 要： | 针对已知障碍物形状和位置环境下的机器人全局路径规划问题 ,提出利用神经网络路径规划算法进行路径规划。为解决神经网络路径规划算法的局部极小值问题 ,提出针对障碍物的形状设定各条边的模拟退火初始温度。采用此方法仿真试验的结果表明 ,该方法能够避免某些局部极小值情况 ,规划的无碰路径达到了最短无碰路径
|
| 关 键 词： | 机器人 全局路径规划 神经网络 局部极小值 模拟退火温度 仿真 |
| 文章编号： | 1000-5080(2001)03-0050-03 |
| 修稿时间： | 2001-04-27 |
The Experiment of the Local Minimum Value of the Algorithm for Path Planning |
| |
| YU Jian Li. The Experiment of the Local Minimum Value of the Algorithm for Path Planning[J]. Journal of Henan University of Science & Technology:Natural Science, 2001, 22(3): 50-52 |
| |
| Authors: | YU Jian Li |
| |
| Abstract: | 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. |
| |
| Keywords: | Robots Global path planning Neural network Energy function Simulated annealing Sinulation |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
