Management method and device for named access and anonymous access, and medium

Abstract

The invention relates to a named route and anonymous route management method and device and a medium, and the method comprises the steps: dividing a train route into a named route and an anonymous route, and enabling the named route and the anonymous route to be converted; after the RMU establishes a named access and completes locking, whether the named access meets a set'named matching 'condition or not is judged, if yes, an open signal is opened, and if not, the open signal is closed; and the anonymous access or the named access meeting the named matching condition is normally unlocked after the train is driven in. Compared with the prior art, the method has the advantages that the situation that the train walks on the wrong road in front of the branch road is avoided, and the operation problem that the road is on is solved.

Description

Technical Field

[0001] This invention relates to rail transit signaling systems, and more particularly to a method, device, and medium for managing named and anonymous routes. Background Technology

[0002] In Communication Based Train Control (CBTC), the Computer Based Interlocking System (CI) designates a travel path for trains by establishing routes and provides protection against dangerous scenarios such as switch movement and collisions with other trains. The Automatic Train Supervisor (ATS) triggers a processing command for the route, which is then executed by the interlocking system.

[0003] Currently, when CI executes route handling orders, it does not know which train the route is intended for. Therefore, there is a possibility that the wrong train may enter the route. Although this will not cause a dangerous situation, it may cause the train to take the wrong path and cause an operational accident.

[0004] A search revealed a Chinese patent publication number CN108263446A that discloses a method for managing train routes in rail transit. Specifically, it discloses a method for managing train entry into stations, which is divided into single-track entry and branch line entry. At branch lines, to prevent collisions between high-speed trains, the two sections after the branch line are sorted according to their planned arrival time, ensuring that the first arriving train can enter while subsequent trains cannot. Real-time sorting is no longer implemented; each train must travel according to the plan. Even if there are speed deviations, this rule cannot be broken. This avoids the problem of branch line trains speeding too fast to overtake planned trains, causing competition for sections and affecting the entire train schedule. Signals are installed in both single-track entry and the second section after the branch line. When the train head passes the signal, the data is reset, and subsequent trains are re-sorted, greatly improving the efficiency of entering and passing through stations.

[0005] However, the existing patent does not specify which trains can enter the route, which means that there is still a problem of trains taking the wrong route. Therefore, preventing trains from taking the wrong route before the fork in the road and solving the operational problem of "who the road is for" has become a technical problem that needs to be solved. Summary of the Invention

[0006] The purpose of this invention is to overcome the deficiencies of the prior art by providing a method, device, and medium for managing named and anonymous routes.

[0007] 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 managing named routes and anonymous routes is provided, the method comprising: Train routes are divided into named routes and anonymous routes, and the two can be switched. After the Resource Manager RMU establishes and locks a named path, it checks whether the named path meets the set "named matching" condition. If it does, it opens the open signal; otherwise, it closes the open signal. The anonymous route or the named route that meets the "named matching" condition will be unlocked normally after the train enters.

[0008] As a preferred technical solution, the named route includes a train route applied for by the ATS to the RMU in the form of a designated train ID, and a communication train applying to the RMU for the train route ahead of it.

[0009] As a preferred technical solution, the anonymous route is a train route that ATS applies for from RMU without specifying a train ID.

[0010] As a preferred technical solution, for an anonymous route that has been established and locked, the ATS binds a train ID to the anonymous route through a "route naming request", thereby converting the anonymous route into a named route.

[0011] As a preferred technical solution, for a named route that has been established and locked, the ATS changes the bound train ID of the named route through a "name change request". If the changed train ID is zero, the named route is converted into an anonymous route.

[0012] As a preferred technical solution, satisfying the "named matching" condition specifically means that the train ID bound to the named route is valid, and the corresponding train has communicated with the RMU and is the first approaching train.

[0013] As a preferred technical solution, the first approaching train is: the train is located upstream of the route start signal and is the car closest to the route start.

[0014] As a preferred technical solution, the following conditions are not met: there is no train upstream of the route start signal, or the first approaching train and the bound train ID do not match, or there is only a non-communication car upstream of the route start.

[0015] As a preferred technical solution, for non-communication vehicles after the fault reduction, the named route is converted into an anonymous route, and the open signal on the route is turned on, so that the non-communication vehicles can smoothly enter the route.

[0016] As a preferred technical solution, for named routes that do not meet the "named route matching" condition, the RMU keeps the route locked and sends a "named route mismatch" alarm to the ATS.

[0017] 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.

[0018] 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.

[0019] Compared with the prior art, the present invention has the following advantages: 1) This invention utilizes the more powerful information processing and computing capabilities of the RMU to name train routes, that is, to designate trains that can enter the route, thereby avoiding the problem of trains taking the wrong route and increasing the availability of the system. 2) The named route of this invention gives the route an identity identifier, which can prevent the train from taking the wrong route before the branching point and solve the operational problem of "who the route is for"; 3) The named route of this invention makes the schedule scheduling more precise and better matched with the operation tasks of each train, thus preparing the conditions for the informatization and intelligentization of operation; 4) When a train mismatch event occurs on a named route, this invention will generate an alarm, which helps operators to discover and resolve problems more quickly. Attached Figure Description

[0020] Figure 1 This is a detailed flowchart of Embodiment 1 of the present invention; Figure 2 This is a schematic diagram of a named route with no upstream vehicles in Embodiment 2 of the present invention; Figure 3 This is a schematic diagram illustrating the name mismatch of vehicle 1 in Embodiment 2 of the present invention; Figure 4 This is a schematic diagram of vehicle 1 name matching in Embodiment 2 of the present invention; Figure 5 This is a schematic diagram of a name change request according to Embodiment 2 of the present invention; Figure 6 This is a schematic diagram illustrating the downgrading of the upstream communication vehicle on the named route in Embodiment 3 of the present invention; Figure 7 This is a schematic diagram illustrating the transformation of a named path into an anonymous path in Embodiment 3 of the present invention. Detailed Implementation

[0021] 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.

[0022] Example 1 By replacing CI with a Resource Management Unit (RMU), this invention can leverage the more powerful information processing and computing capabilities of the RMU to name routes, that is, to assign trains that can enter a route, thereby avoiding the problem of trains taking the wrong route and increasing the availability of the system.

[0023] like Figure 1 As shown, a method for managing named and anonymous routes specifically includes: Step A: When an ATS requests a route from the RMU with a specified train ID, or when a communication train requests a route ahead of it from the RMU, this is called a "named route request," and the request is bound to the train ID. When an ATS requests a route from the RMU without specifying a train ID, this is called an "anonymous route request," and the request is not bound to the train ID.

[0024] Step B: For an anonymous route that has been established and locked, ATS can bind a train ID to the route through a "route naming request", and the route will then become a named route.

[0025] Step C: For a named route that has been established and locked, ATS can use a "name change request" to change the bound train ID of the route. If the changed train ID is zero, the route becomes an anonymous route.

[0026] Step D: After the RMU establishes and locks the named route, it performs an additional check on the bound train information before opening the signal. If the bound train ID is valid, and the corresponding train has already communicated with the RMU and is the first approaching train (the train is located upstream of the route's starting signal and is the closest car to the route's starting point), then the RMU considers the route to meet the "named matching" condition and can open the signal. Otherwise, if there is no train upstream of the route's starting signal, or the first approaching train does not match the bound train ID, or there are only non-communication cars upstream of the route's starting point, then the RMU considers the route not to meet the "named matching" condition and cannot open the signal.

[0027] Step E: Only anonymous routes or named routes that meet the "named route matching" condition can be unlocked normally after the train enters; otherwise, the RMU will keep the route locked and provide the ATS with a "named route mismatch" alarm.

[0028] Example 2 ATS receives two trains entering the station in succession, such as Figures 2 to 5 As shown; like Figure 2 Suppose the ATS needs to receive two trains consecutively entering the station, with train 1 heading towards S2 and train 2 heading towards S1. According to the plan, train 2 should arrive first. Therefore, the ATS instructs the RMU to establish a named route S0-S1, binding the train ID to 2. Since neither train has arrived yet (i.e., there is no train upstream on the route), the RMU will not open signal S0.

[0029] like Figure 3 Train 2 was delayed and actually arrived later than Train 1. At this point, Train 1 became the first approaching train on route S0-S1. Because the named matching condition was not met, the RMU still would not open signal S0 and would send an alarm to the ATS. The dispatcher quickly realized that Train 1 had been given the wrong route because he found that Train 1 had stopped in front of signal S0 and the ATS had issued an alarm.

[0030] like Figure 4 The dispatcher manually canceled the incorrectly assigned route S0-S1 and then reassigned the named route S0-S2 to car 1 via ATS. At this point, car 1 became the first approaching train on route S0-S2, meeting the naming matching conditions. Therefore, RMU opened signal S0, and car 1 successfully headed towards S2, avoiding taking the wrong route.

[0031] like Figure 5 If the ATS subsequently binds the wrong train ID when processing route S0-S1 for car 2, the RMU will not open signal S0 due to the name mismatch and will issue an alarm to the ATS. The dispatcher then issues a name change request through the ATS to change the train ID bound to route S0-S1 from 1 to 2. The RMU can then open signal S0 because of the name match, allowing car 2 to proceed smoothly towards S1.

[0032] Example 3 A train on a designated route experienced a malfunction and was downgraded before being taken over. Figures 6 to 7 As shown; like Figure 6The ATS had already registered a named route S0-S1 for Car 1, and Car 1 was the first approaching train on this route. The RMU had already opened signal S0. However, Car 1 subsequently lost communication with the RMU due to a malfunction. At this time, there were only non-communication cars upstream on the route. The RMU believed that the route no longer met the named matching conditions, so it closed signal S0 and sent an alarm to the ATS.

[0033] like Figure 7 After the dispatcher discovered the degraded status of car 1 due to a malfunction, in order to allow the car to continue running, a name change request was issued through the ATS, changing the train ID bound to route S0-S1 to 0. At this point, the route became an anonymous route. The RMU no longer checked the name matching conditions, so it automatically reopened signal S0, allowing the degraded non-communication car to smoothly travel towards S1.

[0034] Example 4 The present 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 read-only memory (ROM) or loaded from a storage unit into 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.

[0035] 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.

[0036] 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).

[0037] 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.

[0038] 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.

[0039] 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.

[0040] 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 management method of named routes and anonymous routes, characterized by, The method comprises: The train route is divided into named route and anonymous route, and the named route and the anonymous route can be converted; After the resource manager RMU establishes and locks the named route, it is judged whether the named route meets the set "named matching" condition, if yes, the open signal is opened, otherwise the open signal is closed; The anonymous route or the named route meeting the "named matching" condition is normally unlocked after the train enters.

2. The method of claim 1, wherein the named route and the anonymous route are managed by a routing table. The named route includes the train route applied by the ATS to the RMU in the way of specifying train ID, and the train route applied by the communication train to the RMU in the way of specifying the train route in front of the train.

3. The method of claim 1, wherein the named route and the anonymous route are managed by a routing table. The anonymous route is the train route applied by the ATS to the RMU in the way of not specifying train ID.

4. The method of claim 1, wherein the named route and the anonymous route are managed by a routing table. For the anonymous route that has been established and locked, the ATS binds a train ID to the anonymous route through "route naming request", so that the anonymous route is converted into named route.

5. The method of claim 1, wherein the named route and the anonymous route are managed by a routing table. For the named route that has been established and locked, the ATS replaces the bound train ID of the named route through "named change request", if the replaced train ID is zero, the named route is converted into anonymous route.

6. The method of claim 1, wherein the named route and the anonymous route are managed by a routing table. The "named matching" condition is met specifically as follows: the train ID bound to the named route is valid, and the corresponding train has communicated with the RMU and is the first approaching train.

7. The method of claim 6, wherein the named route and the anonymous route are managed by a route management server. The first approaching train is the train located upstream of the route start signal and is the closest train to the route start.

8. The method of claim 1, wherein the named route and the anonymous route are managed by a routing table. The "named matching" condition is not met, including that there is no train upstream of the route start signal, or the first approaching train does not match the bound train ID, or there is only non-communication train upstream of the route start.

9. The method of claim 1, wherein the named route and the anonymous route are managed by a routing table. For the non-communication train after the fault is reduced, the open signal on the route is opened after the named route is converted into anonymous route, so that the non-communication train can smoothly enter the route.

10. The method of claim 1, wherein the named route and the anonymous route are managed by a routing table. For the named route that does not meet the "named matching" condition, the RMU keeps the lock of the route and sends "named route mismatch" alarm to the ATS.

11. An electronic device comprising a memory and a processor, said memory having stored thereon a computer program, characterized in that, The processor executes the program to realize the method of any one of claims 1-10.

12. A computer readable storage medium having stored thereon a computer program, characterized in that, The program is executed by the processor to realize the method of any one of claims 1-10.

Images