An Automatic Verification Method for the Integrity of Order-Receiving Points of Scheduling Commands Based on a Tree Diagram

Abstract

The present invention discloses a method for automatically verifying the integrity of recipients of dispatching commands based on a tree diagram, which is applied to the field of rail transit technology. This method constructs a tree diagram model of a subgraph by means of a retrieval method, a pruning method, and a branching method in combination with the connection relationship of the subgraph (i.e., the dispatching sub-section). When a dispatching command is received, the recipient information and the station sequence are parsed, and the expected station sequence is determined in combination with the subgraph connection relationship information and the recipient information provided by the tree diagram model, and the integrity of the parsed station sequence is verified. The verification process is no longer restricted by the dispatching command template, which improves the accuracy of verification while allowing the train dispatcher to respond to emergencies more quickly, reducing errors caused by human factors such as fatigue, negligence, or subjective judgment, and providing technical support for the safe and compliant operation of the train dispatching system.

Description

Technical Field

[0001] The present invention relates to the technical field of rail transit, and particularly to an automatic verification method for the integrity of recipients of dispatching orders based on a tree diagram. Background Art

[0002] The train dispatcher is the organizer and commander of the train operation work in the dispatching section. In the daily dispatching of the railway system, the dispatching section is divided into multiple different sub-sections as shown in Figure 1 shown. Figure 1 The sub-sections in are connected to each other through the connecting stations marked by Station 4, Station 8, and Station 11. The trains within each sub-section are uniformly managed and dispatched by the train dispatcher. The connecting stations are located at the junctions of different sub-sections and play the role of hubs. The connecting stations can belong to multiple adjacent sub-sections to ensure the smooth transfer of trains between different sections.

[0003] When emergency handling, line equipment inspection, replacement or repair are required within the dispatching section, the train dispatcher is responsible for, according to the construction plan or emergency handling requirements, using the special program for dispatching orders to process the affected stations as the recipients of the dispatching orders, and transmitting relevant precautions to the stations in the form of network communication, coordinating multiple types of work such as trains, locomotives, track maintenance, signal and communication, and rolling stock within the dispatching section and organizing construction work and maintenance work. During the period affected by emergencies or the implementation of the construction plan, the running speed of trains on some lines within the dispatching section is restricted or trains are completely prohibited from passing, and normal train operation conditions are not available. The train dispatcher needs to quickly evaluate the emergencies or plan adjustments, clarify their scope of influence and severity, verify and check the affected stations within the dispatching section according to the information provided by other types of work and the line conditions of the sub-sections, and prevent the situation of missing or misissuing the recipients of the orders.

[0004] The existing integrity verification technology for the recipients of dispatching orders can be summarized as a comprehensive technical process. First, the relationship between the dispatching order template and the recipients associated with the power supply arm and the section line is constructed through the database to ensure that the recipients can be accurately and quickly selected by the train dispatcher in the form of recipient groups on the special program for dispatching orders; at the same time, a multi-position control and audit mechanism is adopted, and multiple audits and authorizations are carried out through the position audit terminal, the sub-module for judging the authorization identifier, and the authorized terminal to ensure that the information of the recipients of the dispatching orders is verified and correct by multiple positions; finally, the train dispatcher follows the general practice of issuing dispatching orders, conducts transfer confirmation, repeat verification, and clarifies the recipients of the dispatching orders to ensure that the orders can be directly conveyed to the relevant recipients, further improving the accuracy of the conveyance of the dispatching orders.

[0005] However, in actual train dispatching work, the database relationship established by the prior art between the dispatching order template and the associated order-receiving points lacks flexibility. When affected by emergencies, there may be a mismatch between the associated order-receiving points of the template and the stations actually affected. In addition, the multi-position control and review mechanism requires frequent communication and coordination among multiple positions, which not only increases the complexity and time cost of issuing dispatching orders, but may also lead to misunderstandings or conflicts during the review process due to information transmission errors. Especially in the case of emergencies, the multi-position control and review mechanism may become an obstacle to rapid response, affecting the overall efficiency of dispatching order issuance. Finally, the general practice of dispatching order issuance highly relies on the experience of relevant personnel in the train dispatching position. In the case of emergencies, it is easily affected by human factors such as fatigue, negligence, or subjective judgment, resulting in transmission errors or omissions, leading to deviations or inconsistencies in execution.

[0006] In addition, although there are currently integrity verification schemes for other information. For example, the Chinese invention patent "A LKJ Data File Handover System and Method" with the authorization announcement number CN115906114B and the Chinese invention patent "A Fixture Implementation Method for Compatible Multi-Model Railway CIR Program Upgrades" with the authorization announcement number CN114936037B both include integrity verification schemes, but they are not applicable to the integrity verification of dispatching order receiving points.

[0007] In view of this, the present invention is specifically proposed. Summary of the Invention

[0008] The object of the present invention is to provide a method for automatically verifying the integrity of dispatching order receiving points based on a tree diagram, which can automatically verify the receiving points according to the station sequence provided by the dispatching order, achieve the effect of automatically determining whether a dispatching order is missed or misissued, reduce mistakes caused by human factors such as fatigue, negligence, or subjective judgment, and improve the accuracy of train dispatchers in verifying dispatching orders.

[0009] The object of the present invention is achieved through the following technical solutions:

[0010] A method for automatically verifying the integrity of dispatching order receiving points based on a tree diagram, comprising:

[0011] For each sub - figure in the base map of the operation diagram, a corresponding tree - shaped diagram model is constructed. Each sub - figure contains the connection information of all stations in a section. Each sub - figure is numbered separately, and each sub - figure serves as a node in the tree - shaped diagram model and is labeled with the corresponding sub - figure number. The construction process of the tree - shaped diagram model for a single sub - figure includes: Step A1: Using the single sub - figure as the current node, execute the retrieval method to obtain other sub - figures that have a connection relationship with the current node; Step A2: For a single retrieved other sub - figure, determine whether pruning is to be performed through the pruning method. If so, go to Step A3; if not, go to Step A4; Step A3: Execute the pruning operation, continue to read the next retrieved other sub - figure, and go to Step A2; Step A4: Determine whether to create a new branch through the branching method. If not, continue to read the next retrieved other sub - figure and go to Step A2. If so, construct the single other sub - figure as a new node, use the new node as the current node, continue to execute the retrieval method, pruning method, and branching method. After completion, use the parent node of the new node, that is, the node corresponding to the single sub - figure, as the current node, continue to read the next retrieved other sub - figure, and go to Step A2 until all the retrieved other sub - figures of the single sub - figure are processed, obtaining the tree - shaped diagram model of the single sub - figure, which contains the connection relationship between the single sub - figure and other sub - figures; Obtain the complete sub - figure connection relationship information by integrating the tree - shaped diagram models of all sub - figures;

[0012] After receiving the dispatching order, parse out the starting station, ending station corresponding to the order - receiving point, and the station sequence; Determine the station numbers of the starting station and the ending station respectively, and the sub - figure to which they belong. Combine the complete sub - figure connection relationship information to determine the expected station sequence, and judge whether the order - receiving point in the dispatching order passes the integrity check according to whether the determined expected station sequence is consistent with the parsed station sequence.

[0013] It can be seen from the technical solution provided by the present invention described above that the tree - shaped diagram model of the sub - figure is constructed through the retrieval method, pruning method, and branching method in combination with the connection relationship of the sub - figure (i.e., the dispatching sub - section); When receiving a dispatching order, parse out the order - receiving point information and the station sequence, combine the sub - figure connection relationship information provided by the tree - shaped diagram model and the order - receiving point information to determine the expected station sequence, and perform an integrity check on the parsed station sequence. The check process is no longer restricted by the dispatching order template, improving the accuracy of the check while allowing the train dispatcher to respond to emergencies faster, reducing mistakes caused by human factors such as fatigue, negligence, or subjective judgment, and providing technical support for the safe and compliant operation of the train dispatching system. Brief Description of the Drawings

[0014] To more clearly illustrate the technical solutions of the embodiments of the present invention, the following will briefly introduce the drawings required for the description of the embodiments. Obviously, the drawings in the following description are only some embodiments of the present invention. For those of ordinary skill in the art, without creative efforts, other drawings can also be obtained based on these drawings.

[0015] Figure 1 Schematic diagram of the connection relationship of the scheduling sub-sections provided for the background technology of the present invention;

[0016] Figure 2 Flowchart of a method for automatically verifying the integrity of the receiving points of scheduling commands based on a tree diagram provided for an embodiment of the present invention;

[0017] Figure 3 Schematic diagram of the base map of the operation diagram of the scheduling section provided for an embodiment of the present invention;

[0018] Figure 4 Schematic diagram of the method for obtaining the station sequence of the same sub-graph provided for an embodiment of the present invention;

[0019] Figure 5 Schematic diagram of the method for obtaining the station sequence across sub-graphs provided for an embodiment of the present invention;

[0020] Figure 6 Schematic diagram of the tree diagram model of the base map of the operation diagram provided for an embodiment of the present invention;

[0021] Figure 7 Overall flowchart of the construction of the tree diagram model provided for an embodiment of the present invention;

[0022] Figure 8 Flowchart of automatically verifying the integrity of the receiving points provided for an embodiment of the present invention;

[0023] Figure 9 Schematic diagram of the tree diagram model of 5 sub-graphs provided for an embodiment of the present invention. Detailed implementation manners

[0024] The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, rather than all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

[0025] First, the following explanations will be made for the terms that may be used in this article:

[0026] Descriptions using terms such as "comprising", "including", "containing", "having" or other similar semantics shall be construed as non-exclusive inclusion. For example, including a technical feature element (such as raw materials, components, ingredients, carriers, dosage forms, materials, dimensions, parts, components, mechanisms, devices, steps, processes, methods, reaction conditions, processing conditions, parameters, algorithms, signals, data, products or articles, etc.) shall be construed as not only including the explicitly listed technical feature element, but also including other technical feature elements known to those skilled in the art that are not explicitly listed.

