A method, device and medium for automatic beacon arrangement

Abstract

The present invention relates to a method, device and medium for automatic beacon layout. The method realizes the automatic layout of beacons through a computer. The method specifically includes the following steps: Step S1, find the target points for the current beacon layout; Step S2, calculate the input elements for the current beacon layout; Step S3, calculate the positions of each beacon for the current beacon layout; Step S4, optimize the number of beacons and add inter-station beacons; Step S5, perform long-short chain conversion on the track mileage; Step S6, output the result to a template. Compared with the prior art, the present invention has the advantages of being implementable by computer software and having a high correct rate.

Description

Technical Field

[0001] The present invention relates to a beacon layout method, and in particular to an automatic beacon layout method, device and medium. Background Art

[0002] Currently, during the implementation of urban rail projects, all the data for beacon layout is manually calculated by data producers according to the plan view and beacon layout rules. They calculate the position mileage points of each beacon on the line one by one, and then manually input the calculated information into the beacon layout data. Since the whole process is carried out manually, the workload is very large and it is easy to make mistakes. The high error rate also leads to multiple rounds of modification in the subsequent beacon data review stage.

[0003] After retrieval, Chinese Patent Publication No. CN110356435A discloses a train automatic driving system based on electronic beacons, which specifically discloses including electronic beacons and on-vehicle ATO. The electronic beacons include inbound electronic beacons, precise stop electronic beacons and line change electronic beacons, and the inbound electronic beacons, precise stop electronic beacons and line change electronic beacons are numbered in an increasing order; the inbound electronic beacons are used for the train to obtain platform position information, so that the train can decelerate in advance according to the obtained platform position information when entering or reversing into the station; the precise stop electronic beacons are used for the train to obtain and correct the position of the stop point; the line change electronic beacons are used for clearing the operation direction after the train switches lines; however, the automatic layout of beacons is not involved. Therefore, how to achieve the automatic layout of beacons has become a technical problem to be solved. Summary of the Invention

[0004] The purpose of the present invention is to overcome the above-mentioned defects existing in the prior art and provide an automatic beacon layout method, device and medium that can be implemented by computer software and has a high correct rate.

[0005] The purpose of the present invention can be achieved by the following technical solutions:

[0006] According to the first aspect of the present invention, an automatic beacon layout method is provided. This method realizes the automatic layout of beacons through a computer, and the method specifically includes the following steps:

[0007] Step S1, find the target point for the current beacon layout;

[0008] Step S2, calculate the input elements for the current beacon layout;

[0009] Step S3, calculate the positions of each beacon for the current beacon layout;

[0010] Step S4, optimize the number of beacons and add inter-station beacons;

[0011] Step S5, perform long and short chain conversion on track mileage;

[0012] Step S6, output the result to the template.

[0013] As a preferred technical solution, the target points in step S1 include:

[0014] The type of the target point;

[0015] The location of the target point;

[0016] The direction of the target point in the input data;

[0017] The train formation type matched by the target point.

[0018] As a preferred technical solution, the types of the target points include the parking point Platform_SSP associated with the platform, the parking point Stabling_SSP associated with the stabling line, the parking point Washing_Zone_SSP associated with the car wash area, the parking point COD_SSP associated with the turning area, and the signal machine Signal_X.

[0019] As a preferred technical solution, the location of the target point includes the track Track_ID and the track mileage Kp.

[0020] As a preferred technical solution, the specific process of step S1 includes:

[0021] Step S101, obtain the input data, including the system data table and the configuration table;

[0022] Step S102, sequentially traverse the parking point list SSP_ID_List of the Platforms, Stablings_Location, Washing_Zones, and Change_Of_Direction_Areas tables in the system data table. If the SSP_ID existing in the SSP_ID_List is not in the parking point list SSP_blacklist that does not require beacon layout in the configuration table, and no target point has been generated for this SSP_ID before, then generate a target point for each associated train formation type Train_Formation_Characteristics_ID in this SSP;

[0023] Step S103, traverse the Signal page of the configuration table. For each ID existing in the signal machine list Signal_ID_in_SYDB of the system data, a corresponding Signal table can be found in the system data table, and a target point of type Signal_X is generated for each Signal_ID_in_SYDB;

