Calculation method and device for track deadlock area and medium

Abstract

The invention relates to a calculation method and device for a rail deadlock area and a medium. The method comprises the following steps that S1, turnout information and section information of a current area and initially recorded turnout deadlock area information are input; s2, accurately calculating a starting point and an ending point of a turnout deadlock area corresponding to the turnout according to the information input in the step S1; s3, traversing all turnouts in the current area, and calculating sections included in the deadlock area according to the starting point and the ending point of the deadlock area of the turnouts calculated in the step S2; and S4, outputting section information contained in the deadlock region. Compared with the prior art, the method has the advantages that traversal of invalid sections is reduced, and the efficiency of calculating the sections included in the turnout deadlock area is improved.

Description

Technical Field

[0001] This invention relates to rail transit signaling systems, and more particularly to a method, device, and medium for calculating track deadlock zones. Background Technology

[0002] In urban rail transit, a track deadlock zone generally refers to a physical or logical restricted area where a turnout cannot be unlocked or switched through normal operation under a specific state.

[0003] The formation of track deadlock zones is typically related to the route locking status, mechanical locking devices, and interlocking system limitations. Deadlock zones usually occur in sections occupied by trains, during manual locking operations, or due to equipment malfunctions. Track deadlocks increase operational safety risks, reduce transport efficiency, restrict speed limits and throughput capacity, and ultimately impact the safety and efficiency of railway transportation.

[0004] Due to limitations in data volume and the computational efficiency of the control system, if the method of calculating deadlock areas in real time using equipment on the train or beside the track is adopted, the system operation cycle will be greatly increased, which will not meet safety and operational requirements.

[0005] A search of Chinese Patent Publication No. CN116238566A reveals a method for automatically generating turnout protection sections, relating to the field of turnout generation technology in rail transit. The method includes the following steps: S1, configuring the data structure of the turnout table; S2, configuring the fuzzy distance of the secondary detection equipment characteristic table, the distance between the second axle and the front section of the train in the train characteristic table, and the distance between the train head and the front section; S3, configuring the minimum locking distance between the turnout's rear positioning direction and the turnout tip, and the minimum locking distance between the turnout's rear reverse direction and the turnout tip; S4, configuring the minimum locking distance between the turnout's front positioning direction and the turnout tip; S5, configuring the data structure of each turnout zone in the COE turnout zone table; S6, generating the turnout's encroachment zone front search distance; S7, generating the track section list of the deadlock area and the track section list of the encroachment zone. This existing patent automatically finds the protection zone for each turnout, but it does not solve the problem of calculating the track deadlock area in the prior art.

[0006] Therefore, in the process of calculating track deadlock areas, how to remove sections that do not need to be checked in advance, so as to further improve operational efficiency and reduce resource waste, has become a technical problem that needs to be solved. Summary of the Invention

[0007] The purpose of this invention is to overcome the defects of the prior art by providing a method, device and medium for calculating track deadlock regions.

[0008] The objective of this invention can be achieved through the following technical solutions: According to a first aspect of the present invention, a method for calculating a track deadlock region is provided, the method comprising the following steps: Step S1: Input the turnout information and section information of the current area, as well as the initially recorded turnout deadlock area information; Step S2: Accurately calculate the start and end points of the deadlock zone corresponding to the turnout based on the information input in step S1; Step S3: Traverse all switches in the current area and calculate the segments included in the deadlock area based on the start and end points of the deadlock area calculated in step S2. Step S4: Output the segment information contained in the deadlock region.

[0009] As a preferred technical solution, the turnout information in step S1 includes all turnouts in the entire area.

[0010] As a preferred technical solution, the section information in step S1 includes all section numbers of the current area, and information on adjacent sections and turnouts in the upstream and downstream directions of the section.

[0011] As a preferred technical solution, the turnout deadlock area information initially recorded in step S1 includes the corresponding turnout name, the section number and position information of the start and end points of the corresponding turnout deadlock area, and the correspondence information between the deadlock area and the turnout.

