CN114212127B - Full-automatic verification method, equipment and medium for urban rail signal approaching locking section - Google Patents

Abstract

The invention relates to a full-automatic verification method for a urban rail signal approaching locking section, which comprises the following steps: step S1, reading all input files; s2, constructing a corresponding calculation unit and a function module; step S3, ALS verification calculation. Compared with the prior art, the invention has the advantages of greatly saving the workload, improving the correctness of the result and the like.

Description

Full-automatic verification method, equipment and medium for urban rail signal approaching locking section

Technical Field

The invention relates to a train signal control system, in particular to a full-automatic verification method, equipment and medium for a urban rail signal approaching locking section.

Background

The proximity locking section (Approach Locking Section, ALS) refers to a plurality of occupancy detection sections outside the train protection signaling device. During the opening of the approach signal, the train once enters the approach section constitutes an approach lock. If the route unlocking is needed to be handled, the time must be manually delayed, so that the risk brought by the train entering the signal is avoided. In the urban rail transit field, the approaching locking section is calculated according to a group of line conditions (covering the type of an interlocking area, the maximum gradient and the maximum permanent speed limit) outside each train signal machine, the section length is key data influencing driving safety, if the approaching locking section is configured to be short, if the train is actually in the approaching locking section but is erroneously judged not to be approaching locking, the approach is directly canceled, at the moment, the turnout can be operated to rotate, or maintenance personnel can be arranged to enter the rail area to execute tasks, accidents such as derailment, casualties and the like can be caused, and the hazard is huge. Therefore, the length of the close locking segment needs to be strictly calculated, and double-chain verification is assisted, so that the correct result is ensured.

Currently, manual verification methods are used to access the locking section. For any one of the route annunciators, a verifier calculates the length of a closing section according to the direction of the annunciator on a plan view and the length of the closing section calculated by a designer, adds or subtracts the length of the closing section by using an annunciator kilometer sign, and reversely calculates the kilometer sign range covered by the closing section; then, a verifier manually checks the line condition 'coverage interlocking area type, maximum gradient and maximum permanent speed limit' in the kilometer scale range, namely a verification value; and finally, judging whether the line condition corresponding to the verification value is consistent with the design value, and indirectly proving that the configuration of the close locking section is correct. The current verification method needs to frequently check various equipment names, kilometer post values, gradient values of the plan, kilometer post values, speed limit values and the like in a permanent speed limit list, and the error rate of manual calculation is obviously increased along with the increase of the implementation quantity of engineering projects and the compression of design cycles. In addition, the current verification method has a certain defect, and if a designer does not firstly take a value from the most unfavorable condition of the whole line according to the requirement, but a group of conditions which are close to the annunciator are directly taken by graph trouble, the obtained length of the close locking section can be wrong, but the group of line conditions can still pass through the current verification method, and a certain safety risk exists.

Disclosure of Invention

The invention aims to overcome the defects of the prior art and provide a full-automatic verification method, equipment and medium for a urban rail signal approaching locking section.

The aim of the invention can be achieved by the following technical scheme:

according to a first aspect of the present invention, there is provided a fully automatic verification method of urban rail signal proximity locking segments, the method comprising the steps of:

step S1, reading all input files;

s2, constructing a corresponding calculation unit and a function module;

step S3, ALS verification calculation.

As a preferable technical scheme, the step S1 specifically includes:

step S11, extracting key equipment coordinates, line gradients and long and short chain information lists from the plan, and establishing a track topological structure according to the annunciator and turnout direction information;

step S12, correcting long and short chains;

step S13, creating a verification report blank table, and writing the signal direction and the ALS design value.

As a preferable technical solution, the step S12 specifically includes: and carrying out long-short chain correction processing on all coordinate values in the equipment coordinate list by using the long-short chain list.

As a preferable technical scheme, the step S2 specifically includes:

step S21, constructing an ALS calculation unit and initializing formula coefficients;

step S22, an iterative loop module is constructed, wherein the iterative loop module comprises a large loop and a small loop function, the large loop is used for traversing each annunciator in the annunciator list, and the small loop is used for carrying out iterative operation on an independent annunciator and obtaining the ALS length of the annunciator.

As a preferable technical solution, the step S21 specifically includes:

setting the Type of an ALS length range covering interlocking control area outside the annunciator as Type, setting the maximum gradient value in a plurality of gradient sections in the range as Slope, and setting the maximum permanent speed limit value in a plurality of permanent speed limit sections as PSR; the ALS calculation unit can be used for inputting any group of { Type, slope, PSR }, and returning to corresponding ALS length D_ALS

D_ALS＝F(TSP)

Wherein TSP is the abbreviation of Type, slope, PSR.

As a preferable technical solution, the input in the step S22 is a list of annunciators, and the ALS verification conclusion of each annunciator is output; the Input of the small loop is D_ALS_input and the Output is D_ALS_output.

As a preferable technical scheme, the step S3 specifically includes:

step S31, assigning annunciator information including directions and coordinates;

step S32, assigning a variable D_ALS_input;

step S33, executing a path searching module;

step S34, executing TSP query units on all the searched paths to obtain a plurality of groups { TSP };

step S35, substituting a plurality of groups of { TSP } into an ALS calculation unit, calculating a plurality of ALS lengths, and selecting the maximum value of the ALS lengths to output;

step S36, judging whether the small loop suspension condition is met, if not, substituting the current ALS value into the small loop for re-iteration; if yes, the current ALS value is the verification value;

step S37, judging whether the verification value is consistent with the design value, and giving a verification conclusion;

step S38, searching whether a next annunciator exists, if yes, returning to the large loop function for iterating again, and if not, finishing verification.

As a preferred technical solution, in step S33, the execution path searching module specifically includes:

all paths possibly going to the annunciator in the range of D_ALS_input of the annunciator are obtained, and the coordinate interval of each path is output.

According to a second aspect of the present invention there is provided an electronic device comprising a memory and a processor, the memory having stored thereon a computer program, the processor implementing the method when executing the program.

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

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

1) The invention realizes ALS verification automation for the first time, and belongs to the industry for the first time. The workload is greatly saved, and the correctness of the result is improved;

2) The invention provides a forward iterative computation verification method, which avoids the defects of the original method and ensures the safety of ALS data.

Drawings

FIG. 1 is a flow chart of the ALS verification of the present invention;

FIG. 2 is a schematic diagram of a path search module according to the present invention.

Detailed Description

The following description of the embodiments of the present invention will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are some, but not all embodiments of the invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present invention without making any inventive effort, shall fall within the scope of the present invention.

The technical scheme of the present invention will be described with reference to fig. 1 to 2. The general flow of ALS verification computation is described with respect to FIG. 1.

And step 101, reading a plan view file, extracting list information including coordinates, line gradient, long and short chains, interlocking boundaries and the like of key equipment including a signal machine, a turnout, a shaft counter and a beacon by using a Python self-contained library function, and sequencing the information list according to the order of the mileage of the coordinates from small to large. And establishing a track topological structure according to the information of the direction of the annunciator, the switch opening direction and the like.

And 102, correcting the long and short chain. Since the marked mileage of the equipment on the plan view is not the true mileage, the marked mileage is directly used for calculating and can be wrong, and long-short chain correction processing is needed. Based on the long and short chain list and the device coordinate list extracted in step 101, for each long and short chain: if the coordinate is long-chain, searching a specific device and coordinates thereof with a first coordinate value larger than the chain coordinate value in a device coordinate list, and adding a long-chain value to the specific device coordinates and all the coordinates afterwards; if it is short-chained, another specific device is also retrieved, and then the short-chained value is subtracted from the coordinates of that specific device and all coordinates that follow.

And 103, reading real-time parameters and a permanent speed limit list file. A verification report blank table is created, which contains the contents shown in table 1, wherein the A/B/C/E column is directly read from a real-time parameter file, and the D column is automatically calculated according to the method provided by the patent.

TABLE 1

Column of	Gauge outfit	Paraphrasing meaning
			A	Signal	Signaling name
B	Sig_Dir	Traffic signal direction
			C	Coord_Sys	Coordinate system of signal machine
D	D_ALS_Ver	Verification value of ALS length
			E	D_ALS_Des	Design value of ALS length

Step 104, initializing the ALS calculation unit. The Type of the ALS length range covering the interlocking control area outside the annunciator is set as Type, the maximum gradient value in a plurality of gradient sections in the range is set as Slope, and the maximum permanent speed limit value in a plurality of permanent speed limit sections is set as PSR. The ALS calculation unit may be configured to return to the corresponding ALS length d_als after inputting any one of { Type, slope, PSR } (abbreviated as { TSP }). I.e.

