A method for determining conflicts between track sections

Abstract

This invention discloses a method for determining conflicts between track segments, relating to the field of rail transit technology. When the first track segment and the second track segment are in opposite directions, if the starting point of the first track segment can be found along the direction of this segment along the same segment, and the search path length is greater than 0 and less than the sum of the lengths of the two track segments; or, if the first track segment and the second track segment are in opposite directions, if the ending point of the first track segment can be found along the opposite direction of this segment along the same segment, and the search path length is greater than 0 and less than the sum of the lengths of the two track segments, then the two track segments are in conflict. This invention accurately determines whether two track segments conflict. This invention only requires one search to determine whether there is a conflict, greatly reducing the judgment time and the time complexity of the algorithm; this algorithm is particularly advantageous in the rail transit industry, where timeliness is crucial.

Description

Technical Field

[0001] This invention relates to the field of rail transit technology, and more specifically to a method for determining conflicts between track sections. Background Technology

[0002] In recent years, with the booming development of rail transit around the world, fully automatic train systems have emerged. In fully automatic train systems, a safe and efficient garage door management solution can greatly improve the line's operational capacity.

[0003] like Figure 2 The diagram shows a parking garage layout. When an authorized parking garage door is closed, the authorized crossing area of ​​its associated authorized crossing chain is set to a restricted state. Simultaneously, if there are overlapping authorized crossing areas in the authorized crossing chains associated with a parking garage door, but with opposite authorization directions, then the authorized crossing chain conflicts with this authorized crossing area. The conflicting authorized crossing area also needs to be set to a restricted state to prevent unforeseen risks caused by the occupation of authorized crossing areas. Therefore, quickly and accurately determining whether an authorized crossing chain and an authorized crossing area conflict is of great significance for improving parking garage door management efficiency.

[0004] In the prior art, patent CN113911184A discloses a general method for determining whether two track segments overlap in opposite directions. If, during the search from the starting point to the ending point of the first track segment, it passes through the starting point of the second track segment, and during the search from the starting point to the ending point of the second track segment, it also passes through the starting point of the first track segment, then the two track segments overlap in opposite directions. Alternatively, if, during the search from the starting point to the ending point of the first track segment, it passes through the ending point of the second track segment, and during the search from the starting point to the ending point of the second track segment, it also passes through the ending point of the first track segment, then the two track segments overlap in opposite directions. This invention can quickly and accurately determine whether two track segments overlap in opposite directions.

[0005] The above general judgment calculation method has two search judgment calculation methods:

[0006] Method 1: If the first track segment passes through the starting point of the second track segment during its search from the starting point to the ending point, and the second track segment also passes through the starting point of the first track segment during its search from the starting point to the ending point, then the two track segments overlap in opposite directions.

[0007] Method 2: If the first track segment passes through the end point of the second track segment during its search from the start point to the end point, and the second track segment also passes through the end point of the first track segment during its search from the start point to the end point, then the two track segments overlap in opposite directions.

[0008] In both of the above search judgment calculation methods, each search judgment calculation method includes two search judgments: the first track segment searches from the starting point to the ending point, and the second track segment searches from the starting point to the ending point.

[0009] like Figure 3 and 4 As shown, there are two common scenarios: the upper section is the first track section, and the lower section is the second track section.

[0010] like Figure 3 As shown, Method 1 is used to search and judge the scenario: during the search from the starting point Bgn1 of the first track segment to the ending point End1, the starting point Bgn2 of the second track segment is not passed; at the same time, during the search from the starting point Bgn2 of the second track segment to the ending point End2, the starting point Bgn1 of the first track segment is not passed, and the two track segments do not overlap in opposite directions.

[0011] like Figure 3 As shown, Method 2 is used to search and judge the scenario: during the search from the starting point Bgn1 of the first track segment to the ending point End1, it passes through the ending point End2 of the second track segment; at the same time, during the search from the starting point Bgn2 of the second track segment to the ending point End2, it passes through the ending point End1 of the first track segment, and the two track segments overlap in opposite directions.

