Interlocking system route searching method and device

Abstract

The invention discloses a route searching method and device for an interlocking system. The method comprises the following steps: acquiring a route searching command for a target station yard; wherein the route search command comprises a route starting end and a route terminal; according to the obtained route searching command, route searching is carried out from the route starting end to the route terminal based on the route compiling file of the target station yard so as to obtain a route; wherein the path compiling file of the target station yard is obtained by searching all feasible lines in the target station yard and compiling a search result into structured data, and each feasible line comprises an identifier of a node corresponding to equipment passed by the feasible line and attribute information of the identifier. Therefore, instant starting can be realized based on the generated route data, manual configuration of designers is not needed, and the efficiency bottleneck caused by the fact that route information depends on manual design is solved.

Description

Technical Field

[0001] This article relates to train control technology, and more particularly to a route search method and device for an interlocking system. Background Technology

[0002] The interlocking system uses technical means to establish safety constraints between turnouts, routes, and signals, ensuring safe and reliable train operation.

[0003] In an interlocking system, route information is the core input data for achieving safety constraints. The system dynamically establishes a logical relationship between turnout positions, route arrangements, and signal displays based on the route information.

[0004] However, in related technologies, route information relies on designers to design and manually configure it, which hinders the application of interlocking systems. Summary of the Invention

[0005] This application provides a method and apparatus for route search in an interlocking system, which can automatically generate routes, thereby effectively solving the efficiency bottleneck caused by the reliance on manual design for route information in related technologies.

[0006] This application provides a route search method for an interlocking system, the method comprising: Obtain a route search command for the target station; wherein the route search command includes: route start point and route end point; Based on the obtained route search command and the path compilation file of the target station, a route search is performed from the beginning of the route to the end of the route to obtain a route; The path compilation file for the target station is obtained by searching all feasible routes in the target station and compiling the search results into structured data. Each feasible route includes: the identifier and attribute information of the node corresponding to the equipment traversed by the feasible route.

[0007] This application embodiment also provides a route search device for an interlocking system, including: a memory and a processor, wherein the memory is used to store an executable program; The processor is used to read and execute the executable program, and to perform the route search method for the interlocking system as described above.

[0008] This application provides a method and apparatus for route searching in an interlocking system. The method includes: acquiring a route search command for a target station; wherein the route search command includes: a route start point and a route end point; based on the acquired route search command and a path compilation file of the target station, performing a route search from the route start point to the route end point to obtain a route; wherein the path compilation file of the target station is obtained by searching all feasible routes in the target station and compiling the search results into structured data, and each feasible route includes: the identifier and attribute information of the nodes corresponding to the equipment traversed by the feasible route. Therefore, routes can be generated automatically, allowing the interlocking system to be activated immediately based on the generated route data, without relying on manual configuration by designers, thereby effectively solving the efficiency bottleneck caused by the reliance on manual design for route information, and significantly improving the application efficiency and real-time response capability of the interlocking system.

[0009] Other features and advantages of this application will be set forth in the following description, and will be apparent in part from the description, or may be learned by practicing the application. Other advantages of this application can be realized and obtained by means of the embodiments described in the description and the accompanying drawings. Attached Figure Description

[0010] The accompanying drawings are used to provide an understanding of the technical solutions of this application and constitute a part of the specification. They are used together with the embodiments of this application to explain the technical solutions of this application and do not constitute a limitation on the technical solutions of this application.

[0011] Figure 1 This is a flowchart illustrating a route search method for an interlocking system according to an embodiment of this application. Figure 2 This is a schematic diagram illustrating the process of generating a path compilation file according to an embodiment of this application; Figure 3 This is a schematic diagram illustrating a node setting method according to an embodiment of this application; Figure 4 This is a schematic diagram illustrating another node setting method according to an embodiment of this application; Figure 5 This is a schematic diagram illustrating another node setting method according to an embodiment of this application; Figure 6 This is a schematic diagram of a feasible path according to an embodiment of this application; Figure 7 This is a schematic flowchart of a route search method for an interlocking system according to an embodiment of this application; Figure 8 This is a schematic diagram of the structure of a route search device for an interlocking system according to an embodiment of this application; Figure 9 This is a schematic diagram of the structure of a route search device for an interlocking system according to an embodiment of this application. Detailed Implementation

[0012] This application describes several embodiments, but these descriptions are exemplary and not limiting, and it will be apparent to those skilled in the art that many more embodiments and implementations are possible within the scope of the embodiments described herein. Although many possible combinations of features are shown in the drawings and discussed in the detailed description, many other combinations of the disclosed features are also possible. Unless specifically limited, any feature or element of any embodiment may be used in combination with, or may replace, any feature or element of any other embodiment.

[0013] This application includes and contemplates combinations of features and elements known to those skilled in the art. The embodiments, features, and elements disclosed in this application can also be combined with any conventional features or elements to form unique inventive solutions. Any feature or element of any embodiment can also be combined with features or elements from other inventive solutions to form another unique inventive solution. Therefore, it should be understood that any feature shown and / or discussed in this application can be implemented individually or in any suitable combination. Therefore, the embodiments are not limited except by the limitations imposed by the appended claims and their equivalents. Furthermore, various modifications and changes can be made within the scope of the appended claims.

