Interlocking route dynamic control method

A dynamic control and approach technology, applied in the control system of the transportation center, railway signals, railway car body parts, etc., can solve the problem of complex transformation of the path into the approach group.

Active Publication Date: 2021-02-09
CRSC WANQUAN SIGNAL EQUIP
View PDF7 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003]Route search is the basic function of the industrial railway intelligent dispatching management system. In the existing technology, for the starting point and the target point, there are many routes formed, and it is more complicated to convert the r...

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Interlocking route dynamic control method
  • Interlocking route dynamic control method
  • Interlocking route dynamic control method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0050] Such as figure 1 As shown, a dynamic control method for an interlocking approach includes the following steps:

[0051] S110. Obtain path information, where the path information includes a starting point and a target point;

[0052] S120. Determine the shortest path from the starting point to the target point according to the shortest path algorithm model and the path information.

[0053] In embodiment 1, obtain the information that the train needs to run, including the data of each point on the interlocking station, form the path information according to the real-time data of each point, and plan the shortest path from the starting point to the target point according to the shortest path algorithm model , which contains all the points and edges of the route. After optimizing the shortest route, perform fuzzy matching on the edges in the passing route and the edges in the interlocking route to find the optimal route group.

Embodiment 2

[0055] Such as figure 2 As shown, a dynamic control method for an interlocking approach, including:

[0056] S210. Obtain the data of each point and each side of the interlocking station, and determine path information according to the data of each point and each side of the interlocking station;

[0057] S220. The path information includes a point set and an edge set, the point set includes a starting point and a target point, and the edge set includes edges and edge weights between each point;

[0058] S230. Determine the shortest path from the starting point to the target point according to the shortest path algorithm model and the path information.

[0059]It can be known from Example 2 that according to the data of each station, the point set and the edge set between points in the station are determined, and then the path information is determined, the starting point and the target point are locked, the map is initialized by the station data, and the map is obtained fro...

Embodiment 3

[0061] Such as image 3 As shown, a dynamic control method for an interlocking approach, including:

[0062] S310. Initialize the path information and set a temporary edge set and a temporary point set, and take out a point corresponding to the starting point from the point set and put it into the temporary point set;

[0063] S320. Find an edge containing points in the temporary point set and having the smallest weight from the edge set, and put it into the temporary edge set;

[0064] S330. Take the other vertex of the side with the smallest weight out of the point set, record the parent node of the other vertex, and put the other vertex into the temporary point set, if the point is target point, then find the shortest path from the starting point to the target point;

[0065] S340. Determine whether the edge set contains an edge composed of any two points in the temporary point set, and if so, delete it from the edge set, and repeat the above steps until there is no point...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses an interlocking route dynamic control method which comprises the following steps: acquiring route information which comprises a starting point and a target point, and determining the shortest route from the starting point to the target point according to a shortest route algorithm model and the route information.The method is suitable for clear initial points and end points; the formed access paths are more, the path from the starting point to the target place is converted into an access path group which is more complex, the access path group does not need to be organized in a manual mode, and the route from the starting point to the target station is more convenient to replan according to the method, so that the train can safely and efficiently reach the target point from the starting point; scheduling personnel are effectively reduced, and production efficiency is improved.

Description

technical field [0001] The invention relates to the technical field of railway signal automatic control, in particular to a dynamic control method for interlocking routes. Background technique [0002] Industrial railways are usually composed of multiple stations with different functions. Usually, a two-level dispatching mode of company-level dispatching and station-level dispatching is set up to dispatch and command special railways within the company. Decentralized dispatching rights separate a complete production operation process In the future, it will affect the production efficiency of the enterprise. With the advancement of automation and information technology, the cumbersome internal railway transportation of the enterprise can be adjusted through technical means, and the centralized dispatching mode is adopted. Only the first-level dispatching is set at the company level, and at the same time, the dispatching system is provided. Automated and intelligent, reducing ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): B61L19/00B61L27/00
CPCB61L19/00B61L27/00Y02P90/02
Inventor 金云周苗林卫永王钏文
Owner CRSC WANQUAN SIGNAL EQUIP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap