一种基于Dijkstra算法的动态进路规划方法

Dynamic Route Planning Method Based on Dijkstra Algorithm

为解决调车作业计划自动转化为联锁进路问题,介绍一种动态进路规划方法。把站场抽象为一个无向联通图,使用Dijkstra算法,求解出计划中的起点轨道到终点轨道的一条顺序包含无岔区段和道岔的最短路径。使用模糊匹配算法,对联锁表基本进路中的设备与最短路径中的设备,按照顺序以及设备实时状态进行匹配,获取到正确的进路组合,实现动态进路规划。

This paper introduces a dynamic route planning method to solve the problem of automatic transfer of shunting operation plan into interlocking route.The station(yard)is abstracted as an undirected link graph,and the shortest path from the starting track to the ending track is solved by using Dijkstra algorithm.The fuzzy matching algorithm is used to match the equipment in the basic path and the equipment in the shortest path of the interlocking table according to the sequence and the real-time status of the equipment,and obtain the correct path combination,to achieve dynamic path planning.