[0014] Furthermore, in describing representative embodiments, the specification may have presented methods and / or processes as a specific sequence of steps. However, the method or process should not be limited to the specific order of steps described herein, to the extent that it does not depend on such a specific order. As will be understood by those skilled in the art, other sequences of steps are also possible. Therefore, the specific order of steps set forth in the specification should not be construed as a limitation of the claims. Moreover, the claims concerning the method and / or process should not be limited to the steps performed in the written order, and those skilled in the art will readily understand that these orders can be varied and still remain within the spirit and scope of the embodiments of this application.

[0015] Interlocking systems are a core technological means to ensure the safe, reliable, and efficient operation of trains, effectively preventing traffic accidents. Through technical means, they establish interlocking relationships between switches, routes, and signals according to strict logical procedures and safety conditions, ensuring that trains follow the correct and conflict-free operating path within the station.

[0016] With the rapid development of rail transit and high-speed rail technology, the number of railway construction projects both domestically and internationally is constantly increasing, and the application environment of interlocking systems is becoming increasingly complex. The interlocking requirements differ across different lines and countries and regions, and operating conditions vary, placing higher demands on the adaptability, safety, and reliability of the systems.

[0017] In an interlocking system, route generation is a crucial step in ensuring the orderly operation of trains. A route refers to a train's path within a station yard, from a starting signal to an ending signal. Its establishment requires meeting a series of interlocking conditions, including correct turnout positions, clear sections, and the absence of opposing routes. The interlocking system assesses these conditions in real time to ensure the safe locking and correct opening of routes.

[0018] Interlocking systems have evolved from 6502 electrical centralized interlocking and relay interlocking to modern computer interlocking. Current computer interlocking systems, with their higher processing speed, stronger security, and better maintainability, have become the mainstream technical solution. Internally, the system abstracts field physical equipment into logical entities, describes equipment attributes and topological relationships through static information, reflects the real-time status of equipment using dynamic information, and completes the entire process control, including route selection, locking, unlocking signals, and subsequent unlocking.

[0019] In the face of increasingly complex operational needs and diversified technical standards, how to efficiently and accurately generate routes that comply with safety regulations has become an important direction for improving the intelligence level of interlocking systems.

[0020] Therefore, embodiments of this disclosure provide a route search method for an interlocking system, such as... Figure 1 As shown, the method includes: Step 100: Obtain the route search command for the target station; wherein the route search command includes: route start and route end; Step 101: Based on the obtained route search command and the path compilation file of the target station, perform route search from the beginning of the route to the end of the route to obtain the route; The path compilation file for the target station is obtained by searching all feasible routes in the target station and compiling the search results into structured data. Each feasible route includes: the identifier and attribute information of the node corresponding to the equipment traversed by the feasible route.

[0021] The route search command can be issued by the host computer when a route needs to be generated.

[0022] Structured data refers to data with a standardized format, typically presented in tabular form. Its row and column organization facilitates searching, processing, and analysis in databases or spreadsheets. It has the following characteristics: highly organized—data is clearly divided into predefined fields (columns) and records (rows); easily machine-readable—computer programs can easily parse and process this data; and directly usable for analysis—due to its neat format, it can be directly analyzed using query languages ​​such as SQL or statistical software.

[0023] The method for route search in an interlocking system provided in this application embodiment obtains a route search command for a target station. The route search command includes a route start point and a route end point. Based on the obtained route search command and a path compilation file for the target station, a route search is performed from the route start point to the route end point to obtain a route. The path compilation file for the target station is obtained by searching all feasible routes in the target station and compiling the search results into structured data. Each feasible route includes the identifier and attribute information of the nodes corresponding to the equipment traversed by the feasible route. Therefore, routes can be generated automatically, allowing the interlocking system to be activated immediately based on the generated route data, without relying on manual configuration by designers. This effectively solves the efficiency bottleneck caused by reliance on manual design for route information, significantly improving the application efficiency and real-time response capability of the interlocking system.

[0024] In one exemplary instance, before obtaining the route search command for the target station, such as Figure 2 As shown, the method further includes: Step 200: Obtain the electronic drawing of the target station on the drawing interface; wherein, the electronic drawing of the target station is obtained by drawing the equipment in the engineering drawing of the target station according to a preset scale based on the layout of the engineering drawing of the target station; Step 201: Based on the position of each device on the drawing interface in the electronic drawing of the target station, obtain the position information of each device and the connection relationship between the device and the surrounding devices. Step 202: Based on the obtained location information of each device and the connection relationship between the device and the surrounding devices, perform node mapping on all devices in the target site, and generate a node topology map based on the mapped nodes. Step 203: Based on the generated node topology map, perform a feasible route search to obtain all feasible paths within the target station. Step 204: Compile the identifiers and attribute information of the nodes corresponding to the devices along all feasible paths into structured data to obtain the path compilation file of the target station.

[0025] The drawing interface can pre-store graphics of various potentially needed equipment. For example, special railway interlocking system signal layout diagrams contain special equipment such as double-headed turnouts, single-headed turnouts, and diamond intersections, as shown in the figure for some of their signal layout diagrams. To ensure consistency in the station diagrams drawn by engineers, double-headed turnouts, single-headed turnouts, and diamond intersections, which originally required manual assembly, are now available as selectable options in the toolbar.

[0026] The double-spinning turnout consists of four turnouts. The "Spinning / Crossing" option on the interface of each turnout is "Yes" by default, and the "Associated Other Turnout" is configured by the engineers. There are two combination options to choose from.

[0027] A single-section turnout is assembled from two turnouts and two sections. The "Separate or Not" option on the turnout interface is "Yes" by default, and the "Single-Separation Section Name" on the section interface is configured by the engineer. There are four combination options to choose from.