[0024] Step S104, traverse the finally obtained list of target points in sequence to obtain the target points for the current beacon layout.

[0025] As a preferred technical solution, all the data required to generate the target points in step S102 can be obtained from the SSP table in the system data table.

[0026] As a preferred technical solution, in step S103, X is the Signal_type corresponding to the Signal in the configuration table.

[0027] As a preferred technical solution, all the data required to generate the Signal_X target points in step S103 can be obtained from the Signal table in the system data table.

[0028] As a preferred technical solution, the input elements in step S2 include:

[0029] Input rule name;

[0030] The distance between the beacon and the target point in each beacon layout level;

[0031] The deployable range of the beacon in each beacon layout level.

[0032] As a preferred technical solution, for Platforms, Stablings_Location, Washing_Zones, Change_Of_Direction_Areas, the input rule name includes the target point type and the train formation type, and for Signal, the input rule name includes the type of the signal machine.

[0033] As a preferred technical solution, the specific process of step S3 includes:

[0034] Step S301, obtain the current target point and the input elements corresponding to the target point;

[0035] Step S302, create an empty queue, use the current target point coordinates, the distance to the target point, and the beacon layout level 1 as the initial starting point, and enqueue the initial starting point;

[0036] Step S303, determine whether the queue is empty. If so, end the current beacon layout; if not, dequeue the first starting point at the head of the queue;

[0037] Step S304, obtain the configuration parameters in the input elements according to the beacon layout level of the starting point;

[0038] Step S305, obtain the layout distance for this time according to the distance to the target point in the configuration parameters and the distance from the current starting point to the target point;

[0039] Step S306: Obtain the coordinates at all layout distances downstream of the starting point coordinates and the distances from the target point, and obtain the allowable layout range according to the configuration parameters.

[0040] Step S307: Determine whether there are coordinates in the turnout prohibited layout area. If so, adjust the coordinates to the edge of the prohibited layout area and adjust the distances and ranges.

[0041] Step S308: Determine whether the current layout beacon level plus one is greater than the maximum layout beacon level in the configuration parameters. If so, directly return to Step S303; if not, obtain a new starting point based on each set of coordinates and the distance from the target point, set its layout beacon level to the current layout beacon level plus one, then place it at the end of the queue in turn, and then return to Step S303.

[0042] As a preferred technical solution, the specific process of the said Step S4 includes:

[0043] Step S401: According to the allowable layout ranges of each beacon obtained in Step S3, combine the beacons with overlapping ranges into one beacon.

[0044] Step S402: Fill in the inter-station beacons between the combined beacons to ensure that the distance between beacons is not greater than the corresponding parameters in the configuration table.

[0045] As a preferred technical solution, the specific process of the said Step S5 includes: According to the long and short chain information of the corresponding track in the system data, restore the coordinate information used in the calculation process to the form of long and short chains.

[0046] As a preferred technical solution, the templates in the said Step S6 include files in CSV format and files in xlsx format.

[0047] According to the second aspect of the present invention, there is provided an electronic device, including a memory and a processor, wherein a computer program is stored on the memory, and when the processor executes the program, the method described above is implemented.

[0048] According to the third aspect of the present invention, there is provided a computer-readable storage medium, on which a computer program is stored, and when the program is executed by a processor, the method described above is implemented.

[0049] Compared with the prior art, the present invention has the following advantages:

[0050] 1) The present invention can be implemented in computer language. According to user feedback, the beacon automatic generation tool formed by the present invention can save 70% of the labor in the project beacon data production stage (originally 16 person-days for a single project, now 5 person-days).

[0051] 2) The present invention has a high correctness. By using the breadth - first traversal algorithm for beacon layout, it conforms to the layout principle and can completely cover all beacons to be laid out. According to statistics, it can save 50% of the manual labor for beacon data review (originally 32 man - days for a single project, now 16 man - days). BRIEF DESCRIPTION OF THE DRAWINGS

[0052] Figure 1 is the specific flowchart of the present invention;

[0053] Figure 2 is the flowchart for calculating the positions of beacons for a single beacon layout;