[0027] The term "consisting of" means excluding any technical feature element not explicitly listed. If this term is used in a claim, it will make the claim a closed type, so that it does not include technical feature elements other than the explicitly listed ones, except for conventional impurities related thereto. If this term only appears in a sub-clause of a claim, then it only limits the elements explicitly listed in that sub-clause, and the elements recorded in other sub-clauses are not excluded from the overall claim.

[0028] The following provides a detailed description of an automatic verification method for the integrity of recipients of dispatching commands based on a tree diagram provided by the present invention. Contents not described in detail in the embodiments of the present invention belong to the prior art well-known to those skilled in the art. For those conditions not specified in the embodiments of the present invention, they are carried out according to the conventional conditions in the art or the conditions recommended by the manufacturer. For the reagents or instruments not specified in the production manufacturers in the embodiments of the present invention, they are all conventional products that can be obtained through commercial purchase.

[0029] As Figure 1 shown, it is a flowchart of an automatic verification method for the integrity of recipients of dispatching commands based on a tree diagram provided by an embodiment of the present invention, which mainly includes the following steps:

[0030] Step 1: Construct corresponding tree diagram models for each sub-diagram in the running diagram base map, and obtain complete sub-diagram connection relationship information by integrating the tree diagram models of all sub-diagrams.

[0031] In the embodiments of the present invention, corresponding tree diagram models are constructed for each sub-diagram (dispatching sub-section) in the running diagram base map. Each sub-diagram contains the connection information of all stations in a section. Each sub-diagram is numbered separately, and each sub-diagram serves as a node in the tree diagram model and is marked with the corresponding sub-diagram number.

[0032] The construction process of the tree diagram model of a single sub-diagram includes:

[0033] Step A1: Take the single sub-diagram as the current node, execute the retrieval method, and obtain other sub-diagrams having a connection relationship with the current node.

[0034] Step A2: For a single retrieved other sub - graph, determine whether pruning is to be performed through a pruning method. If so, proceed to Step A3; if not, proceed to Step A4.

[0035] In one embodiment, determining whether pruning is to be performed through a pruning method includes: by executing a method for obtaining a cross - sub - graph station sequence and combining with the absolute relationship sequence of the current node, determining the station sequence between the sub - graph corresponding to the current node and the single other sub - graph; if the station sequence contains only one station, pruning operation is required, that is, the corresponding single other sub - graph is not constructed as a new node, and proceed to Step A3 for processing; if the station sequence contains more than one station, no pruning operation is performed, and proceed to Step A4 for processing; or, if the length of the absolute relationship sequence of the current node is less than 2, no pruning operation is performed, and also proceed to Step A3 for processing; wherein, the absolute relationship sequence lists all the nodes passed from the root node of the tree - shaped graph model to the current node, and the root node of the tree - shaped graph model is the sub - graph to which the tree - shaped graph model belongs.

[0036] Step A3: Perform the pruning operation, continue to read the next retrieved other sub - graph, and proceed to Step A2.

[0037] Step A4: Determine whether to create a new branch through a branching method. If not, continue to read the next retrieved other sub - graph and proceed to Step A2. If so, construct the single other sub - graph as a new node, and use the new node as the current node. Then continue to execute the retrieval method, pruning method, and branching method. After completion, use the parent node of the new node, that is, the node corresponding to the single sub - graph, as the current node, continue to read the next retrieved other sub - graph, and proceed to Step A2 until all the retrieved other sub - graphs of the single sub - graph are completely processed, obtaining the tree - shaped graph model of the single sub - graph, which contains the connection relationship between the single sub - graph and other sub - graphs.

[0038] In one embodiment, determining whether to create a new branch through a branching method includes: checking whether the absolute relationship sequence of the current node contains the single other sub - graph. If it contains, do not create a new branch; if it does not contain, create a new branch, that is, construct the single other sub - graph as a new node.

[0039] All sub - graphs construct corresponding tree - shaped graph models in the above - mentioned manner, and comprehensive connection relationship information of all sub - graphs is obtained by integrating the tree - shaped graph models of all sub - graphs.

[0040] In one embodiment, an initial node may be set in the initial stage. By executing a retrieval method, all subgraphs having a connection relationship with the initial node are obtained, wherein each subgraph in the underlying graph of the running graph is in a connection relationship with the initial node; the initial node is set as the current node, the first subgraph is read, and a tree graph model corresponding to the first subgraph is constructed according to the construction process of the tree graph model of the single subgraph; then the initial node is set as the current node again, the next retrieved subgraph is continuously read, and a tree graph model corresponding to the next subgraph is constructed according to the construction process of the tree graph model of the single subgraph, and the process is continuously repeated until the tree graph model corresponding to the last subgraph is constructed.

[0041] Step 2: Automatically perform integrity verification on the receiving points of the dispatching commands in combination with the complete subgraph connection relationship information.

[0042] In an embodiment of the present invention, after receiving a dispatching command, the starting station and the ending station corresponding to the receiving point, as well as the station sequence, are parsed; the station numbers of the starting station and the ending station respectively, and the subgraphs to which they belong are determined. In combination with the complete subgraph connection relationship information, an expected station sequence is determined, and whether the receiving point in the dispatching command passes the integrity verification is judged according to whether the determined expected station sequence is consistent with the parsed station sequence.

[0043] In one embodiment, the determining the expected station sequence in combination with the complete subgraph connection relationship information includes:

[0044] According to the subgraphs to which the starting station and the ending station respectively belong, it is judged whether they are stations in the same subgraph;

[0045] If so, in combination with the complete subgraph connection relationship information, by executing the method for obtaining the station sequence of the same subgraph, the expected station sequence is determined;

[0046] If not, according to the subgraphs to which the starting station and the ending station respectively belong, an absolute relationship sequence is obtained from the complete subgraph connection relationship information. The obtained absolute relationship sequence contains all subgraph corresponding nodes with the subgraph to which the starting station belongs as the root node and the subgraph to which the ending station belongs as the ending subgraph; then the absolute relationship sequence is set as the starting group, the ending group, and multiple connection groups, and each group contains starting subgraph, current subgraph, and ending subgraph information, wherein the number of connection groups is the length of the absolute relationship sequence minus 2. If the length of the absolute relationship sequence is less than 3, there is no connection group; for the connected subgraphs, by executing the method for obtaining the station sequence of the same subgraph, a part of the expected station sequence is determined; for the starting group and the ending group, the remaining parts of the expected station sequence are respectively determined by executing the method for obtaining the station sequence across subgraphs.

[0047] In one embodiment, the method for obtaining the cross-subgraph station sequence includes: determining all the stations passed through when entering the current subgraph from the starting subgraph and leaving the current subgraph from the ending subgraph according to the starting subgraph, the current subgraph, and the ending subgraph information; wherein, when the method for obtaining the cross-subgraph station sequence is applied in the pruning method process, the starting subgraph, the current subgraph, and the ending subgraph information respectively correspond to the penultimate item, the last item, and the single other subgraph of the absolute relationship sequence.

[0048] In one embodiment, the method for obtaining the same-subgraph station sequence includes: determining all the stations between the starting station and the ending station according to the serial numbers of the starting station and the ending station and the number of the subgraph to which they belong.

[0049] In order to more clearly show the technical solutions provided by the present invention and the technical effects produced, the following uses specific embodiments to describe in detail the methods provided by the embodiments of the present invention.

[0050] I. Working principle of the integrity check of the order receiving points of dispatching orders.

[0051] 1. Introduction to relevant information of the basic graph of the train operation diagram.

[0052] In train dispatching work, the train dispatcher edits and issues the train operation plan on the basic graph of the train operation diagram. The basic graph of the train operation diagram is a two-dimensional image on a plane, as Figure 3 shown. The horizontal axis of the basic graph of the train operation diagram represents time, and its time span is 24 hours; the vertical axis represents space, specifically showing each sub-section, station, and track in the dispatching section. Figure 3 The basic graph of the train operation diagram shown and the Figure 1 shown connection relationship diagram satisfy a one-to-one correspondence relationship and can be divided into multiple subgraphs for representation. Each subgraph can show the train operation plan in a specific section. On the basic graph of the train operation diagram, as long as the number of the subgraph and the station serial number are given at the same time, each station on the basic graph can be accurately located. Thus, the information in Figure 3 can also be equivalently expressed as the parameter table shown in Table 1. Taking Figure 3 as an example, given that the subgraph number is 3 and the station serial number is 2, the corresponding station is Station 9; similarly, given that the subgraph number is 2 and the station serial number is 3, the corresponding station is Station 6. Figure 1 Stations 4, 8, and 11 in Figure 3 are marked multiple times in the subgraph shown.

[0053] Table 1: Parameter table of the basic graph of the train operation diagram in the dispatching section

[0054]

[0055] 2. Method for obtaining the station sequence.

[0056] In the base map of the train operation diagram for a dispatching section, stations satisfy the continuous relationship within each sub - diagram. To completely obtain all stations within a given continuous range, the present invention proposes two methods for batch - obtaining station information within a sub - diagram and storing it as a station sequence: (1) the method for obtaining the station sequence within the same sub - diagram, and (2) the method for obtaining the station sequence across sub - diagrams; these two methods will be used in the integrity verification process introduced later.

[0057] (1) The method for obtaining the station sequence within the same sub - diagram. The method for obtaining the station sequence within the same sub - diagram is as Figure 4 shown, and is used to query the station sequence under the conditions of a given starting station and ending station within the same sub - diagram. During the execution of this method, three parameters are received: the current sub - diagram number, the starting station number, and the ending station number. Its function is to obtain all stations between the starting station number and the ending station number in the sub - diagram number, and sort these stations according to the station number and store them as a sequence.