[0012] As a preferred technical solution, step S2 specifically includes: Step S201: Determine whether the start position bgnPos and end position endPos in the initially recorded turnout deadlock area information are valid. If they are, proceed to step S202; otherwise, report an error. Step S202: Obtain turnout information and section information for the current area, and obtain the starting position bgnPos and ending position endPos information of the deadlock area corresponding to the current turnout; Step S203: Starting from the deadlock region starting position bgnPos, search along the UP direction, traverse the sections according to the section information and turnout information, and save the traversed sections. Step S204: Determine whether the end position endPos of the deadlock region has been found. If yes, proceed to step S208; otherwise, proceed to step S205. Step S205: Clear the saved segment information. Step S206: Starting from the starting position bgnPos of the deadlock region, search along the DOWN direction, traverse the sections according to the section information and turnout information, and save the traversed sections. Step S207: Determine whether the end position endPos of the deadlock region has been found. If yes, proceed to step S208; otherwise, report an error. Step S208: Obtain the starting position bgnPos and the ending position endPos of the final turnout deadlock area, and remove the segments with a length of 0 from the saved segments.

[0013] As a preferred technical solution, in step S2, all turnout information in the current area is traversed, and the correspondence information between turnouts and turnout deadlock areas is obtained in the turnout deadlock area information, as well as the section number and position information of the start and end points of the turnout deadlock area.

[0014] As a preferred technical solution, the matching relationship between the turnout and the start and end points of the corresponding deadlock area is obtained based on the obtained correspondence information between the turnout and the turnout deadlock area, as well as the section number and position information of the start and end points of the turnout deadlock area.

[0015] As a preferred technical solution, step S3 specifically includes: Step S301: Traverse the turnout information of the current area; Step S302: Obtain the start and end positions of the deadlock region corresponding to each turnout; Step S303: Based on the start and end positions of the deadlock area corresponding to each turnout and the turnout queue, traverse the section information of the current area to obtain the section information contained in the deadlock area of ​​the turnout. Step S303: Store all obtained section information in a unified manner to obtain the turnout deadlock area of ​​the current region.

[0016] According to a second aspect of the present invention, an electronic device is provided, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the program to implement the method described thereon.

[0017] According to a third aspect of the present invention, a computer-readable storage medium is provided having a computer program stored thereon, which, when executed by a processor, implements the method described thereon.

[0018] Compared with the prior art, the present invention has the following advantages: 1) This invention uses a memory method to record the start and end points of the turnout deadlock area, which reduces the traversal of invalid sections and improves the efficiency of calculating the sections included in the turnout deadlock area. 2) This invention further improves operational efficiency and reduces resource waste by removing sections that do not need to be inspected in advance; 3) This invention can be implemented through computer software coding, which greatly improves efficiency compared to manually creating data. Attached Figure Description

[0019] Figure 1This is a flowchart illustrating the specific process of the method of the present invention; Figure 2 This is a flowchart illustrating the specific process for calculating the start and end points of the deadlock zone corresponding to the turnout in this invention. Figure 3 This is a flowchart illustrating the specific process of calculating the segments included in the deadlock region according to the present invention. Figure 4 This is a schematic diagram of the track section connection in a specific embodiment of the present invention. Detailed Implementation

[0020] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some, not all, of the embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort should fall within the scope of protection of the present invention.

[0021] like Figure 1 As shown, the present invention provides a method for calculating track deadlock regions, the method comprising the following steps: Step S1: Input the turnout information and section information of the current area, as well as the initially recorded turnout deadlock area information; Step S2: Accurately calculate the start and end points of the deadlock zone corresponding to the turnout based on the information input in step S1; Step S3: Traverse all switches in the current area and calculate the segments included in the deadlock area based on the start and end points of the deadlock area calculated in step S2. Step S4: Output the segment information contained in the deadlock region.

[0022] As a preferred implementation method, the turnout information in step S1 includes all turnouts in the entire area, the section information in step S1 includes all section numbers in the current area, the section and turnout information adjacent to each other in the upstream and downstream directions, and the turnout deadlock area information initially recorded in step S1 includes the corresponding turnout name, the section number and position information of the start and end points of the corresponding turnout deadlock area, and the correspondence information between the deadlock area and the turnout.

[0023] like Figure 2 As shown, step S2 specifically includes: Step S201: Determine whether the start position bgnPos and end position endPos in the initially recorded turnout deadlock area information are valid. If they are, proceed to step S202; otherwise, report an error. Step S202: Obtain turnout information and section information for the current area, and obtain the starting position bgnPos and ending position endPos information of the deadlock area corresponding to the current turnout; Step S203: Starting from the deadlock region starting position bgnPos, search along the UP direction, traverse the sections according to the section information and turnout information, and save the traversed sections. Step S204: Determine whether the end position endPos of the deadlock region has been found. If yes, proceed to step S208; otherwise, proceed to step S205. Step S205: Clear the saved segment information. Step S206: Starting from the starting position bgnPos of the deadlock region, search along the DOWN direction, traverse the sections according to the section information and turnout information, and save the traversed sections. Step S207: Determine whether the end position endPos of the deadlock region has been found. If yes, proceed to step S208; otherwise, report an error. Step S208: Obtain the starting position bgnPos and the ending position endPos of the final turnout deadlock area, and remove the segments with a length of 0 from the saved segments.