[0028] The diamond intersection is assembled from two segments, and the "intersection segment name" of each segment interface is configured by the engineers. There are three combination options to choose from.

[0029] A node topology diagram is a graphical representation of the connections between nodes (such as signals, sections, and switches) in a network. It visually illustrates the network structure, helping people understand the physical or logical layout of the network and how data flows. Creating a node topology diagram typically involves the following elements: Node: Represents a physical device in the network, such as a signal, section, or turnout.

[0030] Links: These represent connections between nodes, and are typically represented by lines in a topology graph.

[0031] Tags: Add descriptive information to nodes and links, such as node name, link direction, etc., to better identify the function and role of each element.

[0032] Layers and distribution: Depending on the actual network architecture, it may need to exhibit a hierarchical structure (such as core layer, aggregation layer, access layer) or a distributed layout.

[0033] Traffic direction: In some cases, it may also be necessary to specify the direction in which data packets are transmitted in the network.

[0034] In one exemplary instance, the equipment includes: a signal, a turnout, and a track section. The signal includes: a physical signal and a virtual signal. The turnout includes: a physical turnout and a virtual turnout. The virtual turnout is located at the bend of the physical turnout. In step 202 above, the step of mapping all equipment in the target station yard according to the obtained location information of each device and the connection relationship between the device and surrounding devices includes: Based on the obtained location information of each device and the connection relationship between the device and surrounding devices, the path change points and the bending points of physical turnouts are determined, and the virtual signal is set at the determined path change points and the virtual turnout is set at the determined bending points of physical turnouts. Map all physical signal controllers and all virtual signal controllers to nodes of signal type, respectively; Map all physical turnouts and all virtual turnouts to nodes of turnout type respectively; Map all segments to nodes of segment type.

[0035] The entire station's internal space is described using nodes. Nodes are arranged hierarchically according to the station's shape, and each node is defined with a unique identifier. All nodes are ordered sequentially (1 to N), forming static node data. The principles for setting up nodes are as follows: 1) Location of the signal a) All signals (including virtual signals, i.e., virtual signals are set up where routes are changed) correspond to one signal node.

[0036] In railway signaling systems, the control logic of equipment such as turnouts, sections, and signals is typically designed in a hierarchical manner, for example, divided into "turnout layer," "section layer," and "signal layer." This hierarchical structure facilitates modular management, but if there is a lack of interaction mechanisms between layers, logical information cannot be communicated.

[0037] To this end, the virtual node 1DCXJD is introduced. Its core function is to break down the barriers between layers through logical mapping and realize cross-layer information interaction: it can not only allow the control logic of the turnout to "penetrate" to the section layer, but also allow the section state (such as S4) to "inversely affect" the control conditions of the turnout layer, thereby supporting more complex and coordinated system-level interlocking logic.

[0038] In short, the addition of the virtual node 1DCXJD is to enable the "turnout logic" and "section S4 logic" to interact at a unified logical level. This node is set at the "bend node" of the turnout, acting as a virtual bridge to effectively connect the originally isolated inter-layer logic.

[0039] 2) Location of turnout b) Each turnout corresponds to a turnout node. c) Figure 3A diagram illustrating how to configure nodes is shown below. Figure 3 In the example shown, in addition to 1DCJD (i.e., turnout node 1), a virtual turnout node 1DCXJD (i.e., virtual turnout node 1) is also required at the bend node 1. This virtual turnout node is on the same layer as S4, realizing cross-layer linking of nodes.

[0040] 3) Location of the section When defining or drawing the logical structure of a section's location, its connection order with adjacent switches and signals must be clearly defined. This order cannot be arbitrarily reversed, as it represents the train's direction of travel and the interlocking logic's dependencies.

[0041] In one exemplary instance, step 202 above, which involves generating a node topology graph based on the mapped nodes, includes: The location information of the corresponding node is determined based on the location information of each device, and the connection relationship between the corresponding node and its neighboring nodes is determined based on the connection relationship between each device and its neighboring devices. Obtain the attribute information of each device, determine the attribute information of its corresponding node based on the attribute information of each device, and generate an attribute identifier based on this. The node topology graph is generated based on the connection relationship between each node and its surrounding nodes, as well as the attribute identifier of each node.

[0042] In railway signaling system design, a systematic approach can be used to construct an accurate node topology model, ensuring complete consistency between the physical equipment and the logical model. The specific process is as follows: First, based on the actual spatial coordinates of each physical device in the station (such as signal positions, turnout coordinates, and the start and end points of track sections), the spatial position of its corresponding node in the logical model is accurately determined. This step ensures the consistency between the system visualization and the actual station layout, avoiding logical errors caused by positional deviations.

[0043] Secondly, analyze the physical connection relationship between each device and its surrounding adjacent devices (such as the connection between turnouts and track sections, and the interlocking relationship between signals and track sections) to determine the connection topology between logical nodes. For example, the connection relationship of forward turnouts is expressed as "turnout node → turnout section node", while that of reverse turnouts is expressed as "turnout section node → turnout node". This subtle difference directly affects the correctness of the interlocking logic.

[0044] Third, collect the characteristic parameters of each device (such as signal type, turnout model, track section length, etc.), convert them into node attribute information, and generate standardized attribute identifiers. These identifiers not only contain basic device information, but also implicitly contain the device's functional positioning and logical role in the system.

[0045] Finally, based on the connections between nodes and the attribute identifiers of each node, we automatically generate a complete node topology diagram. This diagram not only visually presents the logical connections between devices, but also clarifies the functional characteristics of each node through attribute identifiers, providing a precise basis for interlocking logic verification, system debugging, and subsequent maintenance.

[0046] This process ensures a seamless transition from the physical world to the logical model, which is the foundation for realizing a "safe, reliable, and verifiable" railway signaling system, and a key prerequisite for system upgrades and expansions.

[0047] The attribute identifiers generated in the above process can be represented as follows: 1. Signal Node XJZ: Indicates the direction of entry into the station in the down direction; it can be used as the starting point or the destination. XCZ: Indicates the outbound direction, which can be used as the starting point or the destination; XCZE: Indicates the direction of exiting the station. It cannot be the beginning of the exit, but only the end of the entrance. SJZ: Indicates the upward direction of entry into the station; it can be used as the starting point or the destination. SCZ: Indicates the upward exit direction, which can be used as the starting point or the destination; XCZE: Indicates the direction of exiting the station upwards. It cannot be the beginning of the exit, but only the end of the entry. XJD: Indicates shunting in the middle of the downhill direction of entry. It can only be used as the starting point or for changes, but not as the destination. XCD: Indicates shunting in the downstream departure direction. It can only be used as the starting point or for changes, but not as the destination. SJD: Indicates shunting in the middle of the upward direction of entering the station. It can only be used as the starting point or for changes, but not as the destination. SCD: Indicates shunting in the middle of the upward departure direction. It can only be used as the starting point or for changes, but not as the destination. XOLE: Indicates the endpoint of the downlink OL signal. This setting is required when the OL signal does not end at the reverse signal. SOLE: Indicates the end point of the upper type OL. It needs to be set when the OL does not end at the reverse signal.

[0048] 2. Turnout node DXXS: Indicates the upward turnout node; DXXX: Indicates a downward turnout node; SXXS: Indicates a forward-facing turnout node; SXXX: Indicates a forward-downward turnout node.

[0049] 3. Section Nodes DCQD: Indicates a section node containing turnouts, which may include sections with diamond intersections; WCQD: Indicates only nodes in the non-branch section; JCQDAX: indicates a segment node that contains only diamond-shaped intersections; JCQDCX: indicates a segment node that contains only diamond-shaped intersections.

[0050] The node configuration rules in the above process are as follows: 1. Node Configuration Direction Principles Node configuration must strictly follow the train's direction of travel, using a "from station to section" sequence. This rule ensures that the logical flow is completely consistent with the actual direction of travel, which is the foundation for the safe operation of the interlocking system. For example, the node sequence for the outbound direction should be "station signal → track → section signal," while for the inbound direction it should be "section signal → track → station signal."

[0051] 2. Track and non-intersection section configuration specifications For station tracks equipped with differential signals (two signals arranged back-to-back) or continuous sections without branch lines: This section should serve as the starting or ending point of the logical path and must be configured with an EndNode; the two differential signals need to be configured to be interconnected to ensure route integrity and interlocking safety; this configuration ensures that both the tracks within the station and the ends of the section have clear boundary nodes, avoiding logical blind spots.

[0052] For example, the track between differential signals A and B is configured as "Signal A (starting point) → Track end point → Signal B (ending point)". 3. Rules for the location and connection of turnout sections The turnout section (DG) must be precisely positioned at the turnout tip to accurately reflect the track electrical division and interlocking relationships. Its connection to the turnout node follows strict rules: For forward turnouts, the logical configuration order is: turnout node → DG node, and the connection direction is: turnout node points to DG node, such as... Figure 4 Middle Section 9: Turnout 9 → DG9; For opposing turnouts, the logical configuration order is: DG node → turnout node, and the connection direction is: DG node points to turnout node, such as... Figure 4 Middle Section 5: DG5 → Turnout 5; Section 729T must be configured at the tip of turnout 729W to ensure that the physical position corresponds completely to the logical position.

[0053] 4. Cross-layer connection mechanism To achieve interlocking and connection between different logical layers (such as turnout layer and section layer), virtual turnout nodes are used as inter-layer bridges.