D_ALS＝F(TSP)

The correlation coefficient and constant of the function F (x) vary from one specific item to another, all from the real-time parameter, and each time the software is started, it has to be read once, i.e. initialized. The formula principle is as follows:

ALS length is made up of lost motion distance and braking distance. Distance of idle travel: the distance that the train uniformly runs in the idle running time, the idle running time comprises transmission delay of issuing and transmitting the trackside emergency unlocking command to the vehicle-mounted controller and occupation detection delay of the cross-pressure approaching locking section. Braking distance: the method comprises two sections of uniform acceleration and a large section of uniform deceleration distance, wherein after the vehicle-mounted controller triggers emergency braking, the train firstly cuts off traction and applies braking, and the gradient acceleration effect caused by traction acceleration and gravity exists in the process; when braking force is applied until the vehicle is full, gradient acceleration effect still exists, and the vehicle speed reaches a peak PSR and the deceleration reaches a peak value at the end of the stage; the train then continues to slow down until it comes to rest.

The air speed is equal to PSR minus the extra speed of the train traction and grade during "cut traction, apply brake". The idle time is determined by the Type, and the corresponding constant is taken for each of the two types of single interlocking control area and multi-interlocking control area. The braking initial speed is equal to the idle speed, the traction acceleration and the braking deceleration are constant, and the gradient acceleration is determined by Slope. Thus, the sum of the free distance and the braking distance, i.e., ALS length, is determined by the group variable { TSP }.

Step 105, constructing an iterative loop module including a large loop and a small loop function. The major loop refers to the loop traversing each annunciator in the annunciator list, and the minor loop refers to the iterative operation process based on the TSP algorithm on a single annunciator, and finally, the ALS length of the single annunciator is obtained. The input of the large cycle is a annunciator list, and an ALS verification conclusion of each annunciator is output; the Input of the small loop is D_ALS_input and the Output is D_ALS_output.

And 106, assigning annunciator information including directions and coordinates. The first assignment is the first signal information of the A column read in the step S103, and the subsequent traversal is performed through a large loop.

In step 107, D_ALS_input is assigned. The first assignment is the ALS length of the most unfavorable condition (longest) of the full line, followed by iterative assignment by a small loop. The most unfavorable ALS length is obtained by substituting a group { TSP } of least unfavorable of the whole line into the ALS calculation unit, and the most unfavorable { TSP } group takes the values of the multiple interlocking control region, the maximum value in the gradient list and the maximum value in the permanent speed limit list, respectively.

Step 108, execute the path search module. The path searching module may calculate all paths possibly driven to the traffic signal in the range of d_als_input outside the traffic signal based on the current "traffic signal information and d_als_input", and output the coordinate interval (coordinate system: start point to end point) of each path according to the track topology map stored in step S101. The search principle is as follows:

as shown in fig. 2, the positive line coordinate system is XK/YK, the lateral line coordinate system of the entering vehicle section is CK/DK, the coordinate increasing direction of the positive line is set from left to right (kp_inc=rt), the coordinate increasing direction of the lateral line is set to left (kp_inc=lf), and the coordinates of XK/YK are equivalent, and the coordinates of CK/DK are equivalent. The turnout W1 and the turnout W2 are single-acting turnouts, and the turnouts W3-W5, the turnout W4-W6, the turnout W7-W9 and the turnout W8-W10 are double-acting turnouts.

Assuming that the coordinates of the signal S1 are sig_kp and the direction is Rightward (RT), the ALS start point of the signal can be calculated and denoted as als_begin. First of all,

principle 1: a main path (1) co-ordinate to the traffic signal must exist. Is marked as

Route_1＝XK：[Sig_KP，ALS_Begin]

And (5) continuously searching whether other driving branches exist or not, and searching the method according to the principle 2.

Principle 2: and searching the turnout group meeting the condition that the first turnout of the turnout group is required to be positioned in the branch and the direction is opposite to the direction of the annunciator along the direction opposite to the annunciator in the path. If so, a branch exists.

Let the coordinate system of the second Switch2 of the Switch group found be MMK, and the coordinate of the mapping of als_begin to the coordinate system MMK be als_begin_mmk, the branch can be described as:

Route_M＝MMK：[Switch2，ALS_Begin_MMK]