[0012] like Figure 4 As shown, Method 1 is used to search and judge the scenario: during the search from the starting point Bgn1 of the first track segment to the ending point End1, it passes through the starting point Bgn2 of the second track segment; at the same time, during the search from the starting point Bgn2 of the second track segment to the ending point End2, it passes through the starting point Bgn1 of the first track segment, and the two track segments overlap in opposite directions.

[0013] like Figure 4 As shown, Method 2 is used to search and judge the scenario: during the search from the starting point Bgn1 of the first track segment to the ending point End1, the search does not pass through the ending point End2 of the second track segment; at the same time, during the search from the starting point Bgn2 of the second track segment to the ending point End2, the search does not pass through the ending point End1 of the first track segment, and the two track segments do not overlap in opposite directions.

[0014] Therefore, for Figure 3 In this scenario, when Method 1 is applied, it cannot detect reverse overlap; however, when Method 2 is applied, it can detect reverse overlap. For Figure 4 In this scenario, when Method 1 is applied, it can detect reverse overlap; however, when Method 2 is applied, it cannot detect reverse overlap. Method 1 is suitable for... Figure 4Method two is suitable for the scene search judgment in Method one Figure 3 Method two is suitable for the scene search judgment in Method one

[0015] In practical applications, it is impossible to determine in advance which method is suitable for which scene before searching, and if only one method is used, the track section may be searched and judged to be reversely overlapped, but there may also be a missed judgment, resulting in a reverse overlap judgment error, so it is best to use both methods simultaneously.

[0016] When using a single method of Method one or Method two for search judgment, two search judgment operations are required to determine whether the track sections are reversely overlapped. When using Method one and Method two simultaneously for search judgment, a total of four search judgment operations are required to determine whether the track sections are reversely overlapped.

[0017] As described above, the best case of the general judgment calculation method for the reversely overlapped area in the track section requires two searches to determine whether the track sections conflict, and the worst case requires four searches to determine whether the track sections conflict. The number of searches is large, which greatly increases the time complexity of the algorithm, and the algorithm is not highly applicable in rail transit, and it is difficult to meet the requirements of timeliness. SUMMARY

[0018] In order to overcome the defects in the prior art, the present application discloses a method for judging the conflict between track sections, and the purpose of the present application is to solve the problem that the number of searches in the prior art is large, which greatly increases the time complexity of the algorithm, and the algorithm is not highly applicable in rail transit, and it is difficult to meet the requirements of timeliness. In the present application, if the directions of the first track section and the second track section are opposite, the starting point of the second track section can be searched from the starting point of the first track section along the direction of the section, and the search path length is greater than 0 and less than the sum of the lengths of the two track sections. Alternatively, if the directions of the first track section and the second track section are opposite, the end point of the second track section can be searched from the end point of the first track section along the opposite direction of the section, and the search path length is greater than 0 and less than the sum of the lengths of the two track sections, then the two track sections conflict. The two methods of the present application only require one search to determine whether there is a conflict, solving the timeliness problem of the existing algorithm, greatly reducing the time complexity of the algorithm, and being able to quickly and accurately determine whether the two track sections conflict.

[0019] In order to achieve the above purpose, the technical scheme adopted by the present application is as follows:

[0020] A method for judging the conflict between track sections, comprising:

[0021] When the first track section and the second track section are opposite in direction, the first track section can search the start point of the second track section from the start point along the section direction, and the search path length is greater than 0 and less than the sum of lengths of the two track sections, then the first track section and the second track section conflict.

[0022] Or, when the first track section and the second track section are opposite in direction, the first track section can search the end point of the second track section from the end point along the reverse direction of the section, and the search path length is greater than 0 and less than the sum of lengths of the two track sections, then the first track section and the second track section conflict.

[0023] The specific method of the application comprises the following steps:

[0024] S1, selecting a first track section and a second track section;

[0025] Preferably, in the S1 step, the first track section is a mobile authorization crossing section in a mobile authorization crossing chain associated with a garage door management subsystem of a train full-automatic driving system.