[0054] The configuration rule is to create a virtual opposite turnout node (e.g., 729'W) at the end of the layer containing the forward turnout; the connection method is that the straight strand of the virtual node points to the end of the current layer, and the curved strand of the virtual node connects to the forward turnout node of the next layer (e.g., 729W); the function is to achieve a smooth transition between layers and ensure the continuity of the route logic. Figure 5 As shown, a virtual node 729'W is configured at the end of the first layer, and its curved strand connects to the second layer forward turnout 729W, forming a logical path of "first layer → 729'W → second layer". The corresponding feasible path diagram can be seen as follows. Figure 6 As shown.

[0055] In one exemplary instance, the feasible route search based on the generated node topology map to obtain all feasible paths within the target station includes: Select any track from the target station as the current track, and perform the following linked list generation operation until the linked list generation operation is performed on the last track of the target station. Based on the first direction linked list and the second direction linked list of all tracks, obtain all feasible paths in the target station. The linked list generation operation includes: Starting from the current track, configure a node linked list along the first direction according to the attribute identifier of the node in the node topology graph to obtain the first direction linked list of the current track, and configure the linked list along the second direction to obtain the second direction linked list of the current track; select any other track from the target station as the new current track, and continue to execute the linked list generation operation; Wherein, the first direction is any direction of the current track, and the second direction is the direction opposite to the first direction.

[0056] In one exemplary instance, The node includes: an index pointing to the next node; the configuration process of the first direction linked list of the current channel and the second direction linked list of the channel follows the following rules: For forward turnouts, the section type nodes are configured first, and the turnout type nodes are configured second, and the index of the section type node pointing to the next node points to the turnout type node. For opposing turnouts, the turnout type node is configured first, and the section type node is configured second, and the index used by the turnout type node to point to the next node points to the turnout type section node.

[0057] After the nodes are arranged, they need to be linked in a specific direction before the turnout to form a unidirectional node linked list. To optimize the system search efficiency, the configuration order should be selected according to the direction with fewer branches of the opposing turnout. Usually, the departure direction of the station meets this condition, so the NEXT node order is configured according to the departure direction.

[0058] The configuration starts from the starting point of the track and strictly follows the departure direction to organize the node sequence. Figure 5 As shown, SIL (train signal) → SID (departure signal) → 9# (turnout number) → 9DG (turnout section) → 5DG (section) → 5# (turnout) → X (terminal) → end node.

[0059] In one exemplary instance, the step of compiling the identifiers and attribute information of the nodes corresponding to the devices traversed by each feasible path into structured data to obtain the path compilation file for the target station includes: Obtain the node identifier and attribute identifier of each node traversed by each feasible path; The node identifier and attribute identifier of each node traversed by each feasible path are populated according to a predefined structured data format; The filled structured data is integrated and compiled to obtain the path compilation file of the target station.

[0060] Structured data can be shown in Table 1: Table 1

[0061] In one exemplary instance, the route search command includes: a route search start point, a route search end point, and a route search direction. The step of performing a route search from the route start point to the route end point based on the obtained route search command and the path compilation file of the target station to obtain a route includes: In the route search command, if the route search start point and route search terminal are signals in the same direction and the route search terminal is not configured with an associated back-to-back node, a route search is performed from the route search start point to the route search terminal according to the route search direction of the route search command to obtain a route; In the route search command, if the route search start point and route search terminal are signal machines in the same direction, and the route search terminal is configured with associated back-to-back nodes, the associated back-to-back nodes configured with the route search terminal are used as new route search terminals. Route search is performed from the route search start point to the new route search terminal in the route search direction of the route search command to obtain a route.

[0062] In one exemplary instance, the route search command includes: a route search start point, a route search end point, and a route search direction. The step of performing a route search from the route start point to the route end point based on the obtained route search command and the path compilation file of the target station to obtain a route includes: If the route search start point and route search terminal are reverse signals in the route search command, and the route search terminal is not configured with an associated back-to-back node, then it is determined that a route search cannot be performed. In the route search command, if the route search start point and route search terminal reverse signal are configured, and the route search terminal is configured with associated back-to-back nodes, the associated back-to-back nodes configured with the route search terminal are taken as the new route search start point, the route search start point is taken as the new route search terminal, and the route search is performed in the opposite direction to the route search direction of the route search command. The branchless section outside the new search terminal signal is included in the searched route to obtain the final route.

[0063] The route search method for interlocking systems provided in this application proposes a technical approach based on graphical modeling and automatic logic analysis to support the efficient and accurate generation of train routes in complex station environments. This method employs C++ object-oriented design principles, constructing the station layout in a fully graphical manner. It intuitively expresses the spatial relationships and connection logic of key equipment such as signals, turnouts, and track sections, without relying on tabular data input.

[0064] The system interactively draws station maps, automatically analyzes the geometric connections and topology between equipment, and generates accurate node topology maps, providing fundamental support for route search and analysis. Based on this, and combined with interlocking logic rules, the system determines turnout positions, section occupancy status, and opposing route constraints in real time, automatically identifying legal start-end signal combinations to achieve structured route generation and feasibility verification.

[0065] This method transforms the physical station layout into a computable logical model, significantly improving the automation and safety of route generation, ensuring that route paths comply with interlocking safety specifications, and providing a reliable basis for train operation control. Through graphical modeling and intelligent logic derivation, it effectively adapts to station environments with multiple scenarios and standards, promoting the intelligent development of interlocking systems in the route generation stage.

[0066] The route search method for the interlocking system provided in this application embodiment constructs a system that serves as the core platform for the implementation of railway interlocking engineering. With "graphical configuration" as its core concept, it deeply integrates station map drawing with automatic route logic generation, forming intelligent route generation software specifically for the implementation of railway signaling engineering.

[0067] This method employs object-oriented technology and is developed based on the Windows system. The entire process, from drawing station map elements to generating route logic, is encapsulated through classes. The system provides a bilingual (Chinese and English) user interface for users both domestically and internationally, supporting intuitive and efficient graphical interaction. Users can directly complete equipment layout and connection on the station map without importing original data tables. The system provides real-time feedback on equipment status and path relationships, exhibiting high real-time performance, accuracy, readability, and ease of operation. It effectively solves the problems of complex processes and high workload caused by reliance on cumbersome data import in traditional tools.

[0068] Based on the actual location and physical connections of station equipment, the system automatically identifies and generates train routes. Simultaneously, it constructs a unidirectional node chain based on the direction of travel, automatically generating a node topology diagram reflecting the interlocking logic of the equipment. By simplifying the user interface and optimizing the generation process, the system significantly improves the automation level of route generation, solving the problems of time-consuming, error-prone, and inefficient manual deduction in route design.

[0069] In summary, the route search method for interlocking systems provided in this application significantly simplifies the route design process, improves route generation efficiency, and shortens the system integration cycle; it ensures the correctness and integrity of route logic, improves engineering quality, reduces the risk of human error, and reduces manpower input and production costs. Simultaneously, this method enhances the automation and intelligence level of the route generation process, strengthens the system's scalability and maintainability, and achieves standardization, visualization, and efficiency in the implementation of railway signaling engineering, thus achieving the expected technical effects and application goals.

[0070] The route search method for the interlocking system provided in this application embodiment can be as follows: Figure 7 As shown, the process starts from "Start". First, it proceeds to the next step by "Create a new station map" or "Open an existing station map". Then, it executes "Create signal equipment" and "Configure equipment parameters" in sequence. After completing the core content of the station map drawing, it enters the "Generate and view equipment connection relationship" step, and then "Generate route information" based on this. Next, it is necessary to "Save the station map" to ensure data retention. Then, it "Generate node topology map". Finally, it proceeds to "End" through the "Output interlocking data" step, completing the relevant operations and data output of the entire station map.

[0071] Corresponding to the route search method of the interlocking system described above, this application also provides a route search device for the interlocking system. Figure 8 This is a schematic diagram of the structure of a route search device for an interlocking system provided in an embodiment of this application, as shown below. Figure 8 As shown, the route search device of the interlocking system includes: The acquisition module 31 is used to acquire route search commands for the target station; wherein, the route search commands include: route start and route end; The processing module 32 is used to perform a route search from the beginning of the route to the end of the route based on the obtained route search command and the path compilation file of the target station to obtain a route; The path compilation file for the target station is obtained by searching all feasible routes in the target station and compiling the search results into structured data. Each feasible route includes: the identifier and attribute information of the node corresponding to the equipment traversed by the feasible route.

[0072] In one exemplary instance, the acquisition module 31 is further configured to: The electronic drawings of the target station are obtained on the drawing interface; wherein the electronic drawings of the target station are based on the layout of the engineering drawings of the target station and the equipment therein is drawn according to a preset scale; Based on the position of each device on the drawing interface in the electronic drawing of the target station, obtain the position information of each device and the connection relationship between the device and the surrounding devices; The processing module 32 is further configured to: Based on the obtained location information of each device and the connection relationship between the device and the surrounding devices, the nodes of all devices in the target site are mapped, and a node topology map is generated based on the mapped nodes. Based on the generated node topology map, a feasible route search is performed to obtain all feasible paths within the target station. The identifiers and attribute information of the nodes corresponding to the devices along all feasible paths are compiled into structured data to obtain the path compilation file of the target station.

[0073] In one exemplary instance, the device includes: a signal, a turnout, and a track section; the signal includes: a physical signal and a virtual signal; the turnout includes: a physical turnout and a virtual turnout; the virtual turnout is located at the bend of the physical turnout; the processing module 32 is further configured to: Based on the obtained location information of each device and the connection relationship between the device and surrounding devices, the path change points and the bending points of physical turnouts are determined, and the virtual signal is set at the determined path change points and the virtual turnout is set at the determined bending points of physical turnouts. Map all physical signal controllers and all virtual signal controllers to nodes of signal type, respectively; Map all physical turnouts and all virtual turnouts to nodes of turnout type respectively; Map all segments to nodes of segment type.

[0074] In one exemplary instance, the processing module 32 is further configured to: The location information of the corresponding node is determined based on the location information of each device, and the connection relationship between the corresponding node and its neighboring nodes is determined based on the connection relationship between each device and its neighboring devices. Obtain the attribute information of each device, determine the attribute information of its corresponding node based on the attribute information of each device, and generate an attribute identifier based on this. The node topology graph is generated based on the connection relationship between each node and its surrounding nodes, as well as the attribute identifier of each node.

[0075] In one exemplary instance, the processing module is further configured to: Select any track from the target station as the current track, and perform the following linked list generation operation until the linked list generation operation is performed on the last track of the target station. Based on the first direction linked list and the second direction linked list of all tracks, obtain all feasible paths in the target station. The linked list generation operation includes: Starting from the current track, configure a node linked list along the first direction according to the attribute identifier of the node in the node topology graph to obtain the first direction linked list of the current track, and configure the linked list along the second direction to obtain the second direction linked list of the current track; select any other track from the target station as the new current track, and continue to execute the linked list generation operation; Wherein, the first direction is any direction of the current track, and the second direction is the direction opposite to the first direction.

[0076] In one exemplary instance, the node includes: an index for pointing to the next node; the configuration process of the first direction linked list of the current channel and the second direction linked list of the channel follows the following rules: For forward turnouts, the section type nodes are configured first, and the turnout type nodes are configured second, and the index of the section type node pointing to the next node points to the turnout type node. For opposing turnouts, the turnout type node is configured first, and the section type node is configured second, and the index used by the turnout type node to point to the next node points to the turnout type section node.

[0077] In one exemplary instance, the processing module 32 is further configured to: Obtain the node identifier and attribute identifier of each node traversed by each feasible path; The node identifier and attribute identifier of each node traversed by each feasible path are populated according to a predefined structured data format; The filled structured data is integrated and compiled to obtain the path compilation file of the target station.

[0078] In one exemplary instance, the route search command includes: a route search start point, a route search end point, and a route search direction; the processing module 32 is further configured to: In the route search command, if the route search start point and route search terminal are signals in the same direction and the route search terminal is not configured with an associated back-to-back node, a route search is performed from the route search start point to the route search terminal according to the route search direction of the route search command to obtain a route; In the route search command, if the route search start point and route search terminal are signal machines in the same direction, and the route search terminal is configured with associated back-to-back nodes, the associated back-to-back nodes configured with the route search terminal are used as new route search terminals. Route search is performed from the route search start point to the new route search terminal in the route search direction of the route search command to obtain a route.

[0079] In one exemplary instance, the route search command includes: a route search start point, a route search end point, and a route search direction; the processing is further used for: If the route search start point and route search terminal are reverse signals in the route search command, and the route search terminal is not configured with an associated back-to-back node, then it is determined that a route search cannot be performed. In the route search command, if the route search start point and route search terminal reverse signal are configured, and the route search terminal is configured with associated back-to-back nodes, the associated back-to-back nodes configured with the route search terminal are taken as the new route search start point, the route search start point is taken as the new route search terminal, and the route search is performed in the opposite direction to the route search direction of the route search command. The branchless section outside the new search terminal signal is included in the searched route to obtain the final route.

[0080] This application also provides a route search device for an interlocking system, such as... Figure 9 As shown, it includes: memory 400 and processor 410; The memory 400 is connected to the processor 410 and is used to store programs; The processor 410 is used to implement the route search method of the interlocking system described in any of the above embodiments by running the program in the memory 400.

[0081] Specifically, the aforementioned electronic device may also include: a bus, a communication interface 420, an input device 430, and an output device 440.

[0082] The processor 410, memory 400, communication interface 420, input device 430, and output device 450 are interconnected via a bus. Among them: A bus can include a pathway for transmitting information between various components of a computer system.

[0083] The processor 410 can be a general-purpose processor, such as a general-purpose central processing unit (CPU), a microprocessor, etc., or an application-specific integrated circuit (ASIC), or one or more integrated circuits used to control the execution of the program of the present invention. It can also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), an off-the-shelf programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components.

