1. A track traffic dynamic buffer zone calculation method is characterized in that a track zone which is occupied is used as an initial track zone, all track zones in a dynamic buffer zone of the track zone which is occupied are subjected to traversal search according to the advancing direction of a train, and the path and turnout state information of all track zones in the dynamic buffer zone are added;

the method for traversing search comprises the following steps:

if no turnout exists, sequentially searching the next track section of the current track section according to the advancing direction of the train;

if the convergence turnout exists, sequentially searching the next track section of the current track section according to the advancing direction of the train; if the current track section exists in the coverage area of the police rushing area of the convergence turnout, searching the track section covered by the police rushing area on the other side of the convergence turnout while searching the next track section of the current track section according to the advancing direction of the train, and judging the situation without considering the convergence turnout.

2. If there is a divergent switch, then the next positioning track section is searched first, and then the next inverted track section is searched. The track traffic dynamic buffer calculation method according to claim 1, wherein the method of adding path and switch state information of track sections comprises:

if no turnout exists, directly adding path information and empty turnout state information of the track section;

if the divergent turnout exists, respectively adding path information and turnout state information of the track section according to the traversing searching sequence;

if the convergent turnout exists, adding path information and turnout state information of the track section;

if the current track section exists in the warning area coverage area of the convergence turnout, adding the path information of all track sections covered by the warning area on the other side of the convergence turnout, and reversing the direction in the path information, wherein the convergence turnout does not need to be considered in the subsequent judgment of the situation.

3. The track traffic dynamic buffer calculation method according to claim 2, wherein the path and switch state information at least comprises: the name of the track segment being occupied, the name of the track segment in the dynamic buffer of the track segment being occupied, the buffered direction of the track segment in the dynamic buffer, the current buffering direction of the track segment in the dynamic buffer, the switch state between the track segment in the dynamic buffer and the starting track segment.

4. The track traffic dynamic buffer calculation method according to claim 1, wherein the train traveling direction includes an up direction and a down direction.

5. The track traffic dynamic buffer calculation method according to claim 1, wherein a first-in-last-out calculation stack is used to perform traversal search on all track sections in the dynamic buffer.

6. The track traffic dynamic buffer calculation method according to claim 3, wherein the path and switch state information is output as a file of a specified format after being sorted;

the sorting method comprises the following steps: the rail sections are sorted according to the names of the rail sections, then sorted according to an ascending-descending sequence, and finally sorted according to a turnout state reversal-positioning sequence.

7. The track traffic dynamic buffer calculation method according to any one of claims 1 to 6, wherein all track sections and switch collision regions in the dynamic buffer of the occupied track sections are obtained according to the system data table, the configuration information table and the switch list.

8. The track traffic dynamic buffer calculation method according to claim 7, wherein traversing the overlap area table containing the current route in the system data table, obtaining the adjacent route track section of the dynamic buffer covering the current route track section, and obtaining the name of the track section being occupied according to the buffer function activation number parameter in the configuration information table.

9. The method as claimed in claim 7, wherein traversing the switches of the current line range in the system data table divides the track sections into an uplink positioning, an uplink inverted position, a downlink positioning and a downlink inverted position according to the switch collision zone coverage track section list and the link relationship between the track sections.

Background

In the running process of the rail transit train, the buffer area can ensure the safe running of the train. The buffer area is divided into a static buffer area (static buffer) and a dynamic buffer area (dynamic buffer), wherein the dynamic buffer area can consider the turnout state in front of the train operation, and if the current turnout state is inconsistent with the turnout state when the route of the buffer area advances, the subsequent track section of the turnout in the line does not need to be considered. Therefore, the dynamic buffer area state calculation improves the train operation efficiency and simultaneously improves the calculation complexity.

In the existing calculation method, each track section (block) and each track section (buffering block) which may be occupied when the track section is in a passive occupied block are calculated, and the one-to-one algorithm causes repeated calculation of multiple paths, thereby affecting the software operation efficiency.