[0026] The application can be used in a garage door management subsystem of a train full-automatic driving system. When the authorized garage door is closed, the mobile authorization crossing section (first track section) of the mobile authorization crossing chain associated with the garage door is set to a limited state. Meanwhile, if there is a mobile authorization crossing section (second track section) in the mobile authorization crossing chain associated with the garage door, which has intersection with the mobile authorization crossing section (first track section) and opposite authorization direction, the mobile authorization crossing chain conflicts with the mobile authorization crossing section (second track section), and the conflicting mobile authorization crossing section (second track section) also needs to be set to a limited state, so as to prevent the authorized crossing section from being occupied and cause unpredictable risks. The purpose of the application is to automatically determine whether the first track section and the second track section conflict and take corresponding measures.

[0027] S2, judging whether the first track section and the second track section are opposite in direction, if yes, entering the next step;

[0028] Preferably, in the S2 step, if the first track section and the second track section are not opposite in direction, the first track section and the second track section do not conflict.

[0029] In the application, for the first track section and the second track section, only when the directions of the trains running on the track sections are opposite, the train running conflict occurs, so it is necessary to first judge the directions of the first track section and the second track section. If the directions are the same, the two track sections do not conflict, and if the directions are opposite, the next step is further judged to see whether the two track sections conflict.

[0030] Preferably, in the S2 step, the directions of the first track section and the second track section are determined by a line map.

[0031] S3, calculating the sum of the lengths of the first track section and the second track section;

[0032] In the present application, the purpose of calculating the sum of the lengths of the two track sections is to facilitate the comparison with the search path length in the subsequent step. If the search path length is between 0 and the sum of the lengths of the two track sections, it indicates that the first track section and the second track section may conflict, which needs to be further determined. If it is not between 0 and the sum of the lengths of the two track sections, it indicates that the first track section and the second track section do not conflict.

[0033] S4, searching for the starting point of the second track section from the starting point of the first track section along the direction of the first track section and recording the search path length, or searching for the ending point of the second track section from the ending point of the first track section along the opposite direction of the first track section and recording the search path length;

[0034] In the present application, the starting point or the ending point of the second track section is searched from the starting point or the ending point of the first track section, and the search path length is recorded, so as to facilitate the subsequent determination of whether the first track section and the second track section conflict.

[0035] S5, determining whether the search path length is greater than 0 and less than the sum of the lengths of the two track sections. If yes, the next step is entered.

[0036] Preferably, in the S5 step, if the search path length is not within the interval greater than 0 and less than the sum of the lengths of the two track sections, the first track section and the second track section do not conflict.

[0037] S6, determining whether the starting point of the first track section is searched in the search path of the starting point of the second track section, or determining whether the ending point of the first track section is searched in the search path of the ending point of the second track section. If yes, the first track section and the second track section conflict.

[0038] Preferably, in the S6 step, when the first track section and the second track section conflict, the second track section is a mobile authorization crossing section in the garage door management subsystem of the train full-automatic driving system, which has an intersection with the first track section and an opposite authorized direction.

[0039] Preferably, in the S6 step, when the first track section and the second track section conflict and the garage door of the garage door management subsystem of the train full-automatic driving system is closed, the first track section and the second track section are both set to a restricted state.

[0040] In the application, when the authorized garage door is closing, the moving authorization crossing area (first track section) of the moving authorization crossing chain associated with the self is set to a limited state, and the moving authorization crossing area (second track section) of the moving authorization crossing chain associated with the garage door, which has intersection with the moving authorization crossing area and opposite authorization direction, is also set to a limited state, so as to prevent the moving authorization crossing area from being occupied and causing unpredictable risks.

[0041] Preferably, in the S6 step, when the start point or the end point of the second track section is not searched, the step further comprises:

[0042] S7, judging whether the track end is searched, if not, continuing to search and returning to the S5 step, if yes, the first track section and the second track section are not in conflict.

[0043] Preferably, when the first track section and the second track section are not in conflict and the garage door of the garage door management subsystem of the train full-automatic driving system is closing, the first track section is set to a limited state, and the second track section is not set to a limited state.

[0044] The above-mentioned track section conflict judgment method has two search judgment track section conflict methods:

[0045] Method one: the first track section can search the start point of the second track section from the start point along the direction of the section, and the search path length is greater than 0 and less than the sum of the lengths of the two track sections;

[0046] Method two: the first track section can search the end point of the second track section from the end point along the reverse direction of the section, and the search path length is greater than 0 and less than the sum of the lengths of the two track sections.