[0084] Processor 410 may include a main processor, as well as a baseband chip, modem, etc.

[0085] The memory 400 stores a program that executes the technical solution of this invention, and may also store an operating system and other key business functions. Specifically, the program may include program code, which includes computer operation instructions. More specifically, the memory 400 may include read-only memory (ROM), other types of static storage devices capable of storing static information and instructions, random access memory (RAM), other types of dynamic storage devices capable of storing information and instructions, disk storage, flash memory, etc.

[0086] Input device 430 may include a device for receiving user input data and information, such as a keyboard, mouse, camera, scanner, light pen, voice input device, touch screen, pedometer, or gravity sensor.

[0087] Output device 450 may include devices that allow information to be output to a user, such as a display screen, printer, speaker, etc.

[0088] The communication interface 420 may include a device that uses any transceiver to communicate with other devices or communication networks, such as Ethernet, Radio Access Network (RAN), Wireless Local Area Network (WLAN), etc.

[0089] The processor 410 executes the program stored in the memory 400 and calls other devices, which can be used to implement the various steps of the route search method for any interlocking system provided in the above embodiments of this application.

[0090] In addition to the methods and devices described above, embodiments of this application may also be computer program products, which include computer program instructions that, when executed by a processor, cause the processor to perform the steps in the route search method for the interlocking system according to various embodiments of this application as described in any of the above embodiments of this specification.

