An Adjustable Fast Search Method for Local Optimal Routes

Abstract

The invention provides an adjustable rapid searching method for local optimal route, which belongs to the field of rail traffic train signal control systems. The adjustable rapid searching method forlocal optimal route reduces the input amount of program configured data, the work load of engineering test and verification. Full-station route is searched and stored only at the time of system initialization, and route can be selected through table look-up, and time consumed by the method is far less than the scheme adopting dynamic searching in terms of route selection. Through adjusting the searching bias value of the station field branched knot (the knot where the route branch starts), the searching result of a certain route or a certain type of route can be affected, so that the aim of being consistent to the interlocking table input by design can be achieved. The method is convenient and direct in adjusting, and the affecting range is controllable.

Description

technical field [0001] The invention belongs to the field of rail transit train signal control systems, and in particular relates to an adjustable fast search method for local optimal routes. Background technique [0002] The rail transit train signal control system is based on the actual situation of the rail line and the real-time running situation of the train, which controls, protects, adjusts and supervises the running state of the train. [0003] Among them, the ground station control system includes the CI subsystem, which is used to calculate the interlocking relationship of station access, signals, switches, sections, etc., and complete the control and protection functions of trackside equipment. The passable path of trains connected between protective signals in the same direction is called an approach, and the approach data includes the control of all equipment (signals, switches, sections, etc.) on the approach path, protection conditions, and hostile forces outs...

AI Technical Summary

Problems solved by technology

[0009] Existing technical solution A: The disadvantage is that there are too many data entered, and the data changes during the engineering transformation are relatively large, and the data configuration personnel have certain design background requirements, which is prone to errors

A large amount of configuration data leads to a large workload of engineering testing and verification

[0010] Prior art scheme B: the search result is the globally optimal approach path, but it is inconvenient to adjust the search result, and adjust the station node parameters (such as the estimation function in the A Star algorithm, the weight of the lateral edge of the turnout node in the Dijkstra algorithm ), the scope of influence is relatively large, and it may affect multiple routes, not just the one you want to adjust; the dynamic search operation takes a long time, and when the CI system processes multiple route selection commands at the same time, there is a timeout risk

Images