[0058] (2) The method for obtaining the station sequence across sub - diagrams.

[0059] The method for obtaining the station sequence across sub - diagrams is as Figure 5 shown, and is used to query the station sequence between two connected stations in different sub - diagrams. The method first identifies all connected stations between the current sub - diagram and the adjacent sub - diagram. Connected station 1 is the station with the smallest station number among all connected stations, and connected station 2 is the station with the largest station number among all connected stations. Then, with connected station 1 as the starting station and connected station 2 as the ending station, the station sequence under the conditions of the starting station and the ending station within the same sub - diagram is obtained. During the execution of this method, three parameters are received: the current sub - diagram number, the starting sub - diagram number, and the ending sub - diagram number. Its function is to obtain all stations passing through from the starting sub - diagram into the current sub - diagram and leaving the current sub - diagram from the ending sub - diagram, and sort these stations according to the station number and store them as a sequence.

[0060] 3. Construct a tree - shaped diagram model.

[0061] In the base map of the train operation diagram for a dispatching section, multiple sub - diagrams are interconnected through connected stations. Starting from any specific sub - diagram, one can jump to other relevant sub - diagrams through the connected stations as transfer points, and further expand to more sub - diagrams. Through this logical connection relationship between sub - diagrams, the connection relationship of the dispatching sub - sections represented by the base map of the operation diagram can be constructed into a tree - shaped diagram model of the base map of the operation diagram as Figure 6 shown. The 4 tree - shaped diagram models in Figure 6 correspond to the sub - diagrams in Figure 3 . Each node in the tree - shaped diagram is marked with an information identifier, and the information identifier is an absolute relationship sequence. The absolute relationship sequence lists the numbers of all sub - diagrams passed through from the root node of the tree - shaped diagram to the ending sub - diagram.

[0062] Figure 6Each dashed box in it represents a tree diagram model corresponding to a sub - graph. The nodes in the tree diagram model are the relevant sub - graphs. Figure 6 The numbers of the sub - graphs are used to label the corresponding sub - graphs. For example, the upper - left dashed box is sub - Figure 1 the corresponding tree diagram model, sub - Figure 1 is used as the root node. Therefore, the root node is directly labeled as 1. The root node is connected to sub - Figure 2 Therefore, sub - Figure 1 is connected to sub - Figure 2 and there is a connection line between the corresponding nodes 1 and 2. And the absolute relationship sequence of the node 2 corresponding to sub - Figure 2 is {1, 2}, which represents the numbers of all sub - graphs (all nodes) passed from the root node (i.e., sub - Figure 1 ) to the terminating sub - graph (i.e., sub - Figure 2 ).

[0063] Considering that the sub - graph and the node are in a corresponding relationship, and all sub - graphs are numbered and labeled with sub - graph numbers in the tree diagram model. Therefore, for the convenience of intuitively understanding the solution of the present invention, in the following description, the sub - graph numbers are directly used for description.

[0064] The overall process of constructing the tree diagram model for the base map of the train operation diagram in the present invention is as Figure 7 shown. The process will sequentially call the retrieval method, the branching method, and the pruning method, and determine the next operation according to the execution result of each step, and finally complete the construction of the tree diagram.

[0065] Figure 7 The overall flow chart shown first sets the initial node as the current node. After the process executes the retrieval method for the current node, all sub - graph numbers that satisfy the connectivity relationship are obtained. Then, the sub - graph numbers are read one by one and the pruning method and the branching method are executed. The pruning method is used to remove invalid branches, and the branching method is used to add new child nodes to the current node. After the new node is created in the branching method, the process sets the new node as the current node and executes the retrieval method. The retrieval result of the parent node after the new branch is created will be stored in the cache. After the retrieval results of the new branch are completely traversed, the retrieval process of the remaining sub - graph numbers will continue. If the current node has traversed all the retrieval results, the parent node is set as the current node and its retrieval result is loaded, and the traversal process of the upper level of the tree diagram continues until the process returns to the initial node and ends.

[0066] The specific contents of the retrieval method, the pruning method, and the branching method involved in the above process are described in detail as follows:

[0067] (1) Retrieval method.

[0068] The retrieval method finds all subgraph numbers that satisfy the connectivity relationship with the current node as the retrieval result of the current node. The basis for judging the connectivity relationship is whether there is a connecting station between the retrieved subgraph and the subgraph corresponding to the current node. In Figure 7 In the process shown, the initial node is defaultly connected to all subgraphs.

[0069] (2)Pruning method.

[0070] The pruning method executes the method for obtaining the sequence of stations across subgraphs for the current node. The starting subgraph number, the current subgraph number, and the ending subgraph number of the method respectively correspond to the penultimate item, the last item of the absolute relationship sequence of the current node, and a retrieval result of the current node (that is, a single other subgraph mentioned above). If the returned sequence of stations is equal to 1 station, it means that the starting subgraph and the ending subgraph can be directly connected without passing through the current subgraph, so the pruning operation should be executed, and the node corresponding to the ending subgraph number parameter (that is, a retrieval result of the current node) should not be newly created. If the returned sequence of stations is greater than 1 station, it means that the starting subgraph and the ending subgraph must be connected through the current subgraph, so the pruning operation should not be executed, and the node corresponding to the ending subgraph number may be newly created. If the length of the absolute relationship sequence is less than 2, the pruning operation should not be executed due to the lack of relevant parameters for the starting subgraph and the ending subgraph.

[0071] (3)Branching method.

[0072] The branching method checks whether the retrieval result of the current node already exists in the absolute relationship sequence. If the retrieval result does not exist in the absolute relationship sequence, the retrieval result is constructed as a newly created node, the absolute relationship sequence of the newly created node is updated, the retrieval result of the parent node of the current node is cached, and then the newly created node is set as the current node. If the retrieval result exists in the absolute relationship sequence, no new branch is created, and the next retrieval result is continued to be checked.

[0073] After all the tree graph models are constructed, the complete subgraph connection relationship information can be obtained. For example, the absolute relationship sequences corresponding to all the tree graph nodes are stored in the subgraph connection relationship table shown in Table 2, and the data in Table 2 is constructed according to the Figure 6 shown tree graph model.

[0074] Table 2: Subgraph connection relationship table

[0075]

[0076] 4. Automatic verification of the integrity of the receiving point.

[0077] During the impact of emergencies or the execution of construction plans, the automatic verification process of the receiving point in the present invention automatically parses the starting station name, the ending station name, and the station sequence information selected by the train dispatcher on the dedicated dispatching order program in the order text according to the dedicated dispatching order program. After obtaining the information, execute as Figure 8 shown in the verification process, automatically verify the stations affected within the dispatching section, and automatically determine that the verification fails if there is a situation of missing or incorrect issuance.

[0078] Figure 8 The process shown first converts the starting station name and the ending station name into corresponding subgraph numbers and station numbers according to the base map information of the operation diagram in the dispatching section. If the subgraph numbers of the starting station and the ending station are the same, execute the method for obtaining the station sequence of the same subgraph, and load the obtained station sequence as the expected station sequence. If the subgraph numbers of the starting station and the ending station are different, according to the subgraph numbers of the starting station and the ending station, obtain the absolute relationship sequence from the subgraph connection relationship table. The obtained absolute relationship sequence contains all the corresponding nodes of the subgraphs with the subgraph to which the starting station belongs as the root node and the subgraph to which the ending station belongs as the ending subgraph. For example, the subgraph to which the starting station belongs is sub Figure 3 , and the subgraph to which the ending station belongs is sub Figure 2 , then obtain the absolute relationship sequence {3, 2} through the above subgraph connection relationship table; then set the absolute relationship sequence as the starting group, the ending group, and multiple connection groups, and each cross-subgraph group contains the starting subgraph, the current subgraph, and the ending subgraph information.

[0079] The setting method of the cross-subgraph group and the station sequence loading method are shown in Table 3. The number of connection groups is the length of the absolute relationship sequence minus 2. If the number of subgraph numbers included (i.e., the length of the absolute relationship sequence) is less than 3, there is no connection group.

[0080] Table 3: Setting method and loading method of cross-subgraph groups

[0081]

[0082] Figure 8 The process shown traverses the cross-subgraph groups and executes the method for obtaining the station sequence of the subgraph across them, loads the obtained station sequence into the expected station sequence, and compares whether the expected station sequence is consistent with the station sequence selected by the train dispatcher on the dedicated dispatching order program. If the two are consistent, automatically determine that the verification passes; otherwise, it means that there is a situation of missing or incorrect issuance in the dispatching order, and automatically determine that the verification fails.

[0083] The above solution provided by the embodiments of the present invention constructs the operation diagram base map into a tree diagram model, automatically verifies the order-receiving points according to the station information provided by the dedicated dispatching order program, and achieves the effect of automatically determining whether the dispatching order is missed or misissued. The beneficial effects brought by the automatic verification method for the integrity of dispatching order receiving points can be summarized as follows:

[0084] (1) Reduce mistakes caused by human factors such as fatigue, negligence or subjective judgment, and improve the accuracy of train dispatchers in verifying dispatching orders;

[0085] (2) Allow train dispatchers to quickly respond to emergencies within the dispatching section, reduce the time cost of issuing dispatching orders, and improve the overall efficiency of issuing dispatching orders.

[0086] II. Example introduction.