[0091] The computer program product can be written in any combination of one or more programming languages ​​to perform the operations of the embodiments of this application. The programming languages ​​include object-oriented programming languages ​​such as Java and C++, as well as conventional procedural programming languages ​​such as C or similar languages. The program code can be executed entirely on the user's computing device, partially on the user's computing device, as a standalone software package, partially on the user's computing device and partially on a remote computing device, or entirely on a remote computing device or server.

[0092] Furthermore, this application also provides a storage medium storing a computer program, which, when executed by a processor, implements the path search method for the interlocking system described in any of the above embodiments.

[0093] It will be understood by those skilled in the art that all or some of the steps, systems, or apparatuses disclosed above, and their functional modules / units, can be implemented as software, firmware, hardware, or suitable combinations thereof. In hardware implementations, the division between functional modules / units mentioned above does not necessarily correspond to the division of physical components; for example, a physical component may have multiple functions, or a function or step may be performed collaboratively by several physical components. Some or all components may be implemented as software executed by a processor, such as a digital signal processor or microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit (ASIC). Such software may be distributed on a computer-readable medium, which may include computer storage media (or non-transitory media) and communication media (or transient media). As is known to those skilled in the art, the term "computer storage medium" includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data). Computer storage media include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technologies, CD-ROM, digital versatile disc (DVD) or other optical disc storage, magnetic cartridges, magnetic tape, disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and can be accessed by a computer. Furthermore, it is well known to those skilled in the art that communication media typically contain computer-readable instructions, data structures, program modules, or other data in modulated data signals such as carrier waves or other transmission mechanisms, and may include any information delivery medium.

Claims

1. A route search method for an interlocking system, characterized in that, The method includes: Obtain a route search command for the target station; wherein the route search command includes: route start point and route end point; Based on the obtained route search command and the path compilation file of the target station, a route search is performed from the beginning of the route to the end of the route to obtain a route; The path compilation file for the target station is obtained by searching all feasible routes in the target station and compiling the search results into structured data. Each feasible route includes: the identifier and attribute information of the node corresponding to the equipment traversed by the feasible route.