[0054] Figure 3 is a partial diagram of a certain actual line;

[0055] Figure 4 is a schematic diagram of the preliminary beacon layout completed for a partial section of a certain actual line;

[0056] Figure 5 is a schematic diagram of the final beacon layout completed for a partial section of a certain actual line. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0057] Next, the technical solutions in the embodiments of the present invention will be clearly and completely described in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, rather than all embodiments. All other embodiments obtained by those of ordinary skill in the art based on the embodiments of the present invention without creative efforts shall fall within the protection scope of the present invention.

[0058] As Figure 1 shown, a method for automatic beacon layout of the present invention realizes the automatic layout of beacons through a computer. The method specifically includes the following steps:

[0059] Step S1: Find the target points for the current beacon layout. The target points include:

[0060] Step S2: Calculate the input elements for the current beacon layout;

[0061] Step S3: Calculate the positions of beacons for the current beacon layout;

[0062] Step S4: Optimize the number of beacons and add inter - station beacons;

[0063] Step S5: Convert the track mileage for long - chain and short - chain conversion;

[0064] Step S6: Output the result to a template.

[0065] The described step S1: Find the target points for the current beacon layout. The target points include:

[0066] Type of target point (Platform_SSP, Stabling_SSP, Washing_Zone_SSP, COD_SSP, Signal_X);

[0067] Location of target point (Track_ID of track, Kp of track mileage);

[0068] Direction of target point in input data (Up, Down);

[0069] Train formation type matched by target point (1, 2).

[0070] The specific process of the said step S1 includes:

[0071] Step S101, obtain input data, including system data table and configuration table;

[0072] Step S102, traverse the SSP_ID_List in the Platforms, Stablings_Location, Washing_Zones, Change_Of_Direction_Areas tables in the system data table in sequence. If the SSP_ID existing in this SSP_ID_List is not in the SSP_blacklist of the configuration table and no target point has been generated for this SSP_ID before, then generate a target point for each Train_Formation_Characteristics_ID in this SSP;

[0073] Step S103, traverse the Signal page of the configuration table. Each ID in its Signal_ID_in_SYDB can find the corresponding Signal table in the system data table, and generate a target point of type Signal_X for each Signal_ID_in_SYDB;

[0074] Step S104, traverse the finally obtained target point list in sequence to obtain the target points for the current beacon layout.

[0075] All data required for generating target points in the said step S102 can be obtained from the SSP table in the system data table. X in the said step S103 is the Signal_type corresponding to this Signal in the configuration table. All data required for generating Signal_X target points in the said step S103 can be obtained from the Signal table in the system data table.

[0076] The input elements in the said step S2 include:

[0077] Input rule name. For Platforms, Stablings_Location, Washing_Zones, and Change_Of_Direction_Areas, the input rule name includes the target point type and the train formation type. For Signal, the input rule name includes the type of the signal machine;

[0078] The distance between the beacon and the target point in each arranged beacon level;

[0079] The deployable range of the beacon in each arranged beacon level.

[0080] As Figure 2 shown, the specific process of step S3 includes:

[0081] Step S301, obtain the current target point and the input elements corresponding to the target point;

[0082] Step S302, create an empty queue, use the current target point coordinates, the distance to the target point, and the arranged beacon level 1 as the initial starting point, and enqueue the initial starting point;

[0083] Step S303, determine whether the queue is empty. If so, end the current beacon arrangement; if not, dequeue the first starting point at the head of the queue;

[0084] Step S304, obtain the configuration parameters in the input elements according to the arranged beacon level of the starting point;

[0085] Step S305, obtain the deployment distance for this time according to the distance to the target point in the configuration parameters and the distance from the current starting point to the target point;

[0086] Step S306, obtain the coordinates at all deployment distances downstream of the starting point coordinates and the distance to the target point, and obtain the allowable deployment range according to the configuration parameters;

[0087] Step S307, determine whether there are coordinates in the turnout prohibited deployment area. If so, adjust the coordinates to the edge of the prohibited deployment area, and adjust the distance and range;