[0047] In the above-mentioned two search judgment track section conflict methods, each search judgment track section conflict method includes a search method, that is, method one searches from the start point of the first track section along the direction of the section, and method two searches from the end point of the first track section along the reverse direction of the section.

[0048] Here, for any (best or worst) case, one of the two methods can be used for judgment (both method one and method two can judge whether there is conflict, and the results are the same), so only one search is needed to judge whether there is conflict.

[0049] The beneficial effects of the application are:

[0050] The application provides a method for judging conflicts between track sections, when the directions of a first track section and a second track section are opposite, the start point of the second track section can be searched from the start point of the first track section along the direction of the first track section, and the length of the search path is greater than 0 and less than the sum of the lengths of the two track sections; or when the directions of the first track section and the second track section are opposite, the end point of the second track section can be searched from the end point of the first track section along the opposite direction of the first track section, and the length of the search path is greater than 0 and less than the sum of the lengths of the two track sections, then the two track sections conflict, and whether the two track sections conflict is accurately judged.

[0051] The method for judging conflicts between track sections provided by the application can judge whether the two track sections conflict by searching only once, greatly reduces the judgment time and the time complexity of the algorithm compared with the prior art which needs to search twice at best and four times at worst to judge whether the two track sections conflict, and the algorithm has more advantages in the rail transit industry which has high requirements on timeliness.

[0052] The method for judging conflicts between track sections provided by the application is not only used for judging conflicts of the moving authorization crossing area of the garage door management subsystem of the train full-automatic driving system, but also can be used for judging whether two track sections of other rail transit types conflict, and has strong universality. BRIEF DESCRIPTION OF DRAWINGS

[0053] Figure 1 The flowchart of the method for judging conflicts between track sections of the application;

[0054] Figure 2 The schematic diagram of the line and the garage of the application;

[0055] Figure 3 The application scenario 1 of the application;

[0056] Figure 4 The application scenario 2 of the application. DETAILED DESCRIPTION

[0057] The concept, specific structure and generated technical effects of the application will be described clearly and completely in combination with the embodiments and the drawings, so that the purpose, features and effects of the application can be fully understood.

[0058] A method for judging conflicts between track sections, comprising:

[0059] When the directions of a first track section and a second track section are opposite, the start point of the second track section can be searched from the start point of the first track section along the direction of the first track section, and the length of the search path is greater than 0 and less than the sum of the lengths of the two track sections, then the first track section and the second track section conflict;

[0060] Or, when the first track section and the second track section are opposite in direction, the first track section can search the end of the second track section from the end of the first track section in the opposite direction, and the search path length is greater than 0 and less than the sum of the lengths of the two track sections, then the first track section and the second track section conflict.

[0061] As shown in the method for judging the conflict between track sections, the method specifically comprises the following steps: Figure 1

[0062] S1, selecting a first track section and a second track section;

[0063] In the S1 step, the first track section is a mobile authorization crossing section in a mobile authorization crossing chain associated with a garage door management subsystem of a train full-automatic driving system.

[0064] In the embodiment, the above method for judging the conflict between track sections can be used in the garage door management subsystem of the train full-automatic driving system. When the garage door is authorized to be closed, the mobile authorization crossing area (first track section) of the mobile authorization crossing chain associated with the garage door is set to a restricted state. Meanwhile, if there is a mobile authorization crossing area (second track section) in the mobile authorization crossing chain associated with the garage door, which has intersection with the mobile authorization crossing area (first track section) and opposite authorization direction, the mobile authorization crossing chain conflicts with the mobile authorization crossing area (second track section), and the mobile authorization crossing area (second track section) in conflict also needs to be set to a restricted state, so as to prevent the mobile authorization crossing area from being occupied and cause unpredictable risks. The purpose of the present application is to automatically judge whether the first track section and the second track section conflict and take corresponding measures.

[0065] S2, judging whether the first track section and the second track section are opposite in direction, if yes, entering the next step, if not, the first track section and the second track section do not conflict;