Disclosure of Invention

The invention aims to provide a track traffic dynamic buffer area calculation method which can improve software operation efficiency.

In order to achieve the above object, the present invention provides a method for calculating a track traffic dynamic buffer, which comprises using an occupied track segment as a starting track segment, performing traversal search on all track segments in the dynamic buffer of the occupied track segment according to the train traveling direction, and adding the path and switch state information of all track segments in the dynamic buffer;

the method for traversing search comprises the following steps:

if no turnout exists, sequentially searching the next track section of the current track section according to the advancing direction of the train;

if the convergence turnout exists, sequentially searching the next track section of the current track section according to the advancing direction of the train; if the current track section exists in the warning area coverage area of the convergence turnout, searching a track section covered by the warning area on the other side of the convergence turnout while searching the next track section of the current track section according to the advancing direction of the train, and judging the situation without considering the convergence turnout;

if there is a divergent switch, then the next positioning track section is searched first, and then the next inverted track section is searched.

The method for adding the path and turnout state information of the track section comprises the following steps:

if no turnout exists, directly adding path information and empty turnout state information of the track section;

if the divergent turnout exists, respectively adding path information and turnout state information of the track section according to the traversing searching sequence;

if the convergent turnout exists, adding path information and turnout state information of the track section;

if the current track section exists in the warning area coverage area of the convergence turnout, adding the path information of all track sections covered by the warning area on the other side of the convergence turnout, and reversing the direction in the path information, wherein the convergence turnout does not need to be considered in the subsequent judgment of the situation.

The path and switch state information at least comprises: the name of the track segment being occupied, the name of the track segment in the dynamic buffer of the track segment being occupied, the buffered direction of the track segment in the dynamic buffer, the current buffering direction of the track segment in the dynamic buffer, the switch state between the track segment in the dynamic buffer and the starting track segment.

The train traveling direction includes an up direction and a down direction.

And traversing search of all track sections in the dynamic buffer is realized by adopting a calculation stack with first input and then output.

Sorting the path and turnout state information and outputting the sorted path and turnout state information as a file with a specified format;

the sorting method comprises the following steps: the rail sections are sorted according to the names of the rail sections, then sorted according to an ascending-descending sequence, and finally sorted according to a turnout state reversal-positioning sequence.

And acquiring all track sections and switch collision warning areas in the dynamic buffer areas of the occupied track sections according to the system data table, the configuration information table and the switch list.

Traversing the overlapped area table containing the current line in the system data table, obtaining the adjacent line track section of the dynamic buffer area covering the current line track section, and obtaining the name of the track section which is being occupied according to the buffer area function activation number parameter in the configuration information table.

Traversing turnouts in the current line range in the system data table, and dividing track sections into an uplink positioning, an uplink inverted position, a downlink positioning and a downlink inverted position according to a turnout collision region covering track section list and a link relation between the track sections.

Compared with the prior art, the invention has the following advantages:

1. the method has high operation efficiency, and reduces the efficiency reduction caused by multiple times of calculation of the path by calculating the whole path based on the train behavior, and the actual result shows that the method can save more than 90% of time compared with the prior art.

2. The maintainability is high, the steps in the method do not have a strong coupling relation, when the rule of a certain step is changed or new content needs to be added, the position needing to be updated can be found for maintenance, and the realization of other steps is not influenced.

Drawings

Fig. 1 is a specific flowchart of a method for calculating a dynamic buffer area of rail transit according to the present invention.

FIG. 2 is a flow chart for obtaining path and switch state information based on train behavior and deep search traversal.

FIG. 3 is a schematic diagram of forming type 1 between track sections and dynamic buffer track sections.

FIG. 4 is a schematic diagram of the type 2 formed between track segments and dynamic buffer track segments.

FIG. 5 is a schematic diagram of the type 3 formed between track segments and dynamic buffer track segments.

Fig. 6 is a partial diagram of an actual circuit according to an embodiment of the present invention.