[0088] Step S308, determine whether the current arranged beacon level plus one is greater than the maximum arranged beacon level in the configuration parameters. If so, directly return to step S303; if not, obtain new starting points according to each group of coordinates and the distance to the target point, set their arranged beacon level to the current arranged beacon level plus one, then place them at the end of the queue in turn, and then return to step S303.

[0089] The specific process of step S4 includes:

[0090] Step S401: According to the allowable layout range of each beacon obtained in step S3, combine the beacons with overlapping ranges into one beacon;

[0091] Step S402: Fill in the inter-station beacons between the combined beacons to ensure that the distance between beacons is not greater than the corresponding parameter in the configuration table.

[0092] The specific process of step S5 includes: according to the long and short chain information of the corresponding track in the system data, restore the coordinate information used in the calculation process to the form of long and short chains. The templates in step S6 include files in CSV format and xlsx format.

[0093] For the connection situation of the track section line in this embodiment, see Figure 3 as shown, where there is a stop point (SSP) of type Platform in the upward direction on the B1 track section.

[0094] Step S1: Find the target point for the current beacon layout;

[0095] Load the system data table and the configuration information table, traverse the Platform table in the system data table to obtain the associated stop points, and then traverse the stop point table in the system data table to obtain the stop point information for the current traversal. When traversing to Figure 3 the stop points existing in the shown partial view, calculate the target point for the current time, as shown in Table 1 below;

[0096] Table 1

[0097] Type Position Direction Train Type Platform_SSP Track_ID:1Kp:100 Up 1

[0098] Step S2: Calculate the input elements for the current beacon layout;

[0099] For the SSP of Platform type, obtain the input elements according to the configuration file as shown in Table 2 below:

[0100] Table 2

[0101] Name Value Input Element Name SSP_Signal_dist1_Platform_TF1 Distance between the first-level beacon and the target point / cm 2567 Range of the first-level beacon / cm -100～100 Distance between the second-level beacon and the target point / cm 3237 Range of the second-level beacon / cm -300～200 Distance between the third-level beacon and the target point / cm 4237 Range of the third-level beacon / cm -300～200

[0102] According to this table, the current beacon layout needs to be carried out in two levels.

[0103] Step S3: Calculate the positions of each beacon for the current beacon layout;

[0104] First, obtain the position of the target point as the starting point;

[0105] Then, obtain the distance of 567 cm that needs to be traversed in the first level according to the input elements;

[0106] Search in the upward direction (Up). An initial beacon, Beacon1, is obtained at a distance of 567 cm from the target point. This beacon is located on track section B3, and the allowable deployment range is obtained.

[0107] Starting from Beacon1, continue the search in the upward direction. At this time, the search distance is 3237 - 2567 = 670 cm, and Beacon2 is obtained. At this time, both Beacon2 and its allowable deployment range are within the range where turnout deployment is prohibited. Move it to the boundary of the range where turnout deployment is prohibited to obtain Beacon2', and the allowable deployment range is limited to the current target point only.

[0108] Starting from Beacon2, continue the search in the upward direction. At this time, the search distance is 4237 - 3237 = 1000 cm. Since a diverging turnout is passed through midway, the search needs to be carried out in both branches of the diverging turnout, and two beacons, Beacon3 and Beacon4, are obtained.

[0109] Beacon3 is within the range where turnout deployment is prohibited. Move it to the boundary of the range where turnout deployment is prohibited to obtain Beacon3'. Also, Beacon4 is outside the range where turnout deployment is prohibited, but its allowable deployment range includes the turnout prohibited area. Narrow the range to outside the prohibited deployment range.

[0110] The schematic diagram after the preliminary beacon layout is as Figure 4 shown, and the beacon information is shown in Table 3.

[0111] Table 3

[0112] Beacon Name Track Kp Range Beacon1 1 2667 -100～100 Beacon2’ 1 2767 0 Beacon3’ 1 4437 0～100 Beacon4 2 4337 -100～200

[0113] Step S4: Optimize the number of beacons and add inter-station beacons:

[0114] The maximum beacon spacing in the configuration table is 2000 cm. At this time, Beacon2' is within the allowable deployment range (including the boundary) of Beacon1. Merge Beacon2' and Beacon1 into a new Beacon12'. There are no other beacons within 2000 cm in the upward direction of Beacon3' and Beacon4. Therefore, set Beacon5 and Beacon6 as inter-station beacons. The schematic diagram after the final beacon layout is as Figure 5 shown, and the beacon information is shown in Table 4.

[0115] Table 4

[0116] Beacon Name Track Kp Range Beacon12’ 1 2767 0 Beacon3’ 1 4437 0～100 Beacon4 2 4337 -100～200 Beacon5 1 6437 0 Beacon6 2 6337 0

[0117] Step S5: Convert the long and short chains of the track mileage.

[0118] According to the results obtained from Table 4, find the long and short chain information of the corresponding orbit in the system data, perform long and short chain conversion, and the obtained results are shown in Table 5.

[0119] Table 5

[0120] Beacon Name Track AbsKp Gap Beacon12’ 1 2767 0 Beacon3’ 1 4337 100 Beacon4 2 4237 100 Beacon5 1 6237 200 Beacon6 2 6237 100

[0121] Step S6: Output the result to the template.

[0122] The template includes files in CSV format and files in xlsx format.

[0123] The above is the introduction of the method embodiment. The following further illustrates the solution of the present invention through embodiments of electronic devices and storage media.

[0124] The electronic device of the present invention includes a central processing unit (CPU), which can execute various appropriate actions and processes according to 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 device operation can also be stored. The CPU, ROM, and RAM are connected to each other through a bus. An input / output (I / O) interface is also connected to the bus.

[0125] Multiple components in the device are connected to the I / O interface, including: an input unit, such as a keyboard, a mouse, etc.; an output unit, such as various types of displays, speakers, etc.; a storage unit, such as a disk, an optical disc, etc.; and a communication unit, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit allows the device to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.

[0126] The processing unit executes the various methods and processes described above, such as methods S1 to S6. For example, in some embodiments, methods S1 to S6 can be implemented as a computer software program, which is tangibly contained in a machine-readable medium, such as a storage unit. In some embodiments, part or all of the computer program can be loaded and / or installed onto the device via the ROM and / or the communication unit. When the computer program is loaded into the RAM and executed by the CPU, one or more steps of methods S1 to S6 described above can be executed. Alternatively, in other embodiments, the CPU can be configured to execute methods S1 to S6 in any other suitable manner (for example, by means of firmware).

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

[0128] The program code for implementing the method of the present invention can be written in any combination of one or more programming languages. These program codes can be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing devices, such that when the program codes are executed by the processor or controller, the functions / operations specified in the flowchart and / or block diagram are implemented. The program code can be executed entirely on the machine, partially on the machine, executed partially on the machine as an independent software package and partially on a remote machine, or executed entirely on a remote machine or server.

[0129] In the context of the present invention, a machine-readable medium can 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. A machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium can include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatuses, or devices, or any suitable combination of the foregoing. More specific examples of machine-readable storage media would 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.

[0130] As described above, the above are only specific embodiments of the present invention, but the protection scope of the present invention is not limited thereto. Any person skilled in the art within the technical scope disclosed by the present invention can easily think of various equivalent modifications or substitutions, and these modifications or substitutions should all be covered within the protection scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims

1. An automatic beacon layout method, characterized in that, This method realizes the automatic layout of beacons through a computer, and the method specifically includes the following steps: Step S1, find the target point for the current beacon layout; Step S2, calculate the input elements for the current beacon layout; Step S3, calculate the positions of each beacon for the current beacon layout; Step S4, optimize the number of beacons and add inter-station beacons; Step S5, perform long-short chain conversion on the track mileage; Step S6, output the result to the template; The specific process of the said Step S3 includes: Step S301, obtain the current target point and the input elements corresponding to the target point; Step S302, create an empty queue, use the current target point coordinates, the distance to the target point, and the beacon layout level 1 as the initial starting point, and enqueue the initial starting point; Step S303, determine whether the queue is empty. If so, end the current beacon layout; if not, dequeue the first starting point at the head of the queue; Step S304, obtain the configuration parameters in the input elements according to the beacon layout level of the starting point; Step S305, obtain the layout distance for the current time according to the distance to the target point in the configuration parameters and the distance from the current starting point to the target point; Step S306, obtain the coordinates at all layout distances downstream of the starting point coordinates and the distance to the target point, and obtain the allowable layout range according to the configuration parameters; Step S307, determine whether there are coordinates in the turnout prohibited layout area. If so, adjust the coordinates to the edge of the prohibited layout area and adjust the distance and range; Step S308, determine whether the current beacon layout level plus one is greater than the maximum beacon layout level in the configuration parameters. If so, directly return to Step S303; if not, obtain new starting points according to each group of coordinates and the distance to the target point, set their beacon layout level to the current beacon layout level plus one, then place them at the end of the queue in turn, and then return to Step S303; The specific process of the said Step S4 includes: Step S401, according to the allowable layout range of each beacon obtained in Step S3, combine the beacons with overlapping ranges into one beacon; Step S402, fill in inter-station beacons between the combined beacons to ensure that the distance between beacons is not greater than the corresponding parameters in the configuration table.

2. The automatic beacon layout method according to claim 1, characterized in that The target points in the said Step S1 include: The type of the target point; The position of the target point; The direction of the target point in the input data; The train formation type matched by the target point.

3. The automatic beacon layout method according to claim 2, wherein, The types of the said target points include the parking point Platform_SSP associated with the platform, the parking point Stabling_SSP associated with the stabling line, the parking point Washing_Zone_SSP associated with the car wash area, the parking point COD_SSP associated with the turning area, and the signal machine Signal_X.

4. A beacon automatic layout method according to claim 2, characterized in that The position of the said target point includes the track Track_ID and the track mileage Kp.

5. A method for automatically arranging beacons according to claim 1, characterized in that, The specific process of the said Step S1 includes: Step S101, obtain the input data, including the system data table and the configuration table; Step S102: Traverse the parking point lists SSP_ID_List in the platform Platforms, stabling line Stablings_Location, washing area Washing_Zones, and turning area Change_Of_Direction_Areas tables in the system data table in sequence. If the SSP_ID in the SSP_ID_List does not exist in the parking point list SSP_blacklist that does not need to consider beacon layout in the configuration table, and no target point has been generated for this SSP_ID before, then generate a target point for each associated train formation characteristics ID Train_Formation_Characteristics_ID in this SSP; Step S103: Traverse the Signal page of the configuration table. For each ID in the signal machine list Signal_ID_in_SYDB that exists in the system data, a corresponding Signal table can be found in the system data table, and a target point of type Signal_X is generated for each Signal_ID_in_SYDB; Step S104: Traverse the finally obtained target point list in sequence to obtain the target points for the current beacon layout.

6. The automatic beacon arrangement method according to claim 5, characterized in that All the data required to generate target points in Step S102 can be obtained from the SSP table in the system data table.

7. A method for automatically arranging beacons according to claim 5, characterized in that, In Step S103, X is the Signal_type corresponding to Signal in the configuration table.

8. A method for automatically arranging beacons according to claim 5, characterized in that, All the data required to generate Signal_X target points in Step S103 can be obtained from the Signal table in the system data table.

9. A method for automatically arranging beacons according to claim 1, characterized in that, The input elements in Step S2 include: Input rule name; The distance between the beacon and the target point in each beacon layout level; The deployable range of the beacon in each beacon layout level.

10. The beacon automatic layout method according to claim 9, characterized in that, For Platforms, Stablings_Location, Washing_Zones, Change_Of_Direction_Areas, the input rule name includes the target point type and the train formation type. For Signal, the input rule name includes the type of the signal machine.

11. The beacon automatic layout method according to claim 1, characterized in that The specific process of Step S5 includes: According to the long and short chain information of the corresponding track in the system data, restore the coordinate information used in the calculation process to the form of long and short chains.

12. The beacon automatic layout method according to claim 1, characterized in that The templates in Step S6 include files in CSV format and files in xlsx format.

13. An electronic device, comprising a memory and a processor, wherein a computer program is stored on the memory, characterized in that, When the processor executes the program, it implements the method described in any one of claims 1 to 12.

14. 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 described in any one of claims 1 to 12.

Images