Accurate train simulation method based on shortest path algorithm

A technology of the shortest path algorithm and simulation method, which is applied in computing, special data processing applications, instruments, etc., and can solve the problems of poor scalability, cumbersome configuration files, etc.

Inactive Publication Date: 2010-06-09
CASCO SIGNAL
View PDF0 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0002] Usually, when simulating train running, it is necessary to specify the running route and running time of the train, and then the simulation system calculates the running distance and running speed of the train. Calculating the running path of the train is a prerequisite for train simulation running. Generally, the system for simulating train running , when the starting point and end point of the train are known, the simulation of the train operation is carried out according to the actual line diagram of the rail transit. However, the actual rail transit line Figure 1 Generally, it is more complicated and cumbersome. The train simulation operation needs to find the actual running path from the starting point to the running end by searching the configuration file (generated according to the actual rail transit line diagram), and calculate the train running distance and the speed of each position according to the running path
In this way, the configuration file based on the actual rail transit line is more important. If there are many stations, then there will be many configuration files between any two stations, reaching the Cn2 level. For each additional station, it is necessary to configure the operation of all stations and this station. route, so the configuration file is relatively cumbersome, and the scalability is poor, which adds complexity to the simulation of train operation

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
  • Accurate train simulation method based on shortest path algorithm
  • Accurate train simulation method based on shortest path algorithm
  • Accurate train simulation method based on shortest path algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0021] Such as figure 1 , figure 2 Shown, a kind of accurate train simulation method based on the shortest path algorithm, this method comprises the following steps:

[0022] Step 101, the train arrives at the station and starts to calculate the running curve and running speed of the next stage;

[0023] Step 102, according to the given rail transit line map, obtain the distance between adjacent stations, and the ATS system sends the departure station and arrival station of the train simulation operation to the simulation system;

[0024] Step 103, consider the rail transit line map as a network topology map, and carry out data structuring on the actual operating lines: regard the entire rail transit line map as a network topology map, and each station of the rail transit line map as a node, including node Index, node name is platform name, station serial number, platform serial number, number of neighboring stations, and specific neighboring station information, neighbori...

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 relates to an accurate train simulation method based on a shortest path algorithm. The method comprises the following steps of (1) starting to calculate the running curve and running speed of a train in next stage when the train arrives a railway station; (2) obtaining a distance between adjacent stations according to a given railway traffic line drawing and sending a departure station and a destination station of the simulation running of the train to a simulation system by an ATS system; (3) regarding the railway traffic line drawing as a network topology map and carrying out data structurization for a real running line; (4) calculating a weight value of the train from the departure station to the destination station; (5) calculating a shortest path from the departure station to the destination station according to the Dijkstra algorithm, which is a running curve; and (6) calculating running speeds of the train at all positions according to the train running time of the train send by the ATS system to the simulation system and by considering parameters of turnouts, slope, path bends and the like. Compared with the prior art, the invention has the advantages of accuracy, conciseness, easy extensibility and the like.

Description

technical field [0001] The invention relates to an urban rail train simulation method, in particular to an accurate train simulation method based on the shortest path algorithm. Background technique [0002] Usually, when simulating train running, it is necessary to specify the running route and running time of the train, and then the simulation system calculates the running distance and running speed of the train. Calculating the running path of the train is a prerequisite for train simulation running. Generally, the system for simulating train running , when the starting point and end point of the train are known, the simulation of the train operation is carried out according to the actual line diagram of the rail transit. However, the actual rail transit line Figure 1 Generally, it is more complicated and cumbersome. The train simulation operation needs to find the actual running path from the starting point to the running end by searching the configuration file (generate...

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
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/50
Inventor 黄柒光陈卫华
Owner CASCO SIGNAL
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