[0087] For the sake of easy understanding, an example is introduced below. In this example, based on the operation diagram base map parameters of dispatching section 1 shown in Table 4, a tree diagram model is constructed and the order-receiving points are automatically verified. Dispatching section 1 is divided into 7 sub-diagrams, and there are connecting stations between different sub-diagrams. During the duty of the train dispatcher, emergencies or construction plans as shown in Table 5 occur within dispatching section 1, and the train dispatcher needs to use the dedicated dispatching order program to handle them. The detailed situations in Table 5 include the station sequence selected by the train dispatcher in the dedicated dispatching order program, as well as the sub-diagram numbers and station numbers of the starting station and the ending station of the event. The sub-diagram numbers and station numbers are obtained by the dedicated dispatching order program extracting the station name text from the dispatching order text and parsing the station name text.

[0088] Table 4: Operation diagram base map parameter table of dispatching section 1

[0089]

[0090] Table 5: Details of emergencies or construction plans

[0091]

[0092] 1. Construction of the tree diagram model.

[0093] Since the initial node is connected to all subgraphs, the initial node obtains 5 retrieval results after executing the retrieval method. The retrieval results are 5 subgraphs, corresponding to subgraph numbers 1, 2, 3, 4, and 5. As described before, when constructing the tree diagram model of the present invention, it is all for subgraphs. For the sake of easy understanding, the subgraph numbers are directly used for description below. The absolute relationship sequence of the current node is empty, denoted as {}, and the retrieval result is 1. Since the absolute relationship sequence of the initial node is {}, lacking the relevant parameters of the starting subgraph and the ending subgraph, the pruning operation is not performed. Since the retrieval result does not exist in the absolute relationship sequence, the new branch operation is performed. The newly created node is marked as [1], corresponding to the subgraph with subgraph number 1. At the same time, the retrieval result of the current node is cached, and the absolute relationship sequence of the new tree diagram node is updated to {1}, and then the newly created node is set as the current node.

[0094] (1) The steps for constructing the tree diagram model corresponding to the subgraph number 1 of the operation diagram base map of the scheduling section shown in Table 4 are as follows:

[0095] (1.1) The current node [1] executes the retrieval method and obtains 2 retrieval results. The retrieval results are subgraph numbers 2 and 3. The absolute relationship sequence of the current node is {1}, and the retrieval result is 2. Since the absolute relationship sequence of the current node is {1}, lacking the relevant parameters of the starting subgraph and the ending subgraph, the pruning operation is not performed. Since the retrieval result does not exist in the absolute relationship sequence, the new branch operation is performed. The newly created node is marked as [2], and at the same time, the retrieval result of the current node is cached, and the absolute relationship sequence of the new tree diagram node is updated to {1, 2}, and then the newly created node is set as the current node.

[0096] (1.2) The current node [2] executes the retrieval method and obtains 2 retrieval results. The retrieval results are subgraph numbers 1 and 3. The absolute relationship sequence of the current node is {1, 2}, and the first retrieval result is 1. The starting subgraph number, the current subgraph number, and the ending subgraph number parameters of the pruning method are respectively loaded as 1, 2, 1, and the returned station sequence is {26}. The station sequence contains only 1 station, so the pruning operation is performed, and the next retrieval result is read.

[0097] (1.3) The next retrieval result of the current node [2] is 3. Here, 3 refers to the subgraph number 3, and the same is true in the following text, so it will not be elaborated; the starting subgraph number, the current subgraph number, and the ending subgraph number parameters of the pruning method are respectively loaded as 1, 2, 3, and the returned station sequence is {26}. The station sequence contains only 1 station, so the pruning operation is performed. All the retrieval results of the node marked as 2 are processed, and the parent node [1] is set as the current node and the retrieval results are loaded.

[0098] (1.4)The next retrieval result of the current node [1] is 3, and the absolute relationship sequence is {1}. Since the absolute relationship sequence of the current node is {1} and the relevant parameters of the starting sub-graph and the ending sub-graph are missing, the pruning operation is not performed. Since the retrieval result does not exist in the absolute relationship sequence, the new branch operation is performed. The newly created node is marked as [3]. At the same time, the retrieval result of the current node is cached, and the absolute relationship sequence of the new tree graph node is updated to {1, 3}. Then the newly created node is set as the current node.

[0099] (1.5)The current node [3] executes the retrieval method and obtains 4 retrieval results. The retrieval results are sub-graph numbers 1, 2, 4, and 5. The absolute relationship sequence of the current node is {1, 3}. The first retrieval result is 1. The starting sub-graph number, the current sub-graph number, and the ending sub-graph number parameters of the pruning method are respectively loaded as 1, 3, 1, and the returned station sequence is {26}. Since the station sequence contains only 1 station, the pruning operation is performed and the next retrieval result is read.

[0100] (1.6)The next retrieval result of the current node [3] is 2, and the absolute relationship sequence is {1, 3}. The starting sub-graph number, the current sub-graph number, and the ending sub-graph number parameters of the pruning method are respectively loaded as 1, 3, 2, and the returned station sequence is {26}. Since the station sequence contains only 1 station, the pruning operation is performed and the next retrieval result is read.

[0101] (1.7)The next retrieval result of the current node [3] is 4, and the absolute relationship sequence is {1, 3}. The starting sub-graph number, the current sub-graph number, and the ending sub-graph number parameters of the pruning method are respectively loaded as 1, 3, 4, and the returned station sequence is {22, 26}. Since the station sequence has more than 1 station, the pruning operation is not performed. Since the retrieval result does not exist in the absolute relationship sequence, the new branch operation is performed. The newly created node is marked as [4]. At the same time, the retrieval result of the current node is cached, and the absolute relationship sequence of the new tree graph node is updated to {1, 3, 4}. Then the newly created node is set as the current node.

[0102] (1.8)The current node [4] executes the retrieval method and obtains 2 retrieval results. The retrieval results are sub-graph numbers 3 and 5. The absolute relationship sequence of the current node is {1, 3, 4}. The first retrieval result is 3. The starting sub-graph number, the current sub-graph number, and the ending sub-graph number parameters of the pruning method are respectively loaded as 3, 4, 3, and the returned station sequence is {22}. Since the station sequence contains only 1 station, the pruning operation is performed and the next retrieval result is read.

[0103] The next search result of the current node [4] is 5, and the absolute relationship sequence is {1, 3, 4}. The start sub-graph number, current sub-graph number, and end sub-graph number parameters of the pruning method are loaded as 3, 4, 5 respectively, and the returned station sequence is {22}. Since the station sequence contains only 1 station, the pruning operation is performed. All search results of the node marked as 4 have been processed. Set the parent node [3] as the current node and load the search results.

[0104] (1.10)The next search result of the current node [3] is 5, and the absolute relationship sequence is {1, 3}. The start sub-graph number, current sub-graph number, and end sub-graph number parameters of the pruning method are loaded as 1, 3, 5 respectively, and the returned station sequence is {22, 26}. Since the station sequence has more than 1 station, the pruning operation is not performed. Since the search result does not exist in the absolute relationship sequence, the new branch operation is performed. The newly created node is marked as [5]. At the same time, cache the search results of the current node, update the absolute relationship sequence of the new tree graph node to {1, 3, 5}, and then set the newly created node as the current node.

[0105] (1.11)The current node [5] executes the search method and obtains 2 search results, which are sub-graph numbers 3 and 4. The absolute relationship sequence of the current node is {1, 3, 5}. The first search result is 3. The start sub-graph number, current sub-graph number, and end sub-graph number parameters of the pruning method are loaded as 3, 5, 3 respectively, and the returned station sequence is {22}. Since the station sequence contains only 1 station, the pruning operation is performed, and the next search result is read.

[0106] (1.12)The next search result of the current node [5] is 4, the absolute relationship sequence is {1, 3, 5}, the search result is 4. The start sub-graph number, current sub-graph number, and end sub-graph number parameters of the pruning method are loaded as 3, 5, 4 respectively, and the returned station sequence is {22}. Since the station sequence contains only 1 station, the pruning operation is performed. All search results of the node marked as 5 have been processed. Set the parent node [3] as the current node and load the search results.

[0107] (1.13)All search results of the current node [3] have been processed. Set the parent node [1] as the current node and load the search results. After loading, all search results of the current node [1] have been processed. Set the initial node as the current node and load the search results, and continue the construction process of the tree graph with the next sub-graph number.

[0108] (2)The steps for constructing the tree graph model corresponding to the sub-graph number 2 of the base map of the train operation diagram in Table 4 are as follows:

[0109] The next search result of the initial node is subgraph number 2. Since the absolute relation sequence of the initial node is {}, lacking the relevant parameters of the starting subgraph and the ending subgraph, the pruning operation is not performed. Since the search result does not exist in the absolute relation sequence, the new branch operation is performed. The newly created node is marked as [2]. At the same time, the search result of the current node is cached, and the absolute relation sequence of the new tree graph node is updated to {2}, and then the newly created node is set as the current node.

[0110] (2.2)The current node [2] executes the search method and obtains 2 search results. The search results are subgraph numbers 1 and 3. The absolute relation sequence of the current node is {2}, and the first search result is 1. Since the absolute relation sequence of the current node is {2}, lacking the relevant parameters of the starting subgraph and the ending subgraph, the pruning operation is not performed. Since the search result does not exist in the absolute relation sequence, the new branch operation is performed. The newly created node is marked as [1]. At the same time, the search result of the current node is cached, and the absolute relation sequence of the new tree graph node is updated to {2,1}, and then the newly created node is set as the current node.

[0111] (2.3)The current node [1] executes the search method and obtains 2 search results. The search results are subgraph numbers 2 and 3. The absolute relation sequence of the current node is {2,1}, and the first search result is 2. The starting subgraph number, the current subgraph number, and the ending subgraph number parameters of the pruning method are loaded as 2, 1, 2 respectively, and the returned station sequence is {26}. The station sequence contains only 1 station, so the pruning operation is performed, and the next search result is read.

