孟偲, 王田苗. 一种移动机器人全局最优路径规划算法[J]. 机器人, 2008, 30(3): 217-222.
引用本文: 孟偲, 王田苗. 一种移动机器人全局最优路径规划算法[J]. 机器人, 2008, 30(3): 217-222.
MENG Cai, WANG Tian-miao. A Global Optimal Path Planning Algorithm for Mobile Robot[J]. ROBOT, 2008, 30(3): 217-222.
Citation: MENG Cai, WANG Tian-miao. A Global Optimal Path Planning Algorithm for Mobile Robot[J]. ROBOT, 2008, 30(3): 217-222.

一种移动机器人全局最优路径规划算法

A Global Optimal Path Planning Algorithm for Mobile Robot

  • 摘要: 针对移动机器人全局最优路径规划问题,首先提出一种基于线性操作的遍历式算法,该算法通过场扫描方式生成步长转换矩阵(STM,Step Transform Matrix),并在步长转换矩阵中搜索考虑方向一致的最短路径,从而可以得到避免不必要路径转折的全局最短路径.其次提出了一种评价标准来区分路径优劣.最后通过仿真与圆形波传播算法进行了路径规划对比实验,实验结果表明本文所提算法在所提出的路径评价标准下可以获得比波传播算法更优的路径.

     

    Abstract: For global optimal path planning of mobile robot,a linear operation based traversal algorithm is proposed firstly.This algorithm computes the step transform matrix(STM) by field scan at first,and then searches the shortest path in the STM with consideration of search direction coherence.Thus a global shortest path which avoids unnecessary turn is planned.Secondly,a new evaluation criterion is proposed to distinguish whether paths are excellent or not.Finally,path planning comparison experiments are conducted with round wave propagation algorithm by simulation.The results show that the algorithm can find better path than wave propagation algorithm under the proposed criterion.

     

/

返回文章
返回