[0066] In the embodiment, for the first track section and the second track section, only when the trains running on the track sections are opposite in direction, the train running conflict will occur, so it is necessary to first judge the directions of the first track section and the second track section. If the directions are the same, the two track sections do not conflict, and if the directions are opposite, the next step is further judged to see whether the two track sections conflict.

[0067] In the S2 step, the directions of the first track section and the second track section are judged through a line map.

[0068] S3, calculating the sum of the lengths of the first track section and the second track section;

[0069] ​In the embodiment, the sum of the lengths of the two track sections is calculated to facilitate comparison with the search path length. If the search path length is between 0 and the sum of the lengths of the two track sections, it indicates that the first track section and the second track section may conflict, and further judgment is needed. If the search path length is not between 0 and the sum of the lengths of the two track sections, it indicates that the first track section and the second track section do not conflict.

[0070] S4, searching for the start point of the second track section from the start point of the first track section in the direction of the first track section and recording the search path length, or searching for the end point of the second track section from the end point of the first track section in the opposite direction of the first track section and recording the search path length.

[0071] In the embodiment, the start point or the end point of the second track section is searched from the start point or the end point of the first track section, and the search path length is recorded to facilitate subsequent judgment of whether the first track section and the second track section conflict.

[0072] S5, judging whether the search path length is greater than 0 and less than the sum of the lengths of the two track sections. If yes, the next step is entered. If no, the first track section and the second track section do not conflict.

[0073] S6, judging whether the start point of the first track section is searched in the search path of the start point of the second track section, or judging whether the end point of the first track section is searched in the search path of the end point of the second track section. If yes, the first track section and the second track section conflict. If no, the next step is entered.

[0074] In the S6 step, when the first track section and the second track section conflict, the second track section is a mobile authorization crossing section in the garage door management subsystem of the train full-automatic driving system, which has intersection with the first track section and opposite authorization direction.

[0075] In the S6 step, when the first track section and the second track section conflict and the garage door of the garage door management subsystem of the train full-automatic driving system is closed, the first track section and the second track section are both set to the restricted state.

[0076] In the embodiment, when the garage door is authorized to be closed, the mobile authorization crossing section (the first track section) associated with the mobile authorization crossing chain is set to the restricted state, and the mobile authorization crossing section (the second track section) in the mobile authorization crossing chain associated with the garage door, which has intersection with the mobile authorization crossing section and opposite authorization direction, is also set to the restricted state, to prevent the mobile authorization crossing section from being occupied and causing unpredictable risks.

[0077] S7, judging whether the track end is searched. If no, the search is continued and the S5 step is returned. If yes, the first track section and the second track section do not conflict.

[0078] In the S2, S5 and S7 steps, when the first track section and the second track section do not conflict, the garage door of the train full-automatic driving system garage door management subsystem is closed, the first track section is set to the restricted state, and the second track section is not set to the restricted state.

[0079] The track section conflict judgment method of the embodiment has two search track section conflict judgment methods:

[0080] Method one: the first track section can search to the start point of the second track section from the start point along the direction of the section, and the search path length is greater than 0 and less than the sum of the lengths of the two track sections.

[0081] Method two: the first track section can search to the end point of the second track section from the end point along the reverse direction of the section, and the search path length is greater than 0 and less than the sum of the lengths of the two track sections.

[0082] In the above two search track section conflict judgment methods, each search track section conflict judgment method includes a search method, that is, method one searches from the start point of the first track section along the direction of the section, and method two searches from the end point of the first track section along the reverse direction of the section.

[0083] Figure 3 And Figure 4 In the above two search track section conflict judgment methods, each search track section conflict judgment method includes a search method, that is, method one searches from the start point of the first track section along the direction of the section, and method two searches from the end point of the first track section along the reverse direction of the section.

[0084] As shown in Figure 3 , method one is used to search and judge the scene: search to the left from the start point Bgn1 of the first track section to the start point Bgn2 of the second track section, and the search path length is greater than 0 and less than the sum of the lengths of the two track sections, so the first track section and the second track section conflict.

[0085] As shown in Figure 3 , method two is used to search and judge the scene: search to the right from the end point End1 of the first track section to the end point End2 of the second track section, and the search path length is greater than 0 and less than the sum of the lengths of the two track sections, so the first track section and the second track section conflict.