Detailed Description

The preferred embodiment of the present invention will be described in detail below with reference to fig. 1 to 6.

As shown in fig. 1, the present invention provides a method for calculating a dynamic buffer of rail transit, comprising the following steps:

step A: initializing parameters;

and B: acquiring a calculation formula of the state of the track section which is being occupied;

and C: acquiring a mapping relation between a turnout and a track section covered by a turnout collision warning area;

step D: generating a path between each track segment and each track segment that the track segment may be occupying when passively occupied, and intra-path switch state information;

step E: and D, outputting the path obtained in the step D and the corresponding turnout state information list as a file with a specified format.

The step A: initializing parameters, wherein the initialized parameters comprise:

all track sections contained by the current route; track sections contained in adjacent lines, wherein the track sections correspond to the track sections of the dynamic buffer area covering the current line; listing all turnouts; a system data table; and configuring an information table.

The step B: obtaining a calculation formula of the state of the track section being occupied, comprising:

1) traversing an overlapping area table containing the current route in a system data table to obtain an adjacent route track section of which the dynamic buffer area covers the current route track section; there may be track sections in the adjacent lines where the buffer area contains the track section of the current line, and these track sections in the adjacent lines need to be considered, but the track sections in all the adjacent lines need not be considered, so in step B, it is necessary to screen out the track sections in the adjacent lines loaded in step a where the buffer area contains the track section of the current line track section as part of the calculation and the result;

2) and acquiring a state calculation formula of each occupied track section by adopting a data structure of a stack according to the buffer area function activation number parameter in the configuration information table, wherein the dynamic buffer areas of the track sections comprise the current line track section.

The step C: acquiring a mapping relation between a turnout and a track section covered by a turnout collision warning area, specifically:

traversing turnouts in the current line range in the system data table, and dividing the track sections into uplink positioning, uplink inverted positioning, downlink positioning and downlink inverted storage according to a track section list covered by an alarming zone of the turnouts and a link relation between the track sections.

The step D: generating a path and intra-path switch state information (shown in fig. 2) between each track segment and each track segment that may be occupied when the track segment is passively occupied through a depth-first traversal search according to train behaviors (including a train starting position, a track segment that is currently occupied, and a train traveling direction), including:

1. b, acquiring a formula name containing the track section name in the state calculation formula of the occupied track section obtained in the step B as an object to be calculated, and initializing a calculation stack and turnout state information;

2. for each occupied track section, pressing the track section into a calculation stack to serve as a starting track section for the train to travel, and respectively taking the two directions of up and down as the traveling directions of the train to start traversing;

3. popping up the topmost track section in the computing stack, and acquiring turnout state information between the track section and the initial track section;

4. judging whether the track section exists in a dynamic buffer area in the current direction of the initial track section, if not, executing a step 8;

5. judging turnout information, if no turnout exists, forming a type 1 relationship between the track section and the initial track section (shown in figure 3), and directly storing the track section and the state information of the empty turnout into a path list; if there is a switch, the track section and the initial track section form a relationship of type 2 (see fig. 4), and the track section and the switch state information are stored into the path list;

6. judging whether the current track section exists in a turnout alert area of the convergent turnout, if so, obtaining track sections on the other side of the convergent turnout according to the mapping relation between the turnout and the track section covered by the turnout alert area obtained in the step C, wherein the track sections and the initial track section form a type 3 relation (shown in figure 5), storing the track sections into a path list, and simultaneously, reversing the direction, wherein the related turnout state information is the same as the turnout state information between the current track section and the initial track section;

7. according to the link relation, obtaining the next track section of the current track section in the direction, if divergent turnouts exist, simultaneously obtaining the next track section of positioning and reversing, adding different turnout state information on the basis of the current path turnout information, respectively associating the turnout state information with the next track section of positioning and reversing, firstly pressing the reversing track section into a calculation stack, and then pressing the positioning track section into the calculation stack; if the convergence turnout exists, adding the turnout state into the turnout state information of the current path, and then pressing the next track section into a calculation stack; if no turnout exists, directly pressing the next track section into a calculation stack; if no next track section exists, no operation is executed;