accordingly, the switch group "W1-W4, LF" is first found in path (1) (the first switch W1 is located in branch (1), the switch group direction "LF" is opposite to the traffic signal direction "RT"), this is the second branch. The coordinate system of the branch (2) is CK, the starting point is the second turnout W4, the end point is ALS_Begin and is mapped to the coordinate ALS_Begin_CK of the coordinate system CK of the W4, and the coordinate system CK can be recorded as

Route_2＝CK：[W4，ALS_Begin_CK]

Principle 3: after searching any branch, the searching of the rest switch group of the path is stopped, and the searching of the rest switch group on the newly searched branch is finished, and then the searching of the path is continued.

Accordingly, the searching path (1) is stopped, and the searching of the rest turnout groups of the branch (2) is finished. Firstly searching for W4-W6, LF, satisfying the condition, i.e. finding the branch (3)

Route_3＝DK：[W6，ALS_Begin_DK]

Similarly, the search path (2) is suspended, and the branch (3) is searched. Search for "W8-W10, LF", meet the requirements, this is the branch (4)

Route_4＝YK：[W10，ALS_Begin_YK]

Similarly, the branch (4) is searched. After searching, the branch (4) has no remaining switches, so the path (4) is searched. Returning to the path (3), there is no switch left, and the path (3) is searched. Returning to the branch (2), searching to the other turnout group W3-W5, RT, wherein the direction does not meet the requirement, and discarding; continuing searching, finding that the direction of the other turnout group W7-W9 and RT is not satisfied; then there is no remaining switch down, so the branch (2) is searched. Returning to the branch (1), searching to the next turnout group W7-W9, LF, meeting the condition, which is the branch (5)

Route_5＝CK:[Wg，ALS_Begin_CK]

And continuing searching in the path (1), and completing the path (1) without residual turnout. All ALS paths to this traffic signal are searched.

In step 109, a TSP query unit is performed on all the found paths, resulting in 5 sets { TSP }.

The principle of the TSP query unit is that a coordinate section (coordinate system: start point to end point) of any section is input, and { TSP } in the section is returned. The method comprises the following steps:

type algorithm:

searching the number of the covering interlocking boundaries in the coordinate interval (coordinate system: starting point-ending point) according to the interlocking boundary information list, wherein if 0 is represented by a single interlocking control area, and if more than 0 is represented by a multiple interlocking control area.

Slope algorithm:

matching the coordinate interval (coordinate system: starting point-end point) to the corresponding position of the gradient list, finding out a plurality of gradient sections in the corresponding range, and selecting the maximum gradient value for output; if the gradient value is negative, 0 is set.

PSR algorithm:

and similar to the Slope algorithm, matching the coordinate interval (coordinate system: starting point-ending point) to the corresponding position of the permanent speed limit list, and obtaining the maximum speed limit value in a plurality of speed limit sections in the corresponding range.

In step 110, the 5 sets of TSPs are substituted into the ALS calculation unit to calculate 5 ALS lengths. The largest of which is selected to be assigned d_als_output.

Step 111, judging whether the small loop suspension condition "d_als_input=d_als_output" is satisfied, and if the first pass is not satisfied, then iterating the current d_als_output assigned small loop Input; until the condition is satisfied, the iteration is stopped, and the current D_ALS_output is the verification value.

And step 112, judging whether the verification value is consistent with the design value, and giving a verification conclusion.

And 113, searching whether the next annunciator exists, if yes, returning to the large loop function for iterating again, and if not, ending the verification.

Example 2

The present invention also provides an electronic device comprising a Central Processing Unit (CPU) that can perform various suitable actions and processes in accordance with computer program instructions stored in a Read Only Memory (ROM) or computer program instructions loaded from a storage unit into a Random Access Memory (RAM). In the RAM, various programs and data required for the operation of the device can also be stored. The CPU, ROM and RAM are connected to each other by a bus. An input/output (I/O) interface is also connected to the bus.

A plurality of components in a device are connected to an I/O interface, comprising: an input unit such as a keyboard, a mouse, etc.; an output unit such as various types of displays, speakers, and the like; a storage unit such as a magnetic disk, an optical disk, or the like; and communication units such as network cards, modems, wireless communication transceivers, and the like. The communication unit allows the device to exchange information/data with other devices via a computer network, such as the internet, and/or various telecommunication networks.