[0024] In a preferred embodiment, step S2 involves traversing all turnout information in the current region, obtaining the correspondence information between turnouts and turnout deadlock regions, as well as the segment numbers and positions of the start and end points of the turnout deadlock regions within those segments. Based on the obtained correspondence information between turnouts and turnout deadlock regions, and the segment numbers and positions of the start and end points of the turnout deadlock regions within those segments, the matching relationship between the turnouts and the start and end points of the corresponding deadlock regions is obtained.

[0025] like Figure 3 As shown, step S3 specifically includes: Step S301: Traverse the turnout information of the current area; Step S302: Obtain the start and end positions of the deadlock region corresponding to each turnout; Step S303: Based on the start and end positions of the deadlock area corresponding to each turnout and the turnout queue, traverse the section information of the current area to obtain the section information contained in the deadlock area of ​​the turnout. Step S303: Store all obtained section information in a unified manner to obtain the turnout deadlock area of ​​the current region.

[0026] This invention uses a memory method (i.e., using initial records to narrow down the traversal range) to record the start and end points of the turnout deadlock region, reducing the traversal of invalid sections and improving the efficiency of calculating the sections included in the turnout deadlock region. Specific Implementation like Figure 4 As shown, the specific implementation process of the method of the present invention is as follows: Step S1: Input the turnout information and section information of the current area, and the turnout deadlock area information; The input turnout information, section information, and turnout deadlock area information are shown in Table 1, Table 2, and Table 3, respectively.

[0028] Table 1 Table 2 Table 3 Step S2: Calculate the start and end points of the deadlock zone corresponding to the turnout; Based on the turnout information and section information in Tables 1, 2, and 3, and the turnout deadlock area information, the start and end points of the turnout deadlock area corresponding to the turnout are obtained, as shown in Table 4. Table 4 Step S3: Traverse all switches in the region, and calculate the segments included in the deadlock region based on the start and end points of the deadlock region corresponding to the switches, as shown in Table 5. Table 5 Step S4: Output the section information of the deadlock area corresponding to all switches; The train formation unit information generated in step S3 is integrated, and the section information of the deadlock area corresponding to all turnouts is output. The results are shown in Table 6.

[0029] Table 6 The above is an introduction to the method embodiments. The following embodiments using electronic devices and storage media will further illustrate the solution of the present invention.

[0030] This invention also provides an electronic device including a central processing unit (CPU), which can perform various appropriate actions and processes according to computer program instructions stored in a read-only memory (ROM) or loaded from a storage unit into a random access memory (RAM). The RAM may also store various programs and data required for device operation. The CPU, ROM, and RAM are interconnected via a bus. Input / output (I / O) interfaces are also connected to the bus.

[0031] Multiple components in the device are connected to the I / O interface, including: input units such as keyboards and mice; output units such as various types of displays and speakers; storage units such as disks and optical discs; and communication units such as network interface cards (NICs), modems, and wireless transceivers. The communication unit allows the device to exchange information / data with other devices through computer networks such as the Internet and / or various telecommunications networks.

[0032] The processing unit performs the various methods and processes described above, such as the methods of the present invention. For example, in some embodiments, the methods of the present invention may be implemented as computer software programs tangibly contained in a machine-readable medium, such as a storage unit. In some embodiments, part or all of the computer program may be loaded and / or installed on the device via ROM and / or a communication unit. When the computer program is loaded into RAM and executed by the CPU, one or more steps of the methods of the present invention described above may be performed. Alternatively, in other embodiments, the CPU may be configured to execute the methods of the present invention by any other suitable means (e.g., by means of firmware).

[0033] The functions described above in this document can be performed, at least in part, by one or more hardware logic components. For example, exemplary types of hardware logic components that can be used, without limitation, include: Field Programmable Gate Arrays (FPGAs), Application-Specific Integrated Circuits (ASICs), Application Standard Products (ASSPs), System-on-Chip (SoCs), Complex Programmable Logic Devices (CPLDs), and so on.

