王仲民, 岳宏. 一种移动机器人全局路径规划新型算法[J]. 机器人, 2003, 25(2): 152-155,166.
引用本文: 王仲民, 岳宏. 一种移动机器人全局路径规划新型算法[J]. 机器人, 2003, 25(2): 152-155,166.
WANG Zhong-min, YUE Hong. A NEW ALGORITHM FOR MOBILE ROBOT GLOBAL PATH PLANNING[J]. ROBOT, 2003, 25(2): 152-155,166.
Citation: WANG Zhong-min, YUE Hong. A NEW ALGORITHM FOR MOBILE ROBOT GLOBAL PATH PLANNING[J]. ROBOT, 2003, 25(2): 152-155,166.

一种移动机器人全局路径规划新型算法

A NEW ALGORITHM FOR MOBILE ROBOT GLOBAL PATH PLANNING

  • 摘要: 针对模拟退火算法收敛速度慢这一缺陷,提出了一种基于共轭方向法和模拟退火算法相结合的新型混合优化算法,并成功应用于机器人神经网络路径规划中.该算法可以使优化解不陷入局部极值解而得到全局最优解,仿真实验研究表明:本文提出的这种新型混合优化算法,计算简单,收敛速度快,显著提高了求解移动机器人全局最优化问题的计算效率.

     

    Abstract: For simulated annealing algorithm, the convergence speed is very slow. So this paper presents a new hybrid optimal algorithm, which is successfully used for robot neural networks path planning, based on the combination of the simulated annealing algorithm and the conjugate direction method. This new hybrid optimal algorithm can not only prevent optimizing course from trapping the local minimum, but also achieve the global minimum. The simulation experiment demonstrates that this new algorithm's computation is simple, the convergence speed is fast. Also it can significantly improve the computational efficiency of solving mobile robot's global optimization problems.

     

/

返回文章
返回