[0112] (2.4)The next search result of the current node [1] is 3, and the absolute relation sequence is {2,1}. The starting subgraph number, the current subgraph number, and the ending subgraph number parameters of the pruning method are loaded as 2, 1, 3 respectively, and the returned station sequence is {26}. The station sequence contains only 1 station, so the pruning operation is performed. All the search results of the node marked as 1 are processed, and the parent node [2] is set as the current node and the search results are loaded.

[0113] (2.5)The next search result of the current node [2] is 3, and the absolute relation sequence is {2}. Since the absolute relation sequence of the current node is {2}, lacking the relevant parameters of the starting subgraph and the ending subgraph, the pruning operation is not performed. Since the search result does not exist in the absolute relation sequence, the new branch operation is performed. The newly created node is marked as [3]. At the same time, the search result of the current node is cached, and the absolute relation sequence of the new tree graph node is updated to {2,3}, and then the newly created node is set as the current node.

[0114] (2.6) The current node [3] executes the retrieval method and obtains 4 retrieval results. The retrieval results are subgraph numbers 1, 2, 4, and 5. The absolute relationship sequence of the current node is {2, 3}. The first retrieval result is 1. The start subgraph number, current subgraph number, and end subgraph number parameters of the pruning method are respectively loaded as 2, 3, 1. The returned station sequence is {26}. Since the station sequence contains only 1 station, the pruning operation is performed and the next retrieval result is read.

[0115] (2.7) The next retrieval result of the current node [3] is 2, and the absolute relationship sequence is {2, 3}. The start subgraph number, current subgraph number, and end subgraph number parameters of the pruning method are respectively loaded as 2, 3, 2. The returned station sequence is {26}. Since the station sequence contains only 1 station, the pruning operation is performed and the next retrieval result is read.

[0116] (2.8) The next retrieval result of the current node [3] is 4, and the absolute relationship sequence is {2, 3}. The start subgraph number, current subgraph number, and end subgraph number parameters of the pruning method are respectively loaded as 2, 3, 4. The returned station sequence is {22, 26}. Since the station sequence has more than 1 station, the pruning operation is not performed. Since the retrieval result does not exist in the absolute relationship sequence, the new branch operation is performed. The newly created node is marked as [4]. At the same time, the retrieval results of the current node are cached, and the absolute relationship sequence of the new tree graph node is updated to {2, 3, 4}. Then the newly created node is set as the current node.

[0117] (2.9) The current node [4] executes the retrieval method and obtains 2 retrieval results. The retrieval results are subgraph numbers 3 and 5. The absolute relationship sequence of the current node is {2, 3, 4}. The first retrieval result is 3. The start subgraph number, current subgraph number, and end subgraph number parameters of the pruning method are respectively loaded as 3, 4, 3. The returned station sequence is {22}. Since the station sequence contains only 1 station, the pruning operation is performed and the next retrieval result is read.

[0118] (2.10) The next retrieval result of the current node [4] is 5, and the absolute relationship sequence is {2, 3, 4}. The start subgraph number, current subgraph number, and end subgraph number parameters of the pruning method are respectively loaded as 3, 4, 5. The returned station sequence is {22}. Since the station sequence contains only 1 station, the pruning operation is performed. All the retrieval results of the node marked as 4 have been processed. The parent node [3] is set as the current node and the retrieval results are loaded.

[0119] The current node [5] executes the retrieval method and obtains 2 retrieval results. The retrieval results are sub-graph numbers 3 and 4. The absolute relationship sequence of the current node is {2, 3, 5}, the first retrieval result is 3, and the start sub-graph number, current sub-graph number, and end sub-graph number parameters of the pruning method are respectively loaded as 3, 5, 3. The returned station sequence is {22}. Since the station sequence contains only 1 station, the pruning operation is performed, and the next retrieval result is read.

[0120] (2.12)The next retrieval result of the current node [5] is 4, the absolute relationship sequence is {2, 3, 5}, the retrieval result is 4, and the start sub-graph number, current sub-graph number, and end sub-graph number parameters of the pruning method are respectively loaded as 3, 5, 4. The returned station sequence is {22}. Since the station sequence contains only 1 station, the pruning operation is performed. All the retrieval results of the node marked as 5 have been processed. Set the parent node [3] as the current node and load the retrieval results.

[0121] (2.13)All the retrieval results of the current node [3] have been processed. Set the parent node [2] as the current node and load the retrieval results. After loading, all the retrieval results of the current node [2] have been processed. Set the initial node as the current node and load the retrieval results, and continue the construction process of the tree graph for the next sub-graph number.

[0122] (3)The steps for constructing the tree graph model corresponding to the sub-graph number 3 of the base map of the train operation diagram shown in Table 4 are as follows:

[0123] (3.1)The next retrieval result of the initial node is the sub-graph corresponding to sub-graph number 3. Since the absolute relationship sequence of the initial node is {}, lacking the relevant parameters of the start sub-graph and end sub-graph, the pruning operation is not performed. Since the retrieval result does not exist in the absolute relationship sequence, the new branch operation is performed. A new node is marked as [3], and at the same time, the retrieval result of the current node is cached, and the absolute relationship sequence of the new tree graph node is updated to {3}, and then the new node is set as the current node.

[0124] (3.2)The current node [3] executes the retrieval method and obtains 4 retrieval results. The retrieval results are sub-graph numbers 1, 2, 4, and 5. The absolute relationship sequence of the current node is {3}, and the first retrieval result is 1. Since the absolute relationship sequence of the current node is {3}, lacking the relevant parameters of the start sub-graph and end sub-graph, the pruning operation is not performed. Since the retrieval result does not exist in the absolute relationship sequence, the new branch operation is performed. A new node is marked as [1], and at the same time, the retrieval result of the current node is cached, and the absolute relationship sequence of the new tree graph node is updated to {3, 1}, and then the new node is set as the current node.

[0125] (3.3) The current node [1] executes the retrieval method and obtains 2 retrieval results, which are sub - graph numbers 2 and 3. The absolute relationship sequence of the current node is {3,1}, and the first retrieval result is 2. The start sub - graph number, current sub - graph number, and end sub - graph number parameters of the pruning method are respectively loaded as 3,1,2, and the returned station sequence is {26}. Since the station sequence contains only 1 station, the pruning operation is performed, and the next retrieval result is read.

[0126] (3.4) The next retrieval result of the current node [1] is 3, and the absolute relationship sequence is {3,1}. The start sub - graph number, current sub - graph number, and end sub - graph number parameters of the pruning method are respectively loaded as 3,1,3, and the returned station sequence is {26}. Since the station sequence contains only 1 station, the pruning operation is performed. All the retrieval results of the node marked as 1 are processed, and the parent node [3] is set as the current node and the retrieval results are loaded.

[0127] (3.5) The next retrieval result of the current node [3] is 2, and the absolute relationship sequence is {3}. Since the absolute relationship sequence of the current node is {3}, lacking the relevant parameters of the start sub - graph and end sub - graph, the pruning operation is not performed. Since the retrieval result does not exist in the absolute relationship sequence, the new branch operation is performed. The newly created node is marked as [2], and at the same time, the retrieval results of the current node are cached. The absolute relationship sequence of the new tree - shaped graph node is updated to {3,2}, and then the newly created node is set as the current node.

[0128] (3.6) The current node [2] executes the retrieval method and obtains 2 retrieval results, which are sub - graph numbers 1 and 3. The absolute relationship sequence of the current node is {3,2}, and the first retrieval result is 1. The start sub - graph number, current sub - graph number, and end sub - graph number parameters of the pruning method are respectively loaded as 3,2,1, and the returned station sequence is {26}. Since the station sequence contains only 1 station, the pruning operation is performed, and the next retrieval result is read.

[0129] (3.7) The next retrieval result of the current node [2] is 3, and the absolute relationship sequence is {3,2}. The start sub - graph number, current sub - graph number, and end sub - graph number parameters of the pruning method are respectively loaded as 3,2,3, and the returned station sequence is {26}. Since the station sequence contains only 1 station, the pruning operation is performed. All the retrieval results of the node marked as 2 are processed, and the parent node [3] is set as the current node and the retrieval results are loaded.

[0130] (3.8)The next search result of the current node [3] is 4, and the absolute relationship sequence is {4}. Since the absolute relationship sequence of the current node is {3} and the relevant parameters of the starting sub-graph and the ending sub-graph are missing, the pruning operation is not performed. Since the search result does not exist in the absolute relationship sequence, the new branch operation is performed. The newly created node is marked as [4]. At the same time, the search result of the current node is cached, and the absolute relationship sequence of the new tree graph node is updated to {3, 4}. Then the newly created node is set as the current node.

[0131] (3.9)The current node [4] executes the search method and obtains 2 search results. The search results are sub-graph numbers 3 and 5. The absolute relationship sequence of the current node is {3, 4}, and the first search result is 3. The starting sub-graph number, the current sub-graph number, and the ending sub-graph number parameters of the pruning method are loaded as 3, 4, and 3 respectively, and the returned station sequence is {22}. Since the station sequence contains only 1 station, the pruning operation is performed, and the next search result is read.

[0132] (3.10)The next search result of the current node [4] is 5, and the absolute relationship sequence is {3, 4}. The starting sub-graph number, the current sub-graph number, and the ending sub-graph number parameters of the pruning method are loaded as 3, 4, and 5 respectively, and the returned station sequence is {22}. Since the station sequence contains only 1 station, the pruning operation is performed. All the search results of the node marked as 4 have been processed. The parent node [3] is set as the current node and the search results are loaded.