The processing unit performs the various methods and processes described above, such as steps 101-113. For example, in some embodiments, steps 101-113 may be implemented as a computer software program tangibly embodied on 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 onto the device via the ROM and/or the communication unit. When the computer program is loaded into RAM and executed by the CPU, one or more of the steps 101 to 113 described above may be performed. Alternatively, in other embodiments, the CPU may be configured to perform steps 101-113 in any other suitable manner (e.g., by means of firmware).

The functions described above herein may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), an Application Specific Standard Product (ASSP), a system on a chip (SOC), a load programmable logic device (CPLD), etc.

Program code for carrying out methods of the present invention may be written in any combination of one or more programming languages. These program code may be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus such that the program code, when executed by the processor or controller, causes the functions/operations specified in the flowchart and/or block diagram to be implemented. The program code may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.

In the context of the present invention, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. The machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

While the invention has been described with reference to certain preferred embodiments, it will be understood by those skilled in the art that various changes and substitutions of equivalents may be made and equivalents will be apparent to those skilled in the art without departing from the scope of the invention. Therefore, the protection scope of the invention is subject to the protection scope of the claims.

Claims (9)

1. A fully automatic verification method for urban rail signal proximity locking sections, which is characterized by comprising the following steps:

step S1, reading all input files;

s2, constructing a corresponding calculation unit and a function module;

step S3, ALS verification calculation;

the step S3 specifically comprises the following steps:

step S31, assigning annunciator information including directions and coordinates;

step S32, assigning a variable D_ALS_input;

step S33, executing a path searching module;

step S34, executing TSP query units on all the searched paths to obtain a plurality of groups { TSP };

step S35, substituting a plurality of groups of { TSP } into an ALS calculation unit, calculating a plurality of ALS lengths, and selecting the maximum value of the ALS lengths to output;

step S36, judging whether the small loop suspension condition is met, if not, substituting the current ALS value into the small loop for re-iteration; if yes, the current ALS value is the verification value;

step S37, judging whether the verification value is consistent with the design value, and giving a verification conclusion;

step S38, searching whether a next annunciator exists, if yes, returning to the large loop function for iterating again, and if not, finishing verification.

2. The method for fully automatically verifying the approach of the urban rail signal to the locking section according to claim 1, wherein the step S1 specifically comprises:

step S11, extracting key equipment coordinates, line gradients and long and short chain information lists from the plan, and establishing a track topological structure according to the annunciator and turnout direction information;

step S12, correcting long and short chains;

step S13, creating a verification report blank table, and writing the signal direction and the ALS design value.

3. The method for fully automatically verifying the approach of the urban rail signal to the locking section according to claim 2, wherein the step S12 specifically comprises: and carrying out long-short chain correction processing on all coordinate values in the equipment coordinate list by using the long-short chain list.

4. The method for fully automatically verifying the approach of the urban rail signal to the locking section according to claim 1, wherein the step S2 specifically comprises:

step S21, constructing an ALS calculation unit and initializing formula coefficients;

step S22, an iterative loop module is constructed, wherein the iterative loop module comprises a large loop and a small loop function, the large loop is used for traversing each annunciator in the annunciator list, and the small loop is used for carrying out iterative operation on an independent annunciator and obtaining the ALS length of the annunciator.

5. The method for fully automatically verifying the approach of the urban rail signal to the locking section according to claim 4, wherein the step S21 specifically comprises:

setting the Type of an ALS length range covering interlocking control area outside the annunciator as Type, setting the maximum gradient value in a plurality of gradient sections in the range as Slope, and setting the maximum permanent speed limit value in a plurality of permanent speed limit sections as PSR; the ALS calculation unit can be used for inputting any group of { Type, slope, PSR }, and returning to corresponding ALS length D_ALS

D_ALS＝F(TSP)

Wherein TSP is the abbreviation of Type, slope, PSR.

6. The method according to claim 4, wherein the input in the step S22 is a list of annunciators, and the ALS verification conclusion of each annunciator is output; the Input of the small loop is D_ALS_input and the Output is D_ALS_output.

7. The method of claim 1, wherein the step S33 is executed by a path search module, and the path search module comprises:

all paths possibly going to the annunciator in the range of D_ALS_input of the annunciator are obtained, and the coordinate interval of each path is output.

8. An electronic device comprising a memory and a processor, the memory having stored thereon a computer program, characterized in that the processor, when executing the program, implements the method of any of claims 1-7.

9. A computer readable storage medium, on which a computer program is stored, characterized in that the program, when being executed by a processor, implements the method according to any one of claims 1-7.