2. The method according to claim 1, characterized in that, Before obtaining the route search command for the target station, the method further includes: The electronic drawings of the target station are obtained on the drawing interface; wherein the electronic drawings of the target station are based on the layout of the engineering drawings of the target station and the equipment therein is drawn according to a preset scale; Based on the position of each device on the drawing interface in the electronic drawing of the target station, obtain the position information of each device and the connection relationship between the device and the surrounding devices; Based on the obtained location information of each device and the connection relationship between the device and the surrounding devices, the nodes of all devices in the target site are mapped, and a node topology map is generated based on the mapped nodes. Based on the generated node topology map, a feasible route search is performed to obtain all feasible paths within the target station. The identifiers and attribute information of the nodes corresponding to the devices along all feasible paths are compiled into structured data to obtain the path compilation file of the target station.

3. The method according to claim 2, characterized in that, The equipment includes: signals, turnouts, and track sections. The signals include: physical signals and virtual signals. The turnouts include: physical turnouts and virtual turnouts. The virtual turnouts are located at the bends of the physical turnouts. The step of mapping all equipment in the target station yard based on the obtained location information of each device and its connection relationship with surrounding devices includes: Based on the obtained location information of each device and the connection relationship between the device and surrounding devices, the path change points and the bending points of physical turnouts are determined, and the virtual signal is set at the determined path change points and the virtual turnout is set at the determined bending points of physical turnouts. Map all physical signal controllers and all virtual signal controllers to nodes of signal type, respectively; Map all physical turnouts and all virtual turnouts to nodes of turnout type respectively; Map all segments to nodes of segment type.

4. The method according to claim 3, characterized in that, The generation of a node topology graph based on the mapped nodes includes: The location information of the corresponding node is determined based on the location information of each device, and the connection relationship between the corresponding node and its neighboring nodes is determined based on the connection relationship between each device and its neighboring devices. Obtain the attribute information of each device, determine the attribute information of its corresponding node based on the attribute information of each device, and generate an attribute identifier based on this. The node topology graph is generated based on the connection relationship between each node and its surrounding nodes, as well as the attribute identifier of each node.

5. The method according to claim 2, characterized in that, The feasible route search based on the generated node topology map yields all feasible paths within the target station, including: Select any track from the target station as the current track, and perform the following linked list generation operation until the linked list generation operation is performed on the last track of the target station. Based on the first direction linked list and the second direction linked list of all tracks, obtain all feasible paths in the target station. The linked list generation operation includes: Starting from the current track, configure a node linked list along the first direction according to the attribute identifier of the node in the node topology graph to obtain the first direction linked list of the current track, and configure the linked list along the second direction to obtain the second direction linked list of the current track; select any other track from the target station as the new current track, and continue to execute the linked list generation operation; Wherein, the first direction is any direction of the current track, and the second direction is the direction opposite to the first direction.

6. The method according to claim 5, characterized in that, The node includes: an index pointing to the next node; the configuration process of the first direction linked list of the current channel and the second direction linked list of the channel follows the following rules: For forward turnouts, the section type nodes are configured first, and the turnout type nodes are configured second, and the index of the section type node pointing to the next node points to the turnout type node. For opposing turnouts, the turnout type node is configured first, and the section type node is configured second, and the index used by the turnout type node to point to the next node points to the turnout type section node.

7. The method according to claim 2, characterized in that, The step of compiling the identifiers and attribute information of the nodes corresponding to the devices traversed by each feasible path into structured data to obtain the path compilation file of the target station includes: Obtain the node identifier and attribute identifier of each node traversed by each feasible path; The node identifier and attribute identifier of each node traversed by each feasible path are populated according to a predefined structured data format; The filled structured data is integrated and compiled to obtain the path compilation file of the target station.

8. The method according to claim 1, characterized in that, The route search command includes: a route search start point, a route search end point, and a route search direction. The step of performing a route search from the route start point to the route end point based on the obtained route search command and the path compilation file of the target station to obtain a route includes: In the route search command, if the route search start point and route search terminal are signals in the same direction and the route search terminal is not configured with an associated back-to-back node, a route search is performed from the route search start point to the route search terminal according to the route search direction of the route search command to obtain a route; In the route search command, if the route search start point and route search terminal are signal machines in the same direction, and the route search terminal is configured with associated back-to-back nodes, the associated back-to-back nodes configured with the route search terminal are used as new route search terminals. Route search is performed from the route search start point to the new route search terminal in the route search direction of the route search command to obtain a route.

9. The method according to claim 1, characterized in that, The route search command includes: a route search start point, a route search end point, and a route search direction. The step of performing a route search from the route start point to the route end point based on the obtained route search command and the path compilation file of the target station to obtain a route includes: If the route search start point and route search terminal are reverse signals in the route search command, and the route search terminal is not configured with an associated back-to-back node, then it is determined that a route search cannot be performed. In the route search command, if the route search start point and route search terminal reverse signal are specified, and the route search terminal is configured with associated back-to-back nodes, then the associated back-to-back nodes configured with the route search terminal are taken as the new route search start point, the route search start point is taken as the new route search terminal, and the route search is performed in the opposite direction to the route search direction specified in the route search command. The branchless section outside the new search terminal signal is included in the searched route to obtain the final route.

10. A route search device for an interlocking system, characterized in that, include: A memory and a processor, wherein the memory is used to store an executable program; The processor is used to read and execute the executable program, and to perform the route search method for the interlocking system as described in any one of claims 1-9.

Images