[0133] (3.11)The next search result of the current node [3] is 5, and the absolute relationship sequence is {3}. Since the absolute relationship sequence of the current node is {3} and the relevant parameters of the starting sub-graph and the ending sub-graph are missing, the pruning operation is not performed. Since the search result does not exist in the absolute relationship sequence, the new branch operation is performed. The newly created node is marked as [5]. At the same time, the search result of the current node is cached, and the absolute relationship sequence of the new tree graph node is updated to {3, 5}. Then the newly created node is set as the current node.

[0134] (3.12)The current node [5] executes the search method and obtains 2 search results. The search results are sub-graph numbers 3 and 4. The absolute relationship sequence of the current node is {3, 5}, and the first search result is 3. The starting sub-graph number, the current sub-graph number, and the ending sub-graph number parameters of the pruning method are loaded as 3, 5, and 3 respectively, and the returned station sequence is {22}. Since the station sequence contains only 1 station, the pruning operation is performed, and the next search result is read.

[0135] The next retrieval result of the current node [5] is 4, and the absolute relationship sequence is {3, 5}. The start sub-graph number, current sub-graph number, and end sub-graph number parameters of the pruning method are respectively loaded as 3, 5, 4, and the returned station sequence is {22}. Since the station sequence contains only 1 station, the pruning operation is performed. All the retrieval results of the node marked as 5 have been processed. Set the parent node [3] as the current node and load the retrieval results.

[0136] (3.14)All the retrieval results of the current node [3] have been processed. Set the initial node as the current node and load the retrieval results, and continue the construction process of the tree graph with the next sub-graph number.

[0137] (4)The steps for constructing the tree graph model corresponding to sub-graph number 4 of the base map of the train operation diagram in Table 4 are as follows:

[0138] (4.1)The next retrieval result of the initial node is 4. Since the absolute relationship sequence of the initial node is {}, lacking the relevant parameters of the start sub-graph and end sub-graph, the pruning operation is not performed. Since the retrieval result does not exist in the absolute relationship sequence, the new branch operation is performed. A new node is marked as [3], and at the same time, the retrieval results of the current node are cached, and the absolute relationship sequence of the new tree graph node is updated to {4}, and then the new node is set as the current node.

[0139] (4.2)The current node [4] executes the retrieval method and obtains 2 retrieval results, which are sub-graph numbers 3 and 5. The absolute relationship sequence of the current node is {4}, and the first retrieval result is 3. Since the absolute relationship sequence of the current node is {4}, lacking the relevant parameters of the start sub-graph and end sub-graph, the pruning operation is not performed. Since the retrieval result does not exist in the absolute relationship sequence, the new branch operation is performed. A new node is marked as [3], and at the same time, the retrieval results of the current node are cached, and the absolute relationship sequence of the new tree graph node is updated to {4, 3}, and then the new node is set as the current node.

[0140] (4.3)The current node [3] executes the retrieval method and obtains 4 retrieval results, which are sub-graph numbers 1, 2, 4, and 5. The absolute relationship sequence of the current node is {4, 3}, and the first retrieval result is 1. The start sub-graph number, current sub-graph number, and end sub-graph number parameters of the pruning method are respectively loaded as 4, 3, 1, and the returned station sequence is {22, 26}. Since the station sequence has more than 1 station, the pruning operation is not performed. Since the retrieval result does not exist in the absolute relationship sequence, the new branch operation is performed. A new node is marked as [1], and at the same time, the retrieval results of the current node are cached, and the absolute relationship sequence of the new tree graph node is updated to {4, 3, 1}, and then the new node is set as the current node.

[0141] (4.4) The current node [1] executes the retrieval method and obtains 2 retrieval results, which are subgraph numbers 2 and 3. The absolute relationship sequence of the current node is {4, 3, 1}, and the first retrieval result is 2. The starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 3, 1, 2 respectively, and the returned station sequence is {26}. Since the station sequence contains only 1 station, the pruning operation is performed, and the next retrieval result is read.

[0142] (4.5) The next retrieval result of the current node [1] is 3, and the absolute relationship sequence is {4, 3, 1}. The starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 3, 1, 3 respectively, and the returned station sequence is {26}. Since the station sequence contains only 1 station, the pruning operation is performed. All the retrieval results of the node marked as 1 are processed, and the parent node [3] is set as the current node and the retrieval results are loaded.

[0143] (4.6) The next retrieval result of the current node [3] is 2, and the absolute relationship sequence is {4, 3}. The absolute relationship sequence of the current node is {4, 3}, and the retrieval result is 2. The starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 4, 3, 2 respectively, and the returned station sequence is {22, 26}. Since the station sequence has more than 1 station, the pruning operation is not performed. Since the retrieval result does not exist in the absolute relationship sequence, the new branch operation is performed. The newly created node is marked as [2], and at the same time, the retrieval results of the current node are cached. The absolute relationship sequence of the new tree graph node is updated to {4, 3, 2}, and then the newly created node is set as the current node.

[0144] (4.7) The current node [2] executes the retrieval method and obtains 2 retrieval results, which are subgraph numbers 1 and 3. The absolute relationship sequence of the current node is {4, 3, 2}, and the first retrieval result is 1. The starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 3, 2, 1 respectively, and the returned station sequence is {26}. Since the station sequence contains only 1 station, the pruning operation is performed, and the next retrieval result is read.

[0145] (4.8) The next retrieval result of the current node [2] is 3, and the absolute relationship sequence is {4, 3, 2}. The starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 3, 2, 3 respectively, and the returned station sequence is {26}. Since the station sequence contains only 1 station, the pruning operation is performed. All the retrieval results of the node marked as 2 are processed, and the parent node [3] is set as the current node and the retrieval results are loaded.

[0146] (4.9)The next search result of the current node [3] is 4, and the absolute relationship sequence is {4, 3}. The absolute relationship sequence of the current node is {4, 3}, and the search result is 4. The start sub-graph number, current sub-graph number, and end sub-graph number parameters of the pruning method are loaded as 4, 3, 4 respectively, and the returned station sequence is {22}. Since the station sequence contains only 1 station, the pruning operation is performed, and the next search result is read.

[0147] (4.10)The next search result of the current node [3] is 5, and the absolute relationship sequence is {4, 3}. The absolute relationship sequence of the current node is {4, 3}, and the search result is 5. The start sub-graph number, current sub-graph number, and end sub-graph number parameters of the pruning method are loaded as 4, 3, 5 respectively, and the returned station sequence is {22}. Since the station sequence contains only 1 station, the pruning operation is performed, and the next search result is read. All search results of the node marked as 3 have been processed, and the parent node [4] is set as the current node and the search result is loaded.

[0148] (4.11)The next search result of the current node [4] is 5, and the absolute relationship sequence is {4}. Since the absolute relationship sequence of the initial node is {}, the relevant parameters of the start sub-graph and end sub-graph are missing, so the pruning operation is not performed. Since the search result does not exist in the absolute relationship sequence, a new branch operation is performed. A new node is marked as [5], and at the same time, the search result of the current node is cached. The absolute relationship sequence of the new tree graph node is updated to {4, 5}, and then the new node is set as the current node.

[0149] (4.12)The current node [5] executes the search method and obtains 2 search results, and the search results are sub-graph numbers 3 and 4. The absolute relationship sequence of the current node is {4, 5}, and the first search result is 3. The start sub-graph number, current sub-graph number, and end sub-graph number parameters of the pruning method are loaded as 4, 5, 3 respectively, and the returned station sequence is {22}. Since the station sequence contains only 1 station, the pruning operation is performed, and the next search result is read.

[0150] (4.13)The next search result of the current node [5] is 4, and the absolute relationship sequence is {4, 5}. The start sub-graph number, current sub-graph number, and end sub-graph number parameters of the pruning method are loaded as 4, 5, 4 respectively, and the returned station sequence is {22}. Since the station sequence contains only 1 station, the pruning operation is performed. All search results of the node marked as 5 have been processed, and the parent node [4] is set as the current node and the search result is loaded.

[0151] (4.14)All search results of the current node [4] have been processed. The initial node is set as the current node and the search result is loaded, and the construction process of the tree graph with the next sub-graph number continues.

[0152] (5) The steps for constructing the tree diagram model corresponding to sub - figure number 5 of the operation diagram base map shown in Table 4 are as follows:

[0153] (5.1) The next retrieval result of the initial node is 5. Since the absolute relation sequence of the initial node is {}, lacking the relevant parameters of the starting sub - figure and the ending sub - figure, the pruning operation is not performed. Since the retrieval result does not exist in the absolute relation sequence, the new branch operation is performed. The newly created node is marked as [5]. At the same time, the retrieval result of the current node is cached, and the absolute relation sequence of the new tree diagram node is updated to {5}, and then the newly created node is set as the current node.

[0154] (5.2) The current node [5] executes the retrieval method and obtains 2 retrieval results, which are sub - figure numbers 3 and 4. The absolute relation sequence of the current node is {5}, and the first retrieval result is 3. Since the absolute relation sequence of the current node is {5}, lacking the relevant parameters of the starting sub - figure and the ending sub - figure, the pruning operation is not performed. Since the retrieval result does not exist in the absolute relation sequence, the new branch operation is performed. The newly created node is marked as [3]. At the same time, the retrieval result of the current node is cached, and the absolute relation sequence of the new tree diagram node is updated to {5, 3}, and then the newly created node is set as the current node.

[0155] (5.3) The current node [3] executes the retrieval method and obtains 4 retrieval results, which are sub - figure numbers 1, 2, 4, and 5. The absolute relation sequence of the current node is {5, 3}, and the first retrieval result is 1. The starting sub - figure number, the current sub - figure number, and the ending sub - figure number parameters of the pruning method are respectively loaded as 5, 3, 1, and the returned station sequence is {22, 26}. Since the station sequence has more than 1 station, the pruning operation is not performed. Since the retrieval result does not exist in the absolute relation sequence, the new branch operation is performed. The newly created node is marked as [1]. At the same time, the retrieval result of the current node is cached, and the absolute relation sequence of the new tree diagram node is updated to {5, 3, 1}, and then the newly created node is set as the current node.

