CN114954578B - Automatic generation method and system of foldback route table - Google Patents

Automatic generation method and system of foldback route table Download PDF

Info

Publication number
CN114954578B
CN114954578B CN202210613565.1A CN202210613565A CN114954578B CN 114954578 B CN114954578 B CN 114954578B CN 202210613565 A CN202210613565 A CN 202210613565A CN 114954578 B CN114954578 B CN 114954578B
Authority
CN
China
Prior art keywords
route
routes
determining
reentrant
automatic
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202210613565.1A
Other languages
Chinese (zh)
Other versions
CN114954578A (en
Inventor
于磊
乔文可
张志鹏
袁重阳
叶伟
许玲玲
赵安安
曹华
包成亮
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
CRSC Urban Rail Transit Technology Co Ltd
Original Assignee
CRSC Urban Rail Transit Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by CRSC Urban Rail Transit Technology Co Ltd filed Critical CRSC Urban Rail Transit Technology Co Ltd
Priority to CN202210613565.1A priority Critical patent/CN114954578B/en
Publication of CN114954578A publication Critical patent/CN114954578A/en
Application granted granted Critical
Publication of CN114954578B publication Critical patent/CN114954578B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • BPERFORMING OPERATIONS; TRANSPORTING
    • B61RAILWAYS
    • B61LGUIDING RAILWAY TRAFFIC; ENSURING THE SAFETY OF RAILWAY TRAFFIC
    • B61L27/00Central railway traffic control systems; Trackside control; Communication systems specially adapted therefor
    • B61L27/10Operations, e.g. scheduling or time tables
    • B61L27/14Following schedules

Landscapes

  • Engineering & Computer Science (AREA)
  • Mechanical Engineering (AREA)
  • Train Traffic Observation, Control, And Security (AREA)

Abstract

The invention provides a method and a system for automatically generating a foldback route table, wherein the method comprises the following steps: determining all routes in each interlocking centralized station according to the link relation among target devices in the standard primitive library; determining a reentrant route of the all routes; and generating a foldback route table according to the foldback route. The system performs the method. According to the invention, all the routes in each interlocking centralized station are obtained by identifying the link relation among the target devices in the standard primitive library, the calculation of the returning route is completed according to the routes, and finally, the returning route table is automatically generated by utilizing the calculated returning route.

Description

Automatic generation method and system of foldback route table
Technical Field
The invention relates to the technical field of rail transit, in particular to a method and a system for automatically generating a foldback route table.
Background
The rapid development of urban economy makes the social demand and dependence on inter-urban railway transportation efficiency more prominent. Compared with high-speed railways and trunk railways, the interurban railway public transportation operation mode enables the turning-back stations of the interurban railways to be more intensive. The foldback operation in the inter-city railway is generally that the currently arrived front sequence vehicle is adopted to act as the next starting train after the foldback operation, so the foldback capacity is a decisive basis for executing a more efficient operation plan, realizing effective lifting of the traffic volume/the traffic capacity and optimizing the on-line operation efficiency of the motor train unit, and the insufficient automation level of the foldback function of the conventional system becomes a key factor for restricting the transportation capacity of the inter-city railway. The automatic turn-back function is additionally arranged in the dispatching command system, so that the automatic turn-back function can effectively adapt to actual characteristics of inter-city railway turn-back operation requirements and intensive turn-back stations, and has great significance in improving railway transportation command capacity and optimizing operation efficiency.
The urban rail interlocking system is a technical means for ensuring the safety of trains on a road, effectively utilizing the lines in a station yard, efficiently commanding driving and shunting, and utilizing the technologies and equipment such as mechanical, electric automatic control, remote control, computers and the like to ensure that annunciators, roads and turnouts on the roads in the range of the station have a constraint relationship with each other. The interlocking table records the interlocking information of each route, including the interlocking logic relation among the routes, the turnouts and the annunciators and the related information of related trackside equipment, and the automatic turn-back route table (hereinafter referred to as turn-back route table) records the key route data capable of realizing the automatic turn-back function of the train, thereby being the key for realizing the automatic turn-back function of the train and ensuring the safe turn-back operation of the train.
The traditional foldback route table compiling method mainly comprises manual comparison signal plane graph filling, and has the advantages of large workload, easy error and low efficiency. Once the station diagram needs to be modified, it must be reprogrammed and modified. The manual filling of the configuration file content is still heavy by the method of automatically generating the reentrant access list by reading the configuration file through tool software.
Disclosure of Invention
The automatic generation method and system of the foldback route table are used for solving the problems in the prior art, all routes in each interlocking centralized station are obtained by identifying the link relation among target devices in a standard primitive library, calculation of the foldback route is completed according to the routes, and finally the foldback route table is automatically generated by using the calculated foldback route.
The invention provides a method for automatically generating a foldback route table, which comprises the following steps:
Determining all routes in each interlocking centralized station according to the link relation among target devices in the standard primitive library;
determining a reentrant route of the all routes;
And generating a foldback route table according to the foldback route.
According to the automatic generation method of the foldback route table, the link relation among the target devices in the standard primitive library is determined by the following modes:
Encapsulating each target device into a standard image block, and establishing the standard image element library, wherein the standard image element library has the attribute of each target device and the association attribute among each target device;
and determining the link relation according to the association attribute.
According to the automatic generation method of the foldback route table provided by the invention, the determining of the foldback route in all routes comprises the following steps:
determining a first return route and a second return route of all the routes;
Determining an automatic reentrant access according to the first reentrant access and the second reentrant access;
Determining a full-automatic reentrant access according to the automatic reentrant access;
and determining the turning-back route according to the automatic turning-back route and the full-automatic turning-back route.
According to the method for automatically generating the foldback route table provided by the invention, the determining of the first foldback route and the second foldback route in all routes comprises the following steps:
determining a first route with a turning-back attribute of the last track section in all routes, and taking the first route as a first turning-back route;
determining whether a target signal machine with the opposite direction to a first starting signal machine of the first route exists in a target end of a last track section in the first route, and if so, taking the target signal machine as a second starting signal machine of a second route;
searching all third routes which take the second starting end signal as the starting end from all routes;
If the fourth route meeting the preset condition exists in all the third routes, the fourth route is used as a second return route;
The target end is determined according to the first starting end signal machine facing the opposite end.
According to the method for automatically generating the foldback route table, provided by the invention, the preset conditions comprise:
The first turnout in the access way and the last turnout of the first turning-back access way belong to the same turnout; and
The first switch is located at a different position than the last switch.
According to the method for automatically generating the foldback route table, the foldback route table is generated according to the foldback route, and the method comprises the following steps:
Determining a target field value in a preset reentry route table according to the reentry route and the attribute of each target device forming the reentry route;
generating a reentrant access table according to a target field value and the preset reentrant access table;
Wherein the target field value includes at least one of the following:
Station name, route number, route data, route name, route property, auto-turn button, annunciator, and auto-turn instruction.
The invention also provides an automatic generation system of the foldback route table, which comprises the following steps: the system comprises a first determining module, a second determining module and a route table generating module;
the first determining module is used for determining all routes in each interlocking centralized station according to the link relation among the target devices in the standard primitive library;
the second determining module is used for determining a reentry route in all routes;
the route table generation module is used for generating a turn-back route table according to the turn-back route.
The invention also provides an electronic device comprising a processor and a memory storing a computer program, wherein the processor implements the method for automatically generating the reentrant entrance table according to any one of the above methods when executing the program.
The present invention also provides a non-transitory computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements a method of automatically generating a reentrant entrance table as described in any one of the above.
The invention also provides a computer program product comprising a computer program which when executed by a processor implements a method of automatically generating a reentrant entry sheet as described in any one of the above.
According to the automatic generation method and system of the foldback route table, all routes in each interlocking centralized station are obtained through identifying the link relation among target devices in the standard primitive library, calculation of the foldback route is completed according to the routes, and finally the foldback route table is automatically generated by using the calculated foldback route.
Drawings
In order to more clearly illustrate the invention or the technical solutions of the prior art, the following description will briefly explain the drawings used in the embodiments or the description of the prior art, and it is obvious that the drawings in the following description are some embodiments of the invention, and other drawings can be obtained according to the drawings without inventive effort for a person skilled in the art.
FIG. 1 is a schematic flow chart of the automatic generation method of the foldback route table provided by the invention;
FIG. 2 is a schematic diagram of the system for automatically generating a foldback route table according to the present invention;
Fig. 3 is a schematic diagram of an entity structure of an electronic device according to the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the present invention more apparent, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings, and it is apparent that the described embodiments are some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The automatic generation method of the foldback route table carries out CAD secondary development through ObjectARX, so that various target equipment graphic elements in a CAD signal plane graph have perfect attribute information, thereby realizing the purposes of identifying various target equipment graphic elements from the signal plane graph, automatically completing the calculation of the automatic foldback route of each interlocking centralized station, leading calculation results into the foldback route table, and replacing the traditional manual foldback route table writing method, and specifically realizing the following steps:
fig. 1 is a schematic flow chart of the method for automatically generating a foldback route table according to the present invention, as shown in fig. 1, the method includes:
step 100, determining all routes in each interlocking centralized station according to the link relation among target devices in a standard primitive library;
Step 200, determining a reentry route in all routes;
And 300, generating a foldback route table according to the foldback route.
It should be noted that, the execution subject of the above method may be a computer device.
Optionally, performing CAD secondary development by using ObjectARX, and encapsulating primitives of various target devices in the CAD signal plan into standard unified tiles to build a standard primitive library, so as to effectively identify various target devices in the CAD signal plan, and further implement automatic calculation and derivation of the reentrant route of each interlocking central station.
And opening CAD software and loading a drawing plug-in, opening a subway gallery through CAD menu commands, and selecting standard image blocks provided on a gallery panel according to drawing requirements to finish drawing of a signal plane diagram. And then reading various primitive data in the signal plan through a CAD menu 'foldback route calculation' command, carrying out 'foldback route' calculation, and finally leading out the data into a foldback route table of a corresponding interlocking centralized area.
CAD secondary development is carried out through ObjectARX, various equipment graphic elements in the subway signal plane graph are designed into various graphic blocks with custom entity types, and the graphic blocks are packaged into a standard graphic element library, so that the standardization of the plane graphic elements is realized.
When the plan is drawn, the unified tiles provided on the panels of different types of equipment in the subway gallery are utilized to finish drawing the plan, so that the operation is concise.
And (3) calculating the approach within the range of each interlocking centralized station: the CAD signal plan drawing is drawn by adopting standard blocks in a subway gallery, and all target devices such as circuits, annunciators, axle counting, track sections, turnouts, central station boundaries, stations and other corresponding standard blocks are mutually associated, so that a perfect link relation is provided, all routes in an interlocking central station are calculated by identifying the standard blocks and utilizing the link relation, and all routes are numbered according to the existing numbering principle.
By utilizing the custom standard block of each target device which is independently developed, various target devices such as a signal machine, a turnout, a track section, a shaft, a station, a centralized area boundary and the like and the attribute information attached to the target devices can be automatically identified and distinguished through a CAD secondary development interface provided by ObjectARX, so that the calculation of an automatic reentrant route can be completed, and the calculated automatic reentrant route data can be exported to an Excel automatic reentrant route table.
And obtaining the turn-back route in each interlocking central station according to all the route data in each interlocking central station, and obtaining a turn-back route table in each interlocking central station according to the turn-back route in each interlocking central station.
According to the automatic generation method of the foldback route table, all routes in each interlocking centralized station are obtained by identifying the link relation among target devices in the standard primitive library, calculation of the foldback route is completed according to the routes, and finally the foldback route table is automatically generated by using the calculated foldback route.
Further, in one embodiment, the link relationship between each target device in the standard primitive repository in step 100 is determined by:
Step 1001, encapsulating each target device into a standard graph block, and establishing a standard primitive library, wherein the standard primitive library has the attribute of each target device and the association attribute among each target device;
step 1002, determining a link relation according to the association attribute.
Alternatively, in order to be able to identify each target device directly from the signal plan, a unified normalization process is required for various primitives in the signal plan. The method comprises the steps of designing target equipment such as lines, axle counting, annunciators, turnouts, sections, stations, concentration zone boundaries and the like into different types of custom entity image blocks, namely packaging the custom entity image blocks into different types of standard image blocks, establishing a standard image element library, and realizing standardization of station signal plane image elements. Each target device in the standard primitive library has perfect attribute information, not only records various attributes of the target device, but also association attributes among the target devices (as mentioned later, the name of the line attribute and the name of the line belonging to the attribute of the axle counting are the association attributes between the line and the axle counting, and the left zone ID in the attribute of the axle counting and the ID in the attribute of the zone are the association attributes between the axle counting and the zone). The perfect primitive attribute design ensures that standard image blocks corresponding to various target devices in the signal plane graph are mutually associated, and the link relation among the target devices can be obtained by identifying the association attribute among the target devices.
For example, the standard primitive library is recorded with: the attribute of the line (such as ID, name), the attribute of the axle (such as number, axle ID, left side section ID, right side section ID, belonging line name, location, name, station name of the station, and mile mark), the attribute of the signal (such as number, type, orientation, location, name, boundary equipment, station name of the station, ID, belonging line ID, outside track section, belonging section, and mile mark), the attribute of the switch (such as location, name, main line ID, main section ID, number, left side section ID, right side section ID), section attribute: (e.g., ID, belonging line name, station attribute and name), station attribute (e.g., name, number and ID), and central station demarcation attribute (e.g., type, left primary interlocking central station name, right primary central station name, left secondary cascading locking central station name, right secondary central station name, etc.); the direction attribute of the annunciator represents the up-down direction of train operation, such as the annunciator is directed to the left and the annunciator is directed to the right and the annunciator is directed to the down direction.
According to the automatic generation method of the foldback route table, various target devices are packaged into standard image blocks, a standard primitive library is established, the link relation among the target devices in the standard primitive library is determined by identifying the association attribute among the target devices, and then a foundation is laid for obtaining all routes in each interlocking centralized station based on the link relation subsequently, calculating the foldback route according to the obtained route, and automatically generating the foldback route table.
Further, in one embodiment, step 200 may specifically include:
step 2001, determining a first return route and a second return route in all routes;
step 2002, determining an automatic reentrant access according to the first reentrant access and the second reentrant access;
step 2003, determining a full-automatic foldback route according to the automatic foldback route;
Step 2004, determining a foldback route according to the automatic foldback route and the full-automatic foldback route.
Alternatively, a set of auto-reentry routes is typically made up of two reentry routes, based on which two reentry routes (i.e., a first reentry route and a second reentry route) are found from all corresponding routes within each interlocking hub, and the first reentry route and the second reentry route are taken as a set of auto-reentry routes.
And finding all the first retracing routes and all the second retracing routes from all the corresponding routes in each interlocking centralized station, and combining the first retracing routes and the second retracing routes in pairs to form a group of automatic retracing routes.
The two groups of automatic turning-back routes form a group of full-automatic turning-back routes, and the automatic turning-back routes and the full-automatic turning-back routes which are finally counted are used as turning-back routes so as to generate a turning-back route table. The starting signal of the first return route and the ending signal of the second return route are equal in the two groups of automatic return routes constituting the full-automatic return route.
According to the automatic generation method of the foldback route table, provided by the invention, the first foldback route and the second foldback route in all routes in each interlocking centralized station are identified, and the calculation of the foldback route is completed according to the first foldback route and the second foldback route, so that a foundation is laid for automatically generating the foldback route table by using the foldback route obtained by calculation in the follow-up.
Further, in one embodiment, step 2001 may specifically include:
Step 20011, determining a first route with a turning-back attribute of the last track section in all routes, and taking the first route as a first turning-back route;
Step 20012, determining whether a target signal machine with the opposite direction to the first initial signal machine of the first route exists in the target end of the last track section in the first route, if so, taking the target signal machine as a second initial signal machine of a second route;
step 20013, searching all third routes which take the second starting end signal as the starting end from all routes;
step 20014, if it is determined that all the third routes have fourth routes meeting the preset condition, taking the fourth routes as second return routes;
wherein the destination end is determined from the first start signal toward the opposite end.
Further, in one embodiment, the preset conditions in step 20014 may specifically include:
The first turnout in the access and the last turnout of the first turning-back access belong to the same turnout; and
The first switch is located at a different position than the last switch.
Optionally, calculating the turn-back route of each interlocking central station requires that all routes within the range of each interlocking central station be calculated first, then a route combination capable of forming the turn-back route is identified through turn-back route judgment conditions, and finally calculation is performed for each part of data of a station name, a route number, a route name, a route property, an automatic turn-back button, a annunciator and an automatic turn-back description in a turn-back route table respectively, wherein the specific contents are as follows:
the judgment conditions of the automatic reentrant route are formed:
A. The automatic folding-back route consists of two folding-back routes, namely a folding-back route 1 (namely a first route) and a folding-back route 2 (namely a second route).
B. Firstly judging whether the last track section in one route has a turn-back attribute, wherein the attribute can be manually added for a standard image block of the track section by a plotter when a signal plan is drawn, and if the attribute has the turn-back attribute, the route is regarded as a turn-back route 1, and the follow-up calculation is continued;
C. finding the last track section in the foldback route 1, using a signal machine (namely a target signal machine) with the opposite direction to a signal machine (namely a first signal machine) at the beginning of the foldback route 1 as a signal machine at the beginning of the foldback route 2 (namely a second signal machine) at the beginning of the foldback route 2, and then continuously searching the foldback route 2; specifically:
Determining the last track section in the first route (the foldback route 1), judging whether a signal opposite to the first route start signal exists at the target end, if the first start signal of the first route is left-facing, determining whether the right end of the last track section in the first route is the target end according to the opposite end of the first start signal, and determining whether the right end of the last track section in the first route is the target end opposite to the first start signal, if the first start signal is right-facing, determining whether the left end of the last track section in the first route is the target end according to the opposite end of the first start signal, and determining whether the left end of the last track section in the first route is the target signal opposite to the first start signal, and if so, determining the target signal is the second start signal of the second route.
D. After finding the second initial end signal machine of the turn-back route 2, searching all routes (namely all third routes) taking the signal machine as the initial end, and taking the fourth route as the second turn-back route if the fourth route meeting the preset condition exists, wherein the preset condition is specifically as follows:
the first turnout in the route is the same as the last turnout in the turn-back route 1 (namely, the turnout belongs to the same turnout), but the turnout positions are different, so that the route is the turn-back route 2 to be searched, and the turn-back route 1 and the turn-back route 2 form a group of automatic turn-back routes.
According to the method for automatically generating the foldback route table, provided by the invention, the route combination which forms the foldback route is effectively judged according to the foldback route judgment condition, and the calculation of the foldback route is completed according to the route combination, so that a foundation is laid for automatically generating the foldback route table by using the foldback route obtained by calculation.
Further, in one embodiment, step 300 may specifically include:
Step 3001, determining a target field value in a preset reentry route table according to the reentry route and the attribute of each target device forming the reentry route;
step 3002, generating a foldback route table according to the target field value and a preset foldback route table;
Wherein the target field value comprises at least one of the following:
Station name, route number, route data, route name, route property, auto-turn button, annunciator, and auto-turn instruction.
Optionally, the data information of the turn-back route table includes target field contents such as "station name", "route number", "route name", "route property", "automatic turn-back button", "annunciator", "automatic turn-back description", etc., but whether the judgment condition constituting the turn-back route can be satisfied, and a large amount of information such as track section attribute, station line design, etc. is involved.
According to the invention, all routes within the range of each interlocking centralized station are calculated firstly, then route combinations capable of forming the turning-back route are identified through turning-back route judgment conditions, finally, target field values (comprising 'station name', 'route number', 'route name', 'route property', 'automatic turning-back button', 'annunciator', 'automatic turning-back description') in a preset turning-back route table are calculated according to the turning-back route and the attribute of each target device forming the turning-back route, and the calculated target field values are filled in the preset turning-back route table to obtain a final turning-back route table, specifically:
station name: the initial signal machine of the return route 1 has the attribute of the interlocking centralized station to which the initial signal machine of the return route 1 belongs, and the interlocking centralized station to which the initial signal machine of the return route 1 belongs is a group of 'station name' data of the automatic return route.
Route number: when the program identifies all routes within the range of one interlocking centralized station, all routes are numbered sequentially according to the route marking sequence principle specified by the company, and a group of route number data of the automatic turning-back route consists of the numbers of a plurality of routes which form the automatic turning-back.
And (3) route: the 'route' data is formed by combining names of a plurality of routes forming a group of automatic turn-back routes;
Route name: the "route name" is the name of the whole group of automatic reentrant routes, and the calculated groups of automatic reentrant routes are named sequentially according to naming rules.
Route properties: the route property of a group of automatic turning-back route is divided into two types of automatic turning-back route and full-automatic turning-back route. For an automatic reentrant route consisting of two reentrant routes, the route attribute is "automatic reentrant route"; for two groups of automatic reentrant circuits, if the starting end signal machines of the reentrant circuits 1 are equal and the ending end signal machines of the reentrant circuits 2 are equal, the two groups of automatic reentrant circuits form a group of full-automatic reentrant circuits, and the characteristic of the reentrant circuits is 'full-automatic reentrant circuits'.
The automatic turning-back button is the name of a control button for controlling the train to turn back and run on the group of automatic turning-back routes in actual running, and the calculated control buttons of the group of automatic turning-back routes are sequentially named according to naming rules.
Signaling machine: the data of the signal machine, namely the name of the signal machine at the beginning end of the turning-back route 1 of a group of automatic turning-back routes, can be automatically generated by recognition;
automatic turn-back description: the data of the automatic turn-back description comprises two types of automatic turn-back before station and automatic turn-back after station, the data can be obtained by judging the platform attribute of the external track section of the starting end signal machine of the turn-back route 1 and the last track section in the turn-back route 1, if the external track section of the starting end signal machine of the turn-back route 1 has the platform attribute, the group of automatic turn-back routes are the automatic turn-back after station, and if the last track section in the turn-back route 1 has the platform attribute, the group of automatic turn-back routes are the automatic turn-back before station.
Automatic foldback route data export: the automatically calculated foldback route is saved in a corresponding data structure, and then different foldback route combinations are exported to the foldback route table of the corresponding interlocking central station by identifying the station name.
The invention provides a standard primitive library which can realize rapid drawing of subway CAD signal plane diagrams. Standard blocks of each target device in the standard primitive library are designed into standard blocks of custom entities by adopting ObjectARX technology, and the standard blocks have perfect attribute information;
the CAD menu bar provides a 'foldback route calculation' function, so that the functions of identifying, reading and foldback route calculation of various equipment primitives in a CAD signal plan view can be realized, and the foldback route calculation result and a target field value obtained by calculation are exported to an Excel preset foldback route table so as to obtain a final foldback route table and the like.
As shown in table 1, the data derived into the reentrant entry table:
TABLE 1
According to the automatic generation method of the foldback route table, all routes in each interlocking centralized station are obtained by identifying the link relation among target devices in the standard primitive library, calculation of the foldback route is completed according to the routes, finally the foldback route table is automatically generated by using the calculated foldback route and the attribute of each target device forming the foldback route, repeated work is reduced, error rate of the foldback route table is reduced, and work efficiency of generating the foldback route table is improved.
According to the automatic generation method of the turn-back route table, the parameters required by calculating the running capacity of the train are acquired through the visualized line station diagram, so that the user can set the parameters related to the running capacity of the train more intuitively, and the user experience is improved.
The following describes the automatic generation system of the reentry route table provided by the invention, and the automatic generation system of the reentry route table and the automatic generation method of the reentry route table described in the following can be correspondingly referred to each other.
Fig. 2 is a schematic structural diagram of the automatic generating system of a reentrant entrance table according to the present invention, as shown in fig. 2, including:
A first determination module 210, a second determination module 211, and a route table generation module 212;
A first determining module 210, configured to determine all routes in each interlocking central station according to the link relationship between each target device in the standard primitive repository;
a second determining module 211 for determining a reentry route among all routes;
the route table generation module 212 is configured to generate a foldback route table according to the foldback route.
According to the automatic generation system of the foldback route table, all routes in each interlocking centralized station are obtained by identifying the link relation among target devices in the standard primitive library, calculation of the foldback route is completed according to the routes, and finally the foldback route table is automatically generated by using the calculated foldback route.
Fig. 3 is a schematic physical structure of an electronic device according to the present invention, where, as shown in fig. 3, the electronic device may include: processor 310, communication interface (communication interface) 311, memory (memory) 312, and bus (bus) 313, wherein processor 310, communication interface 311, memory 312 complete communication with each other through bus 313. The processor 310 may call logic instructions in the memory 312 to perform the following method:
Determining all routes in each interlocking centralized station according to the link relation among target devices in the standard primitive library;
Determining a reentrant route in all routes;
and generating a foldback route table according to the foldback route.
Further, the logic instructions in the memory described above may be implemented in the form of software functional units and stored in a computer-readable storage medium when sold or used as a stand-alone product. Based on this understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, comprising several instructions for causing a computer power supply screen (which may be a personal computer, a server, or a network power supply screen, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a read-only memory (ROM), a random-access memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
Further, the present invention discloses a computer program product comprising a computer program stored on a non-transitory computer readable storage medium, the computer program comprising program instructions which, when executed by a computer, are capable of executing the method for automatically generating a foldback route table provided by the above method embodiments, for example, comprising:
Determining all routes in each interlocking centralized station according to the link relation among target devices in the standard primitive library;
Determining a reentrant route in all routes;
and generating a foldback route table according to the foldback route.
In another aspect, the present invention also provides a non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, is implemented to perform the method for automatically generating a reentrant entrance table provided in the above embodiments, for example, including:
Determining all routes in each interlocking centralized station according to the link relation among target devices in the standard primitive library;
Determining a reentrant route in all routes;
and generating a foldback route table according to the foldback route.
The system embodiments described above are merely illustrative, wherein the elements illustrated as separate elements may or may not be physically separate, and the elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
From the above description of the embodiments, it will be apparent to those skilled in the art that the embodiments may be implemented by means of software plus necessary general hardware platforms, or of course may be implemented by means of hardware. Based on this understanding, the foregoing technical solution may be embodied essentially or in a part contributing to the prior art in the form of a software product, which may be stored in a computer readable storage medium, such as a ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions for causing a computer power screen (which may be a personal computer, a server, or a network power screen, etc.) to perform the method described in the various embodiments or some parts of the embodiments.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and are not limiting; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims (6)

1. An automatic generation method of a foldback route table is characterized by comprising the following steps:
Determining all routes in each interlocking centralized station according to the link relation among target devices in the standard primitive library;
determining a reentrant route of the all routes;
Generating a foldback route table according to the foldback route;
The determining a reentrant circuit of the all circuits includes:
determining a first return route and a second return route of all the routes;
Determining an automatic reentrant access according to the first reentrant access and the second reentrant access;
Determining a full-automatic turning-back route according to the automatic turning-back route, wherein two groups of the automatic turning-back routes form a group of full-automatic turning-back routes;
Determining the reentrant route according to the automatic reentrant route and the full-automatic reentrant route;
the determining a first return route and a second return route of the all routes includes:
determining a first route with a turning-back attribute of the last track section in all routes, and taking the first route as a first turning-back route;
determining whether a target signal machine with the opposite direction to a first starting signal machine of the first route exists in a target end of a last track section in the first route, and if so, taking the target signal machine as a second starting signal machine of a second route;
searching all third routes which take the second starting end signal as the starting end from all routes;
If the fourth route meeting the preset condition exists in all the third routes, the fourth route is used as a second return route;
the target end is determined according to the opposite end of the first starting end signal machine;
The preset conditions include:
The first turnout in the access way and the last turnout of the first turning-back access way belong to the same turnout; and
The first switch is located at a different position than the last switch.
2. The method for automatically generating a foldback route table according to claim 1, wherein the link relation between each target device in the standard primitive library is determined by:
Encapsulating each target device into a standard image block, and establishing the standard image element library, wherein the standard image element library has the attribute of each target device and the association attribute among each target device;
and determining the link relation according to the association attribute.
3. The method of automatically generating a reentry route table according to claim 2, wherein generating a reentry route table from the reentry route comprises:
Determining a target field value in a preset reentry route table according to the reentry route and the attribute of each target device forming the reentry route;
generating a reentrant access table according to a target field value and the preset reentrant access table;
Wherein the target field value includes at least one of the following:
Station name, route number, route data, route name, route property, auto-turn button, annunciator, and auto-turn instruction.
4. An automatic generation system of a reentry route table, comprising: the system comprises a first determining module, a second determining module and a route table generating module;
the first determining module is used for determining all routes in each interlocking centralized station according to the link relation among the target devices in the standard primitive library;
the second determining module is used for determining a reentry route in all routes;
The route table generation module is used for generating a turn-back route table according to the turn-back route;
The determining a reentrant circuit of the all circuits includes:
determining a first return route and a second return route of all the routes;
Determining an automatic reentrant access according to the first reentrant access and the second reentrant access;
Determining a full-automatic turning-back route according to the automatic turning-back route, wherein two groups of the automatic turning-back routes form a group of full-automatic turning-back routes;
Determining the reentrant route according to the automatic reentrant route and the full-automatic reentrant route;
the determining a first return route and a second return route of the all routes includes:
determining a first route with a turning-back attribute of the last track section in all routes, and taking the first route as a first turning-back route;
determining whether a target signal machine with the opposite direction to a first starting signal machine of the first route exists in a target end of a last track section in the first route, and if so, taking the target signal machine as a second starting signal machine of a second route;
searching all third routes which take the second starting end signal as the starting end from all routes;
If the fourth route meeting the preset condition exists in all the third routes, the fourth route is used as a second return route;
the target end is determined according to the opposite end of the first starting end signal machine;
The preset conditions include:
The first turnout in the access way and the last turnout of the first turning-back access way belong to the same turnout; and
The first switch is located at a different position than the last switch.
5. An electronic device comprising a processor and a memory storing a computer program, characterized in that the processor implements the method for automatically generating a reentrant entrance table according to any one of claims 1 to 3 when executing the computer program.
6. A non-transitory computer-readable storage medium having stored thereon a computer program, which when executed by a processor implements a method of automatically generating a reentrant entrance table according to any one of claims 1 to 3.
CN202210613565.1A 2022-05-31 2022-05-31 Automatic generation method and system of foldback route table Active CN114954578B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210613565.1A CN114954578B (en) 2022-05-31 2022-05-31 Automatic generation method and system of foldback route table

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210613565.1A CN114954578B (en) 2022-05-31 2022-05-31 Automatic generation method and system of foldback route table

Publications (2)

Publication Number Publication Date
CN114954578A CN114954578A (en) 2022-08-30
CN114954578B true CN114954578B (en) 2024-04-19

Family

ID=82958690

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210613565.1A Active CN114954578B (en) 2022-05-31 2022-05-31 Automatic generation method and system of foldback route table

Country Status (1)

Country Link
CN (1) CN114954578B (en)

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2001278052A (en) * 2000-03-31 2001-10-10 Kawasaki Heavy Ind Ltd Train planned schedule preparation method and preparation support device
CN104354720A (en) * 2014-10-22 2015-02-18 北京交控科技有限公司 Main line bifurcation region interlocking protection method and system of tramcar
CN104462133A (en) * 2013-09-23 2015-03-25 北京南车时代信息技术有限公司 Automatic generating method and device for interlocking data sheet
CN109552368A (en) * 2018-12-10 2019-04-02 交控科技股份有限公司 Locking sheet automatic generation method and device
JP2020062976A (en) * 2018-10-18 2020-04-23 東日本旅客鉄道株式会社 Train automatic operation system
CN111055889A (en) * 2019-12-12 2020-04-24 浙江众合科技股份有限公司 Dynamic calculation method for train operation path
CN112572549A (en) * 2020-12-22 2021-03-30 卡斯柯信号有限公司 Method for automatically handling shunting route
CN112722018A (en) * 2021-04-06 2021-04-30 上海富欣智能交通控制有限公司 Shunting route midway turning-back processing method and device and electronic equipment
CN113562025A (en) * 2021-06-30 2021-10-29 通号城市轨道交通技术有限公司 Computer interlocking table generation method and device, electronic equipment and storage medium
CN113673021A (en) * 2021-09-28 2021-11-19 杭州路信科技有限公司 Engineering data generation method, platform and computer equipment
CN114021530A (en) * 2021-11-09 2022-02-08 卡斯柯信号有限公司 Method for checking and correcting interlocking table

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6397130B1 (en) * 2000-04-13 2002-05-28 Ensco, Ltd. Multi-sensor route detector for rail vehicle navigation

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2001278052A (en) * 2000-03-31 2001-10-10 Kawasaki Heavy Ind Ltd Train planned schedule preparation method and preparation support device
CN104462133A (en) * 2013-09-23 2015-03-25 北京南车时代信息技术有限公司 Automatic generating method and device for interlocking data sheet
CN104354720A (en) * 2014-10-22 2015-02-18 北京交控科技有限公司 Main line bifurcation region interlocking protection method and system of tramcar
JP2020062976A (en) * 2018-10-18 2020-04-23 東日本旅客鉄道株式会社 Train automatic operation system
CN109552368A (en) * 2018-12-10 2019-04-02 交控科技股份有限公司 Locking sheet automatic generation method and device
CN111055889A (en) * 2019-12-12 2020-04-24 浙江众合科技股份有限公司 Dynamic calculation method for train operation path
CN112572549A (en) * 2020-12-22 2021-03-30 卡斯柯信号有限公司 Method for automatically handling shunting route
CN112722018A (en) * 2021-04-06 2021-04-30 上海富欣智能交通控制有限公司 Shunting route midway turning-back processing method and device and electronic equipment
CN113562025A (en) * 2021-06-30 2021-10-29 通号城市轨道交通技术有限公司 Computer interlocking table generation method and device, electronic equipment and storage medium
CN113673021A (en) * 2021-09-28 2021-11-19 杭州路信科技有限公司 Engineering data generation method, platform and computer equipment
CN114021530A (en) * 2021-11-09 2022-02-08 卡斯柯信号有限公司 Method for checking and correcting interlocking table

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
基于ObjectARX的联锁表自动生成方法研究;董云清;黄平霞;;铁道通信信号(07);全文 *
确定基本进路和变更进路的方法;林炳龙;;铁路通信信号工程技术(01);全文 *

Also Published As

Publication number Publication date
CN114954578A (en) 2022-08-30

Similar Documents

Publication Publication Date Title
CN109552368B (en) Automatic interlocking table generation method and device
CN113562025B (en) Computer interlocking table generation method and device, electronic equipment and storage medium
CN102935853B (en) Tracking method of self-adaptive trains in complicated turnout state
CN107798991A (en) A kind of electronic map Gradient generation method
CN108749859B (en) Train dispatching centralized control system and control method
CN110203259B (en) CTC route control method for automatic turn-back operation of inter-city railway
CN109491735B (en) Integrated data generation and verification integrated monitoring human-computer interface configuration implementation method
CN111003030A (en) Method and device for generating temporary speed limit message test case of train control system
CN109760720B (en) Method and device for automatically generating interface code bit table based on signal plane layout diagram
CN112660208A (en) System key parameter generation method and device based on electronic map data
CN112381277B (en) Outgoing line distribution method for connecting multiple lines and connecting high-speed railway junction station
CN115123345B (en) Method, system, device, controller and medium for determining mobile authorization range
CN110962889B (en) Automatic route selection and arrangement method and device for head yard vehicle
CN111645731A (en) Automatic generation method, system and device of responder message
CN106294294B (en) Rail traffic signal system unifies the consistency desired result method of formatted data file
CN114954578B (en) Automatic generation method and system of foldback route table
CN112257211B (en) Track beacon data generation method and device
CN103678743A (en) Subway limit drawing method
CN113282978A (en) Method for generating railway station signal plane layout diagram based on BIM model
CN115480575B (en) Railway transportation path planning method, device, storage medium and equipment
CN114655282B (en) Train operation scheme optimization method and system
CN113609627B (en) Line topology design method and device for modularized track traffic
US20220242470A1 (en) Managing, monitoring, and validating train consists
CN111661112B (en) Opposite dispersion type train running direction adapting method and system
CN113836612A (en) Equipment associated information extraction method and device, electronic equipment and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant