基于Dijkstra算法的磁带导引AGV路径规划

Tape-guided AGV Path Planning Based on Dijkstra Algorithm

利用RFID射频卡定位技术,在复杂的AGV轨道车间环境下,实现了一种求解有轨磁带导引AGV最短路径的方法。运用拓扑法建立车间电子地图,双向行驶的路径轨道在AGV路径规划时存在很多问题,因此用有向轨道作为AGV的行驶路径,利用Dijkstra算法对AGV进行最短路径搜索。实验结果表明,该算法复杂性低,能够达到预期的路径规划目的。按照优化过的路径行驶提高了AGV的运营效率,降低了运营成本,对工业AGVS的调度及路径规划具有一定的应用价值。

Using RFID radio card positioning technology, in the environment of complex AGV orbit workshop, a method for solving the shortest path of AGV guided rail is realized. The electronic map of the workshop is established by using the topology method. There are many problems in AGV path planning when the orbit is two-way path, therefore, the directional path is used as travel path of the AGV. Finally, Dijkstra algorithm is used to search the AGV for the shortest path. The experimental results show that the algorithm has low complexity and can achieve the expected path planning. Driving on an optimized path improves AGV＇s operational efficiency and reduces operating costs. This method has certain application value to the scheduling and path planning of industrial AGVS.