[0086] As shown in Figure 4 , method one is used to search and judge the scene: search to the left from the start point Bgn1 of the first track section to the start point Bgn2 of the second track section, and the search path length is greater than 0 and less than the sum of the lengths of the two track sections, so the first track section and the second track section conflict.

[0087] As shown in Figure 4As shown, the method two is used to search and judge the scene: searching from the end point End1 of the first track section to the right, the end point End2 of the second track section is searched, the search path length is greater than 0 and less than the sum of the lengths of the two track sections, so the first track section and the second track section conflict.

[0088] Therefore, here for any (best or worst) case, one of the two methods is used to judge (both method one and method two can judge whether there is a conflict, and the results are the same), so only one search is needed to judge whether there is a conflict.

[0089] The embodiment only needs one search to judge whether there is a conflict, which greatly reduces the judgment time and reduces the time complexity of the algorithm compared with the prior art which needs to perform 2 searches in the best case and 4 searches in the worst case to judge whether two track sections conflict, so the algorithm has more advantages in the rail transit industry which has high time efficiency requirements.

[0090] The embodiments of the application are specifically described above, but the application is not limited to the embodiments, and those skilled in the art can make various equivalent modifications or replacements without departing from the spirit of the application, and these equivalent modifications or replacements are all included in the scope defined by the claims of the application.

Claims

1. A method of judging a conflict between track sections, characterized by, The application relates to a method for judging the conflict between track sections. When the directions of the first track section and the second track section are opposite, the start point of the second track section can be searched from the start point of the first track section along the direction of the first track section, and the length of the searching path is greater than 0 and smaller than the sum of the lengths of the two track sections, so that the first track section and the second track section conflict. When the directions of the first track section and the second track section are opposite, the end point of the second track section can be searched from the end point of the first track section along the reverse direction of the first track section, and the length of the searching path is greater than 0 and smaller than the sum of the lengths of the two track sections, so that the first track section and the second track section conflict. The method comprises the following steps: S1, selecting a first track section and a second track section; In the S1 step, the first track section is a mobile authorization crossing section in a mobile authorization crossing chain associated with a garage door management subsystem of a train full-automatic driving system. S2, judging whether the directions of the first track section and the second track section are opposite, if yes, the next step is entered. S3, calculating the sum of the lengths of the first track section and the second track section. S4, searching the start point of the second track section from the start point of the first track section along the direction of the first track section and recording the length of the searching path, or searching the end point of the second track section from the end point of the first track section along the reverse direction of the first track section and recording the length of the searching path. S5, judging whether the length of the searching path is greater than 0 and smaller than the sum of the lengths of the two track sections, if yes, the next step is entered. S6, judging whether the start point of the second track section is searched in the searching path of the start point of the first track section, or judging whether the end point of the second track section is searched in the searching path of the end point of the first track section, if yes, the first track section and the second track section conflict. In the S6 step, when the first track section and the second track section conflict, the second track section is a mobile authorization crossing section in the garage door management subsystem of the train full-automatic driving system, which has intersection with the first track section and opposite authorization direction. In the S6 step, when the first track section and the second track section conflict and the garage door of the garage door management subsystem of the train full-automatic driving system is closed, the first track section and the second track section are both set as the limited state.

2. The method of claim 1, wherein, In the S6 step, when the start point or the end point of the second track section is not searched, the following step S7 is further included: S7, judging whether the track end is searched, if no, the searching is continued and the S5 step is returned, if yes, the first track section and the second track section do not conflict.

3. The method of claim 1, wherein, In the S2 step, if the directions of the first track section and the second track section are not opposite, the first track section and the second track section do not conflict.

4. The method of claim 1, wherein, In the S5 step, if the length of the searching path is not in the interval of greater than 0 and smaller than the sum of the lengths of the two track sections, the first track section and the second track section do not conflict.

5. The method of claim 1, wherein, In the S2 step, the directions of the first track section and the second track section are judged through a line map.

6. The method of claim 1, wherein, When the first track section and the second track section do not conflict and the garage door of the garage door management subsystem of the train full-automatic driving system is closed, the first track section is set as the limited state, and the second track section is not set as the limited state.

Images