Dijkstra改进算法在机器人避障问题的应用

Application of Improved Dijkstra Algorithm in Robot Collision Avoidance Problem

本文研究了机器人避障问题中如何计算最短路径,建立了相应的数学模型。利用Dijkstra最短路径改进算法对该模型进行求解,解决了由确定起点经过若干目标点到达终点的问题。

Author is to set up a corresponding mathematical model by studying how to work out the shortest routes in the robot collision avoidance problem. The model is solved by using the shortest routes of improved Dijkstra Algorithm, thus the problem of arriving at the terminal point from the fixed starting point with several target points in the course has been settled.