[0156] (5.4) The current node [1] executes the retrieval method and obtains 2 retrieval results, which are sub - figure numbers 2 and 3. The absolute relation sequence of the current node is {5, 3, 1}, and the first retrieval result is 2. The starting sub - figure number, the current sub - figure number, and the ending sub - figure number parameters of the pruning method are respectively loaded as 3, 1, 2, and the returned station sequence is {26}. Since the station sequence contains only 1 station, the pruning operation is performed, and the next retrieval result is read.

[0157] The next search result of the current node [1] is 3, and the absolute relationship sequence is {5, 3, 1}. The start subgraph number, current subgraph number, and end subgraph number parameters of the pruning method are loaded as 3, 1, 3 respectively, and the returned station sequence is {26}. Since the station sequence contains only 1 station, the pruning operation is performed. All the search results of the nodes marked as 1 are processed, and the parent node [3] is set as the current node and the search results are loaded.

[0158] (5.6)The next search result of the current node [3] is 2, and the absolute relationship sequence is {5, 3}. The absolute relationship sequence of the current node is {5, 3}, and the search result is 2. The start subgraph number, current subgraph number, and end subgraph number parameters of the pruning method are loaded as 5, 3, 2 respectively, and the returned station sequence is {22, 26}. Since the station sequence has more than 1 station, the pruning operation is not performed. Since the search result does not exist in the absolute relationship sequence, the new branch operation is performed. The newly created node is marked as [2], and at the same time, the search results of the current node are cached, and the absolute relationship sequence of the new tree graph node is updated to {5, 3, 2}. Then the newly created node is set as the current node.

[0159] (5.7)The current node [2] executes the search method and obtains 2 search results, and the search results are subgraph numbers 1 and 3. The absolute relationship sequence of the current node is {5, 3, 2}, and the first search result is 1. The start subgraph number, current subgraph number, and end subgraph number parameters of the pruning method are loaded as 3, 2, 1 respectively, and the returned station sequence is {26}. Since the station sequence contains only 1 station, the pruning operation is performed, and the next search result is read.

[0160] (5.8)The next search result of the current node [2] is 3, and the absolute relationship sequence is {5, 3, 2}. The start subgraph number, current subgraph number, and end subgraph number parameters of the pruning method are loaded as 3, 2, 3 respectively, and the returned station sequence is {26}. Since the station sequence contains only 1 station, the pruning operation is performed. All the search results of the nodes marked as 2 are processed, and the parent node [3] is set as the current node and the search results are loaded.

[0161] (5.9)The next search result of the current node [3] is 4, and the absolute relationship sequence is {5, 3}. The absolute relationship sequence of the current node is {5, 3}, and the search result is 4. The start subgraph number, current subgraph number, and end subgraph number parameters of the pruning method are loaded as 5, 3, 4 respectively, and the returned station sequence is {22}. Since the station sequence contains only 1 station, the pruning operation is performed, and the next search result is read.

[0162] (5.10) The next search result of the current node [3] is 5, and the absolute relationship sequence is {5, 3}. The absolute relationship sequence of the current node is {5, 3}, and the search result is 5. The start subgraph number, current subgraph number, and end subgraph number parameters of the pruning method are loaded as 5, 3, 5 respectively, and the returned station sequence is {22}. Since the station sequence contains only 1 station, the pruning operation is performed, and the next search result is read. All the search results of the node marked as 3 have been processed, and the parent node [5] is set as the current node and the search result is loaded.

[0163] (5.11)The next search result of the current node [5] is 4, and the absolute relationship sequence is {5}. The absolute relationship sequence of the current node is {5}, and the search result is 4. Since the absolute relationship sequence of the current node is {5}, the relevant parameters of the start subgraph and end subgraph are missing, so the pruning operation is not performed. Since the search result does not exist in the absolute relationship sequence, the new branch operation is performed. The newly created node is marked as [4]. At the same time, the search result of the current node is cached, and the absolute relationship sequence of the new tree graph node is updated to {5, 4}. Then the newly created node is set as the current node.

[0164] (5.12)The current node [4] executes the search method and obtains 2 search results, which are subgraph numbers 3 and 5. The absolute relationship sequence of the current node is {5, 4}, and the first search result is 3. The start subgraph number, current subgraph number, and end subgraph number parameters of the pruning method are loaded as 5, 4, 3 respectively, and the returned station sequence is {22}. Since the station sequence contains only 1 station, the pruning operation is performed, and the next search result is read.

[0165] (5.13)The next search result of the current node [4] is 5, and the absolute relationship sequence is {5, 4}. The start subgraph number, current subgraph number, and end subgraph number parameters of the pruning method are loaded as 5, 4, 5 respectively, and the returned station sequence is {22}. Since the station sequence contains only 1 station, the pruning operation is performed. All the search results of the node marked as 4 have been processed, and the parent node [5] is set as the current node and the search result is loaded.

[0166] (5.14)All the search results of the current node [5] have been processed.

[0167] As Figure 9 shown, it is the tree graph model of the above 5 subgraphs. The tree graph models of each subgraph can be distinguished by the root node of the tree graph model. For example, for the tree graph model in the upper left corner, the root node is 1, which means it is the tree graph model of subgraph number 1.

[0168] Based on the above process, all the retrieval results of the initial nodes are processed. According to the starting subgraph number and ending subgraph number of the absolute relationship sequence information, they are stored as the subgraph connection relationship table of Scheduling Section 1 shown in Table 6.

[0169] Table 6: Subgraph Connection Relationship Table of Scheduling Section 1

[0170]

[0171] 2. Automatic verification of the integrity of the receiving order points.

[0172] (1) The automatic verification steps for the receiving order points corresponding to Event 1 in Table 5 are as follows:

[0173] (1.1) The special program for dispatching orders parses from the dispatching order text and obtains the subgraph number 3 and station serial number 29 of the starting station of Event 1, as well as the subgraph number 3 and station serial number 33 of the ending station.

[0174] (1.2) The subgraph number of the starting station is 3, and the subgraph number of the ending station is 3. Since the subgraph numbers of the starting station and the ending station are the same, the method for obtaining the station sequence in the same subgraph is executed. The subgraph number is 3, the starting station serial number is 29, and the ending station serial number is 33. The obtained station sequence is {29, 30, 32, 33}, and the expected station sequence loaded is {29, 30, 32, 33}.

[0175] (1.3) The station sequence selected by the train dispatcher in the special program for dispatching orders in Event 1 is {29, 30, 32, 33}, which is the same as the expected station sequence {29, 30, 32, 33}. Therefore, the automatic verification is determined to pass.

[0176] (2) The automatic verification steps for the receiving order points corresponding to Event 2 in Table 5 are as follows:

[0177] (2.1) The special program for dispatching orders parses from the dispatching order text and obtains the subgraph number 2 and station serial number 23 of the starting station of Event 2, as well as the subgraph number 3 and station serial number 27 of the ending station.

[0178] (2.2) The sub - figure number of the starting station is 2, and the sub - figure number of the ending station is 3. Since the sub - figure numbers of the starting station and the ending station are inconsistent, the corresponding absolute relationship sequence {2, 3} is obtained from Table 6. Take the first 2 sub - figure numbers 2 and 3 from the absolute relationship sequence. Set the first sub - figure number 2 as the current sub - figure, the second sub - figure number 3 as the starting and ending sub - figures, and the starting grouping of the absolute relationship sequence {2, 3} is set as {3, 2, 3}. Take the last 2 sub - figure numbers 2 and 3 from the absolute relationship sequence, set the second sub - figure number as the current sub - figure, the first sub - figure number as the starting and ending sub - figures, and the ending grouping of the absolute relationship sequence {2, 3} is set as {2, 3, 2}. Since the number of sub - figure numbers included in the absolute relationship sequence {2, 3} is less than 3, there is no connection grouping for this sequence.

[0179] (2.3) The current grouping is the starting grouping {3, 2, 3}. Execute the method for obtaining the cross - sub - figure station sequence, and get the station serial number 26 of the connecting station in the current sub - Figure 2 Then execute the method for obtaining the same - sub - figure station sequence. The sub - figure number is 2, the starting station serial number is 23, and the ending station serial number is 26, and the station sequence {23, 26} is obtained. The expected station sequence is loaded as {23, 26}, and continue to process the next grouping.

[0180] (2.4) The current grouping is the ending grouping {2, 3, 2}. Execute the method for obtaining the cross - sub - figure station sequence, and get the station serial number 26 of the connecting station in the current sub - Figure 3 Then execute the method for obtaining the same - sub - figure station sequence. The sub - figure number is 3, the starting station serial number is 26, and the ending station serial number is 27, and the station sequence {26, 27} is obtained. The expected station sequence is loaded as {23, 26, 27}, and all groupings have been processed.

[0181] (2.5) In Event 2, the station sequence selected by the train dispatcher on the special program for dispatching orders is {23, 22, 27}, which is inconsistent with the expected station sequence {23, 26, 27}. There is a mis - issued situation with the dispatching order, so it is automatically determined that the verification fails.

[0182] (3) The following are the steps for automatic verification of the receiving points corresponding to Event 3 in Table 5:

[0183] (3.1) The special program for dispatching orders parses and obtains the sub - figure number 4 and the station serial number 31 of the starting station of Event 3 and the sub - figure number 2 and the station serial number 23 of the ending station from the text of the dispatching order.