8. judging whether the current computing stack is empty, if so, ending traversal, judging whether the next occupied track section exists, if so, selecting and initializing the computing stack and turnout state information, and executing the step 2, otherwise, directly ending; and if the current computing stack is not empty, executing the step 3.

The step E: and D, outputting the path obtained in the step D and the corresponding turnout state information list into a file with a specified format, wherein the file comprises:

1) d, sorting the paths obtained in the step D and the corresponding turnout state information list;

2) and outputting the file in the specified format.

For step E, the sorting of the paths obtained in step D and the corresponding switch state information list means that the paths are sorted according to the ID of the passively occupied track section, and then sorted according to the ascending-descending order and the switch state reversal-positioning order.

The methods for traversing search and adding track section turnout information are divided into three types: the first is that no turnout exists, if the turnout is consistent with the current description, the next track section is searched and recorded according to the advancing direction; the second is that there is a switch, if there is a convergent switch, then the next track section is still searched according to the advancing direction, but at this time, the track section may continue to advance through the positioning or the inversion of the switch, and the state of the switch at this time needs to be recorded, if there is a divergent switch, then the current description is consistent; the third method is carried out simultaneously with the first two methods, whether a turnout exists or not is judged, whether a current track section exists in a warning area coverage area of a certain convergence turnout or not is judged, if the current track section exists, all track sections covered by the warning area on the other side of the convergence turnout are searched (at the moment, the turnout state information of the convergence turnout does not need to be recorded), the direction is reversed, the turnout does not need to be considered again in the judgment of the situation, and only all track sections on the other side need to be searched in the third method without continuing to search forward in sequence.

The track section line connection situation of the embodiment is shown in figure 6. The impact regions (Fouling zones) of the turnout P1 are B2, B3 and B5, and the impact regions (Fouling zones) of the turnout P2 are B3, B4 and B6. In this embodiment, B1 located on an adjacent line is used as an occupied track segment (Buffering block), and other track segments are all in a dynamic buffer in the upstream direction of B1. A dynamic buffer status calculation formula for all other track segments with respect to B1 is generated. In the present embodiment, the results are given in the form of boolean logic.

Step A: initializing parameters;

loading a system data table, a configuration information table, all track sections and turnout information, wherein only the functions 1 and 2 of the buffer area are activated in the configuration information table, wherein the function 1 and the function 2 represent that the calculation function of the buffer area is activated under 2 vehicle modes;

and B: acquiring a calculation formula of the state of the track section which is being occupied;

in this embodiment, the track segment being occupied is B1, and its dynamic buffer status calculation formula is generated:

--OPERATOR_NAME；BE_RESULT_NAME；BIINARY_NAME_LEFT；BIINARY_NAME_RIGHT

OPERATOR_AND；BE_NOT_BUFFERING_UP_B1；LC_NOT_BUFFERING_1_UP_B1；LC_NOT_BUFFERING_2_UP_B1

and C: acquiring a mapping relation between a turnout and a track section covered by a turnout collision warning area;

in this embodiment, there are two switches P1 and P2, and the collision warning areas of the two switches can be obtained according to the link relationship and the positioning and reversing relationship in fig. 6, as shown in table 1.

TABLE 1 Turnout-rush-warning area table

Step D: generating a path between each track segment and each track segment that the track segment may be occupying when passively occupied, and intra-path switch state information;

1) b1 is used as a starting block to be pushed into a stack, B1 is firstly popped out of the stack, and since the B1 is not in a dynamic buffer area of the B1, the B2 is obtained and is pushed into the stack;

2) b2 is popped, and the relationship between B2 and B1 is type 1, and is directly stored;

3) b2 in the collision warning area of P1, calculating the track section B5 on the other side, and storing the track section B in accordance with the state of B2;