[0034] The program code used to implement the methods of the present invention can be written in any combination of one or more programming languages. This program code can be provided to a processor or controller of a general-purpose computer, special-purpose computer, or other programmable data processing device, such that when executed by the processor or controller, the program code causes the functions / operations specified in the flowcharts and / or block diagrams to be implemented. The program code can be executed entirely on the machine, partially on the machine, as a standalone software package partially on the machine and partially on a remote machine, or entirely on a remote machine or server.

[0035] In the context of this invention, a machine-readable medium can be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, apparatus, or device. A machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium. Machine-readable media can include, but are not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination of the foregoing. More specific examples of machine-readable storage media include electrical connections based on one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fibers, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.

[0036] The above description is merely a specific embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any person skilled in the art can easily conceive of various equivalent modifications or substitutions within the technical scope disclosed in the present invention, and these modifications or substitutions should all be covered within the scope of protection of the present invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims.

Claims

1. A method for calculating track deadlock regions, characterized in that, The method includes the following steps: Step S1: Input the turnout information and section information of the current area, as well as the initially recorded turnout deadlock area information; Step S2: Accurately calculate the start and end points of the deadlock zone corresponding to the turnout based on the information input in step S1; Step S3: Traverse all switches in the current area and calculate the segments included in the deadlock area based on the start and end points of the deadlock area calculated in step S2. Step S4: Output the segment information contained in the deadlock region.

2. The method for calculating a track deadlock region according to claim 1, characterized in that, The turnout information in step S1 includes all turnouts in the entire area.

3. The method for calculating a track deadlock region according to claim 1, characterized in that, The section information in step S1 includes all section numbers in the current area, and information on adjacent sections and turnouts in the upstream and downstream directions of the section.

4. The method for calculating a track deadlock region according to claim 1, characterized in that, The initial record of the turnout deadlock area information in step S1 includes the corresponding turnout name, the section number and position information of the start and end points of the turnout deadlock area, and the correspondence information between the deadlock area and the turnout.

5. The method for calculating a track deadlock region according to claim 1, characterized in that, Step S2 specifically includes: Step S201: Determine whether the start position bgnPos and end position endPos in the initially recorded turnout deadlock area information are valid. If they are, proceed to step S202; otherwise, report an error. Step S202: Obtain turnout information and section information for the current area, and obtain the starting position bgnPos and ending position endPos information of the deadlock area corresponding to the current turnout; Step S203: Starting from the deadlock region starting position bgnPos, search along the UP direction, traverse the sections according to the section information and turnout information, and save the traversed sections. Step S204: Determine whether the end position endPos of the deadlock region has been found. If yes, proceed to step S208; otherwise, proceed to step S205. Step S205: Clear the saved segment information. Step S206: Starting from the starting position bgnPos of the deadlock region, search along the DOWN direction, traverse the sections according to the section information and turnout information, and save the traversed sections. Step S207: Determine whether the end position endPos of the deadlock region has been found. If yes, proceed to step S208; otherwise, report an error. Step S208: Obtain the starting position bgnPos and the ending position endPos of the final turnout deadlock area, and remove the segments with a length of 0 from the saved segments.

6. The method for calculating a track deadlock region according to claim 1, characterized in that, In step S2, all turnout information in the current area is traversed, and the correspondence information between turnouts and turnout deadlock areas is obtained in the turnout deadlock area information, as well as the section number and position information of the start and end points of the turnout deadlock area.

7. The method for calculating a track deadlock region according to claim 6, characterized in that, Based on the obtained correspondence information between turnouts and turnout deadlock areas, as well as the section numbers and positions of the start and end points of the turnout deadlock areas, the matching relationship between turnouts and the start and end points of the corresponding deadlock areas is obtained.

8. The method for calculating a track deadlock region according to claim 1, characterized in that, Step S3 specifically involves: Step S301: Traverse the turnout information of the current area; Step S302: Obtain the start and end positions of the deadlock region corresponding to each turnout; Step S303: Based on the start and end positions of the deadlock area corresponding to each turnout and the turnout queue, traverse the section information of the current area to obtain the section information contained in the deadlock area of ​​the turnout. Step S303: Store all obtained section information in a unified manner to obtain the turnout deadlock area of ​​the current region.

9. An electronic device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that, When the processor executes the program, it implements the method as described in any one of claims 1 to 8.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the program is executed by the processor, it implements the method as described in any one of claims 1 to 8.

Images