[0184] (3.2) The subgraph number of the starting station is 4, and the subgraph number of the ending station is 2. Since the subgraph numbers of the starting station and the ending station are inconsistent, the corresponding absolute relation sequence {4,3,2} is obtained from Table 6. Take the first two subgraph numbers 4 and 3 from the absolute relation sequence. Set the first subgraph number 2 as the current subgraph, the second subgraph number 3 as the starting subgraph and the ending subgraph, and the starting group of the absolute relation sequence {4,3,2} is set to {3,4,3}. Take the last two subgraph numbers 3 and 2 from the absolute relation sequence, set the second subgraph number as the current subgraph, the first subgraph number as the starting subgraph and the ending subgraph, and the ending group of the absolute relation sequence {4,3,2} is set to {3,2,3}. The number of subgraph numbers contained in the absolute relation sequence {4,3,2} is 3, so there is 1 connected group. Take out three consecutive subgraph numbers 4, 3, and 2 from the absolute relation sequence, set the second subgraph number 3 as the current subgraph, the first subgraph number 4 as the starting subgraph, the third subgraph number 2 as the ending subgraph, and set the connection grouping of the absolute relation sequence {4, 3, 2} to {4, 3, 2}.

[0185] (3.3) The current group is the starting group {3,4,3}. Execute the method to obtain the station sequence across subgraphs to obtain the current subgraph. Figure 4 The station number of the connecting station is 22. Then execute the same subgraph station sequence acquisition method, the subgraph number is 4, the starting station number is 31, and the ending station number is 22, and the station sequence {22, 28, 31} is obtained. The expected station sequence is loaded as {22, 28, 31}, and continue to process the next group.

[0186] (3.4) The current group is the terminal group {3,2,3}. Execute the method to obtain the station sequence across subgraphs to obtain the current subgraph. Figure 2 The station number of the connecting station is 26. Then execute the same subgraph station sequence acquisition method, the subgraph number is 2, the starting station number is 23, and the ending station number is 26, and the station sequence {23, 26} is obtained. The expected station sequence is loaded as {22, 23, 26, 28, 31}, and continue to process the next group.

[0187] (3.5) The current group is the connected group {4,3,2}. Execute the method to obtain the station sequence across subgraphs and obtain the starting subgraph. Figure 4 Enter the current sub Figure 3 and from the terminator Figure 2 Leave the current sub Figure 3 The station sequence of all stations passed is {22, 26}, and the expected station sequence loaded is {22, 23, 26, 28, 31}. All grouping is completed.

[0188] In event (3.6), the station sequence selected by the train dispatcher on the dedicated dispatching order program is {22, 23, 26, 31}, which is inconsistent with the expected station sequence {22, 23, 26, 28, 31}. There is a situation of missed dispatching orders, so it is automatically determined that the verification fails.

[0189] Through the description of the above implementation manners, those skilled in the art can clearly understand that the above embodiments can be implemented by software, or by means of software plus a necessary general hardware platform. Based on such an understanding, the technical solutions of the above embodiments can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.), including several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in various embodiments of the present invention.

[0190] As mentioned above, only the preferred specific implementation manners of the present invention are described, but the protection scope of the present invention is not limited thereto. Any changes or substitutions that can be easily thought of by those skilled in the art within the technical scope disclosed by the present invention should be covered by the protection scope of the present invention. Therefore, the protection scope of the present invention should be subject to the protection scope of the claims.

Claims

1. A method for automatically checking the integrity of dispatching command receiving points based on a tree diagram, characterized in that: include: A corresponding tree graph model is constructed for each subgraph in the operation diagram base map. Each subgraph contains the connection information of all stations in a section. Each subgraph is numbered respectively. Each subgraph is used as a node in the tree graph model and is marked with the corresponding subgraph number. The process of constructing a tree graph model of a single subgraph includes: step A1, taking the single subgraph as a current node, executing a retrieval method to obtain other subgraphs that are connected to the current node; Step A2: for the retrieved single other subgraph, determine whether to prune by the pruning method, if yes, proceed to step A3; if no, proceed to step A4; Step A3: perform pruning operation, continue to read the next other subgraph retrieved, and proceed to step A2; Step A4: determine whether to create a new branch by the branching method, if no, continue to read the next other subgraph retrieved, and proceed to step A2; if yes, construct the single other subgraph as a new node, and use the new node as the current node, continue to execute the retrieval method, pruning method and branching method, after completion, use the parent node of the new node, that is, the node corresponding to the single subgraph, as the current node, continue to read the next other subgraph retrieved, and proceed to step A2, until all other subgraphs retrieved by the single subgraph are processed, and obtain the tree graph model of the single subgraph, which contains the connection relationship between the single subgraph and other subgraphs; synthesize the tree graph models of all subgraphs to obtain complete subgraph connection relationship information; After receiving the dispatching command, the starting station and the ending station corresponding to the ordered point, as well as the station sequence, are parsed; the station numbers of the starting station and the ending station, as well as the subgraphs to which they belong, are determined, and the expected station sequence is determined in combination with the complete subgraph connection relationship information; and based on whether the determined expected station sequence is consistent with the parsed station sequence, it is judged whether the ordered point in the dispatching command passes the integrity check.

2. According to the tree diagram-based automatic integrity verification method for dispatching command receiving points according to claim 1, it is characterized in that: The step of constructing a corresponding tree diagram model for each sub-diagram in the operation diagram base map comprises: An initial node is set, and all subgraphs connected to the initial node are obtained by executing a retrieval method, wherein each subgraph in the base graph of the operation graph is set to be connected to the initial node; The initial node is set as the current node, the first subgraph is read, and the tree graph model corresponding to the first subgraph is constructed according to the tree graph model construction process of the single subgraph; then the initial node is set as the current node, the next retrieved subgraph is read, and the tree graph model corresponding to the next subgraph is constructed according to the tree graph model construction process of the single subgraph, and the process is repeated until the tree graph model corresponding to the last subgraph is constructed.

3. The method for automatically checking the integrity of dispatching command receiving points based on a tree diagram according to claim 1, characterized in that: The determining whether to perform pruning by the pruning method includes: By executing the cross-subgraph station sequence acquisition method, combined with the absolute relationship series of the current node, the station sequence between the subgraph corresponding to the current node and the single other subgraph is determined; if the station sequence contains only one station, a pruning operation is performed, that is, the corresponding single other subgraph is not constructed as a new node; if the station sequence contains more than one station, no pruning operation is performed; Alternatively, if the absolute relation sequence length of the current node is less than 2, no pruning operation is performed; The absolute relationship series lists all nodes from the root node of the tree graph model to the current node, and the root node of the tree graph model is the subgraph to which the tree graph model belongs.

4. The method for automatically checking the integrity of dispatching command receiving points based on a tree diagram according to claim 1, characterized in that: The determining whether to create a new branch by using a branch method includes: Check whether the absolute relationship sequence of the current node contains the single other subgraph. If so, no new branch is created; if not, a new branch is created, that is, the single other subgraph is constructed as a new node.

5. The method for automatically checking the integrity of dispatching command receiving points based on a tree diagram according to claim 1, characterized in that: Determining the expected station sequence in combination with the complete subgraph connection relationship information includes: According to the subgraphs to which the starting station and the ending station belong, determine whether they are stations in the same subgraph; If yes, combining the complete subgraph connection relationship information, determining the expected station sequence by executing the same subgraph station sequence acquisition method; If not, then according to the subgraphs to which the starting station and the ending station respectively belong, an absolute relationship series is obtained from the complete subgraph connection relationship information, the obtained absolute relationship series contains all subgraph corresponding nodes with the subgraph to which the starting station belongs as the root node and the subgraph to which the ending station belongs as the ending subgraph; then the absolute relationship series is set to a starting group, an ending group and multiple connection groups, each group contains the starting subgraph, the current subgraph and the ending subgraph information, wherein the number of connection groups is the length of the absolute relationship series minus 2, if the length of the absolute relationship series is less than 3, then there is no connection group; for the connected subgraph, a part of the expected station sequence is determined by executing the same subgraph station sequence acquisition method; for the starting group and the ending group, the rest of the expected station sequence is determined by respectively executing the cross-subgraph station sequence acquisition method.

6. A method for automatically checking the integrity of dispatching command receiving points based on a tree diagram according to claim 3 or 5, characterized in that: The method for obtaining a station sequence across subgraphs comprises: According to the information of the starting subgraph, the current subgraph and the ending subgraph, determine all the stations passed when entering the current subgraph from the starting subgraph and leaving the current subgraph from the ending subgraph; Among them, when the cross-subgraph station sequence acquisition method is applied to the pruning method, the starting subgraph, the current subgraph, and the ending subgraph information correspond to the second to last item, the last item, and the single other subgraph of the absolute relationship series respectively.

7. The method for automatically checking the integrity of dispatching command receiving points based on a tree diagram according to claim 5, characterized in that: The method for obtaining a station sequence in the same sub-graph comprises: According to the serial numbers of the starting station and the ending station and the number of the sub-graph to which they belong, all the stations between the starting station and the ending station are determined.

8. The method for automatically checking the integrity of dispatching command receiving points based on a tree diagram according to claim 5, characterized in that: The step of setting the absolute relationship sequence to a starting group, an ending group, and a plurality of connection groups comprises: Set the starting group: take the first two subgraph numbers from the absolute relationship sequence, set the first subgraph number as the number of the current subgraph, and set the second subgraph number as the numbers of the starting subgraph and the ending subgraph; Set the end group: take the last two subgraph numbers from the absolute relationship sequence, set the second subgraph number as the number of the current subgraph, and set the first subgraph number as the numbers of the start subgraph and the end subgraph; Set connection grouping: take out three consecutive subgraph numbers from the absolute relationship series, set the second subgraph number to the number of the current subgraph, the first subgraph number to the number of the starting subgraph, and the third subgraph number to the number of the ending subgraph.

Images