4) push the next track segment B3 of B2 onto the stack and add the P1 switch state;

5) popping B3, calculating and storing the state, then putting the next track section into a stack according to the sequence of B6 and B4, and simultaneously adding the corresponding P2 turnout state to different paths respectively;

6) pop-up B4 calculation and storage;

7) pop-up B6 calculation and storage; if there is a track section behind B4, the processing method is the same as that of B2, after calculation and storage, the subsequent track section of B4 is pushed onto the stack, and then the subsequent track section of B4 is popped for calculation until the subsequent no track section is in the buffer of the initial track section, and then B6 is popped for calculation.

The information obtained finally is shown in table 2.

TABLE 2 Path and corresponding Turnout State information Table

Step E: and D, outputting the path obtained in the step D and the corresponding turnout state information list as a file with a specified format.

And sorting the results according to the results obtained in the table 2, and converting the results into a formula for outputting.

--OPERATOR_NAME；BE_RESULT_NAME；BIINARY_NAME_LEFT；BIINARY_NAME_RIGHT

OPERATOR_AND；BE_NOT_BUFFERED_UP_B2；BE_NOT_BUFFERING_UP_B1；BE_NOT_BUFFERING_UP_B1

OPERATOR_OR；BE_NOT_BUFFERED_UP_B3；BE_NOT_BUFFERING_UP_B1；LC_F_DPR_P1

OPERATOR_OR；BE_NOT_BUFFERED_UP_B4_0001；LC_F_DPR_P1；LC_F_DPR_P2

OPERATOR_OR；BE_NOT_BUFFERED_UP_B4；BE_NOT_BUFFERING_UP_B1；BE_NOT_BUFFERED_UP_B4_0001

OPERATOR_AND；BE_NOT_BUFFERED_DN_B5；BE_NOT_BUFFERING_UP_B1；BE_NOT_BUFFERING_UP_B1

OPERATOR_OR；BE_NOT_BUFFERED_UP_B6_0001；LC_F_DPR_P1；LC_F_DPN_P2

OPERATOR_OR；BE_NOT_BUFFERED_UP_B6；BE_NOT_BUFFERING_UP_B1；BE_NOT_BUFFERED_UP_B6_0001

Compared with the prior art, the invention has the following advantages:

1. the method has high operation efficiency, and reduces the efficiency reduction caused by multiple times of calculation of the path by calculating the whole path based on the train behavior, and the actual result shows that the method can save more than 90% of time compared with the prior art.

2. The maintainability is high, the steps A to E in the method do not have a strong coupling relation, when the rule of a certain step is changed or new content needs to be added, the position needing to be updated can be found for maintenance, and the realization of other steps is not influenced.

It should be noted that, in the embodiments of the present invention, the terms "center", "longitudinal", "lateral", "length", "width", "thickness", "upper", "lower", "front", "rear", "left", "right", "vertical", "horizontal", "top", "bottom", "inner", "outer", "clockwise", "counterclockwise", "axial", "radial", "circumferential", etc. indicate the orientation or positional relationship shown in the drawings, and are only for convenience of describing the embodiments, but do not indicate or imply that the referred device or element must have a specific orientation, be constructed in a specific orientation, and be operated, and thus, should not be construed as limiting the present invention. Furthermore, the terms "first," "second," and "third" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance.

In the present invention, unless otherwise expressly stated or limited, the terms "mounted," "connected," "secured," and the like are to be construed broadly and can, for example, be fixedly connected, detachably connected, or integrally formed; can be mechanically or electrically connected; either directly or indirectly through intervening media, either internally or in any other relationship. The specific meanings of the above terms in the present invention can be understood by those skilled in the art according to specific situations.

While the present invention has been described in detail with reference to the preferred embodiments, it should be understood that the above description should not be taken as limiting the invention. Various modifications and alterations to this invention will become apparent to those skilled in the art upon reading the foregoing description. Accordingly, the scope of the invention should be determined from the following claims.