关键词: 最短路径, Dijkstra算法, 动态规划

Abstract: 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.

Key words: shortest path, Dijkstra algorithm, dynamic planning