Scheduling command commanding point integrity automatic checking method based on tree diagram

Abstract

The invention discloses a method for automatically checking the integrity of a command receiving point of a dispatching command based on a tree diagram, which is applied to the technical field of rail transit and comprises the following steps of: constructing a tree diagram model of a sub-diagram through a retrieval method, a pruning method and a branching method in combination with a connection relationship of the sub-diagram (namely a dispatching sub-section); after a dispatching command is received, command receiving point information and a station sequence are analyzed, an expected station sequence is determined in combination with sub-graph connection relation information provided by the tree diagram model and the command receiving point information, integrity verification is carried out on the analyzed station sequence, the verification process is not limited by a dispatching command template any more, and the verification efficiency is improved. While the verification accuracy is improved, a train dispatcher is allowed to respond to emergencies more quickly, errors caused by human factors such as fatigue, negligence or subjective judgment are reduced, and technical support is provided for safe and compliant operation of a train dispatching system.

Description

Technical Field

[0001] The present invention relates to the field of rail transit technology, and in particular to a method for automatically checking the integrity of dispatching order receiving points based on a tree diagram. Background Art

[0002] Train dispatchers are the organizers and commanders of train operations in the dispatching section. In the daily dispatching of the railway system, the dispatching section is divided into several different sub-sections such as Figure 1 shown. Figure 1 The sub-segments in the diagram are connected to each other through connecting stations marked by Station 4, Station 8, and Station 11. Trains in each sub-segment are managed and dispatched by train dispatchers. Connecting stations are located at the junction of different sub-segments and play the role of hubs. Connecting stations can belong to multiple adjacent sub-segments to ensure smooth transfer of trains between different segments.

[0003] When emergency response, line equipment inspection, replacement or maintenance is required in the dispatching section, the train dispatcher is responsible for using the dispatching command special program to process the affected station as the receiving point of the dispatching command according to the construction plan or emergency response requirements, and transmit relevant precautions to the station in the form of network communication, coordinate multiple types of work such as vehicles, machines, workers, electricity, and vehicles in the dispatching section, and organize construction and maintenance operations. During the impact of emergencies or the execution of construction plans, the train speed of some lines in the dispatching section is restricted or completely prohibited from passing trains, and normal driving conditions are not available. Train dispatchers need to quickly evaluate emergencies or plan adjustments, clarify their scope and severity, and verify the affected stations in the dispatching section based on the information provided by other types of work and the sub-section line conditions, and prevent the omission or misdelivery of receiving points.

[0004] The existing dispatching command receiving point integrity verification technology can be summarized as a comprehensive technical process. First, the relationship between the dispatching command template and the receiving points associated with the power supply arm and the section line is constructed through the database to ensure that the receiving points can be accurately and quickly selected by the train dispatcher in the form of receiving point groups in the dispatching command special program; at the same time, a multi-post card control review mechanism is adopted, and multiple reviews and authorizations of the post review terminal, the authorization identification judgment submodule and the authorization terminal are used to ensure that the dispatching command receiving point information is verified correctly by multiple posts; finally, the train dispatcher follows the general practice of issuing dispatching orders, forwards and confirms the dispatching orders, repeats and verifies them, clarifies the communication objects of the dispatching orders, ensures that the orders can be directly conveyed to the relevant recipients, and further improves the accuracy of the dispatching order transmission.

[0005] However, in actual train dispatching work, the database relationship established between the dispatching order template and the associated order-receiving point in the prior art is not flexible. When affected by an emergency, the associated order-receiving point of the template may not match the actual affected station. In addition, the multi-post card control and review mechanism requires frequent communication and coordination between multiple posts, which not only increases the complexity and time cost of issuing dispatching orders, but also may cause misunderstandings or conflicts in the review process due to errors in information transmission. Especially in the case of emergencies, the multi-post card control and review mechanism may become an obstacle to rapid response and affect the overall efficiency of dispatching order issuance. Finally, the general practice of issuing dispatching orders is highly dependent on the experience of relevant personnel in the train dispatching position. In the case of emergencies, it is easy to be affected by human factors such as fatigue, negligence or subjective judgment, resulting in communication 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 with authorization announcement number CN115906114B "A LKJ data file handover system and method", and the Chinese invention patent with authorization announcement number CN114936037B "A fixture implementation method compatible with multi-model railway CIR program upgrades" both contain integrity verification schemes, but they are not applicable to the integrity verification of the dispatching command receiving point.

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

[0008] The purpose of the present invention is to provide a method for automatically checking the integrity of dispatch order receiving points based on a tree diagram, which can automatically check the receiving points according to the station sequence provided by the dispatch order, so as to achieve the effect of automatically determining the omission or wrong issuance of the dispatch order, reduce the mistakes caused by human factors such as fatigue, negligence or subjective judgment, and improve the accuracy of train dispatchers in checking dispatch orders.

[0009] The objective of the present invention is achieved through the following technical solutions: A method for automatically checking the integrity of a dispatching command receiving point based on a tree diagram, comprising: A corresponding tree graph model is constructed for each subgraph in the operation diagram base map, each subgraph contains connection information of all stations in a section, each subgraph is numbered, and each subgraph is used as a node in the tree graph model and marked with a corresponding subgraph number; the tree graph model construction process of a single subgraph includes: step A1, taking the single subgraph as the current node, executing the retrieval method to obtain other subgraphs that have a connection relationship with the current node; step A2, for the retrieved single other subgraph, judging whether to prune by the pruning method, if yes, proceeding to step A3; if not, proceeding to step A4; step A3, executing the pruning operation, continuing to read the next other subgraph retrieved, and proceeding to step A2; step A4, Determine whether to create a new branch through the branching method. If not, continue to read the next other subgraph retrieved, and go to step A2. If yes, construct the single other subgraph as a new node, and use the new node as the current node, and continue to execute the retrieval method, pruning method and branching method. After the execution is completed, 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 go 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; obtain complete subgraph connection relationship information by integrating the tree graph models of all subgraphs; 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.

[0010] It can be seen from the technical solution provided by the present invention that a tree graph model of the subgraph (i.e., the dispatching subsection) is constructed by combining the connection relationship of the subgraph (i.e., the dispatching subsection) through a retrieval method, a pruning method, and a branching method; when a dispatching command is received, the command point information and the station sequence are parsed, and the expected station sequence is determined by combining the subgraph connection relationship information and the command point information provided by the tree graph model, and the parsed station sequence is checked for integrity. The verification process is no longer restricted by the dispatching command template, which improves the accuracy of the verification and allows train dispatchers to respond to emergencies more quickly, reduce errors caused by human factors such as fatigue, negligence, or subjective judgment, and provide technical support for the safe and compliant operation of the train dispatching system. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other accompanying drawings can be obtained based on these accompanying drawings without paying creative work.

[0012] Figure 1 A schematic diagram of the connection relationship of the scheduling sub-sections provided as the background technology of the present invention; Figure 2 A flowchart of a method for automatically checking the integrity of a dispatch command receiving point based on a tree diagram provided by an embodiment of the present invention; Figure 3 A schematic diagram of a base map of a dispatching section operation diagram provided in an embodiment of the present invention; Figure 4 A schematic diagram of a method for acquiring a station sequence in the same subgraph provided by an embodiment of the present invention; Figure 5 A schematic diagram of a method for obtaining a station sequence across subgraphs provided by an embodiment of the present invention; Figure 6 A schematic diagram of a tree diagram model of a running diagram base map provided by an embodiment of the present invention; Figure 7 An overall flow chart of the tree diagram model construction provided by an embodiment of the present invention; Figure 8 A flowchart of automatic integrity verification of command points provided by an embodiment of the present invention; Fig. 9 A schematic diagram of a tree diagram model of five subgraphs provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0013] The following is a clear and complete description of the technical solutions in the embodiments of the present invention in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the protection scope of the present invention.

[0014] First, the terms that may be used in this article are explained as follows: The terms "include", "comprises", "contains", "has" or other descriptions with similar semantics should be interpreted as non-exclusive inclusion. For example, including certain technical feature elements (such as raw materials, components, ingredients, carriers, dosage forms, materials, dimensions, parts, components, mechanisms, devices, steps, procedures, methods, reaction conditions, processing conditions, parameters, algorithms, signals, data, products or products, etc.) should be interpreted as including not only certain technical feature elements explicitly listed, but also other technical feature elements known in the art that are not explicitly listed.

[0015] The term "consisting of..." means excluding any technical feature elements not explicitly listed. If this term is used in a claim, it will make the claim closed, so that it does not contain technical feature elements other than the technical feature elements explicitly listed, except for the conventional impurities related to them. If this term only appears in a clause of a claim, it only limits the elements explicitly listed in the clause, and the elements recorded in other clauses are not excluded from the overall claim.

[0016] The following is a detailed description of a method for automatically checking the integrity of a dispatching command receiving point based on a tree diagram provided by the present invention. The contents not described in detail in the embodiments of the present invention belong to the prior art known to professional and technical personnel in the field. If no specific conditions are specified in the embodiments of the present invention, the conventional conditions in the field or the conditions recommended by the manufacturer are followed. The reagents or instruments used in the embodiments of the present invention, if the manufacturer is not specified, are all conventional products that can be purchased commercially.

[0017] like Figure 1 FIG. 1 is a flowchart of a method for automatically checking the integrity of a dispatch command receiving point based on a tree diagram provided by an embodiment of the present invention, which mainly includes the following steps: Step 1: Build a corresponding tree graph model for each subgraph in the operation graph base map, and integrate the tree graph models of all subgraphs to obtain complete subgraph connection relationship information.

[0018] In an embodiment of the present invention, a corresponding tree graph model is constructed for each subgraph (dispatching subsection) in the operation diagram base map, each subgraph contains connection information of all stations in a section, each subgraph is numbered respectively, and each subgraph serves as a node in the tree graph model and is marked with a corresponding subgraph number.

[0019] The tree graph model construction process of a single subgraph includes: Step A1: Take the single subgraph as the current node and execute a search method to obtain other subgraphs that are connected to the current node.

[0020] Step A2: for the retrieved single other subgraph, determine whether to prune it by using the pruning method. If yes, proceed to step A3; if not, proceed to step A4.

[0021] In one embodiment, determining whether to perform pruning by a pruning method includes: determining the station sequence between the subgraph corresponding to the current node and the single other subgraph by executing a cross-subgraph station sequence acquisition method, combined with the absolute relationship series of the current node; if the station sequence contains only one station, a pruning operation is required, that is, the corresponding single other subgraph is not constructed as a new node, and the process proceeds to step A3 for processing; if the station sequence contains more than one station, no pruning operation is performed, and the process proceeds to step A4 for processing; or, if the absolute relationship series length of the current node is less than 2, no pruning operation is performed, and the process proceeds to step A3 for processing; wherein the absolute relationship series lists all nodes passing 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.

[0022] Step A3: perform pruning operation, continue to read the next other subgraph retrieved, and go to step A2.

[0023] Step A4, determine whether to create a new branch through the branching method, if not, continue to read the next other subgraph retrieved, and go to step A2, if so, 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 execution, 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 go 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.

[0024] In one embodiment, the determining whether to create a new branch by the branching method includes: checking whether the absolute relationship series of the current node contains the single other subgraph, if so, not creating a new branch; if not, creating a new branch, that is, constructing the single other subgraph as a new node.

[0025] All subgraphs construct corresponding tree graph models in the above manner, and the complete subgraph connection relationship information is obtained by integrating the tree graph models of all subgraphs.

[0026] In one embodiment, an initial node can be set in the initial stage, and all subgraphs that are connected to the initial node are obtained by executing the retrieval method, wherein each subgraph in the base graph of the running diagram 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; the initial node is then 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.

[0027] Step 2: Automatically perform integrity check on the dispatch command receiving point in combination with the complete subgraph connection relationship information.

[0028] In an embodiment of the present invention, after receiving a 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.

[0029] In one embodiment, 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.

[0030] In one embodiment, the cross-subgraph station sequence acquisition method includes: determining all stations passed when entering the current subgraph from the starting subgraph and leaving the current subgraph from the terminating subgraph based on the starting subgraph, current subgraph and terminating subgraph information; wherein, when the cross-subgraph station sequence acquisition method is applied to the pruning method process, the starting subgraph, current subgraph and terminating subgraph information correspond to the second to last item, the last item and the single other subgraph of the absolute relationship series respectively.

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

[0032] In order to more clearly demonstrate the technical solution and technical effects provided by the present invention, the method provided by the embodiment of the present invention is described in detail with reference to specific embodiments below.

[0033] 1. The working principle of the integrity check of the dispatch command receiving point.

[0034] 1. Introduction to the relevant information of the operation diagram base map.

[0035] In train dispatching, train dispatchers edit and issue train operation plans on the operation diagram base map. The operation diagram base map is a two-dimensional image on a plane, such as Figure 3 The horizontal axis of the operation diagram base map represents time, which spans 24 hours; the vertical axis represents space, specifically showing the sub-sections, stations and tracks within the dispatching section. Figure 3 The operation diagram shown is the same as Figure 1 The connection diagram shown satisfies a one-to-one correspondence and can be divided into multiple sub-diagrams. Each sub-diagram can show the train operation plan in a specific section. On the operation diagram base map, as long as the sub-diagram number and station number are given at the same time, each station on the base map can be accurately located. Figure 3 The information in the table can also be equivalently expressed as the parameter table shown in Table 1. Figure 3 For example, if the subgraph number is 3 and the station number is 2, the corresponding station is station 9; similarly, if the subgraph number is 2 and the station number is 3, the corresponding station is station 6. Figure 1 Station 4, Station 8, and Station 11 are connecting stations. Figure 3 The sub-figures shown are labeled multiple times.

[0036] Table 1: Dispatching section operation diagram base map parameter table

[0037] 2. Method for obtaining station sequence.

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

[0039] (1) The method for obtaining the station sequence of the same sub-graph is as follows: Figure 4 As shown, it is used to query the station sequence under the given starting station and ending station conditions in the same sub-graph. During the execution of this method, three parameters, namely the current sub-graph number, the starting station number and the ending station number, are received. The function is to obtain all stations between the starting station number and the ending station number in the sub-graph number, and these stations are sorted according to the station number and stored as a sequence.

[0040] (2) Method for obtaining station sequences across sub-graphs.

[0041] The method for obtaining the station sequence across subgraphs is as follows: Figure 5 As shown, it is used to query the station sequence between two connecting stations between different subgraphs. The method first confirms all the connecting stations between the current subgraph and the adjacent subgraph, connecting station 1 is the station with the smallest station number among all the connecting stations, and connecting station 2 is the station with the largest station number among all the connecting stations. Then, connecting station 1 is used as the starting station and connecting station 2 is used as the ending station to obtain the station sequence under the conditions of the starting station and the ending station in the same subgraph. During the execution of this method, three parameters, namely the current subgraph number, the starting subgraph number, and the ending subgraph number, are received. The function is to obtain all the stations that enter the current subgraph from the starting subgraph and leave the current subgraph from the ending subgraph, and these stations are sorted according to the station number and stored as a sequence.

[0042] 3. Construct a tree diagram model.

[0043] In the dispatching section operation diagram base map, multiple submaps are interconnected through connecting stations. Starting from any specific submap, you can jump to other related submaps by connecting stations as transition points, and further expand to more submaps. Through this logical connection relationship between submaps, the connection relationship of the dispatching sub-section represented by the operation diagram base map can be constructed as follows Figure 6 The treemap model of the run chart base map shown. Figure 6 The four tree diagram models and Figure 3 Corresponding to the subgraph in the tree diagram, each node in the tree diagram has an information identifier, which is an absolute relationship series. The absolute relationship series lists the numbers of all subgraphs passed from the root node of the tree diagram to the terminal subgraph.

[0044] Figure 6Each dotted box in the figure represents a tree graph model corresponding to a subgraph, and the nodes in the tree graph model are related subgraphs. Figure 6 The sub-figure numbers are used to mark the corresponding sub-figures. For example, the dashed box on the upper left is the sub-figure. Figure 1 The corresponding tree diagram model, Figure 1 As the root node, the root node is directly marked as 1. Figure 2 connected, therefore, Figure 1 With the child Figure 2 The corresponding nodes 1 and 2 are connected, and the child Figure 2 The absolute relationship sequence of the corresponding node 2 is {1,2}, which means that from the root node (i.e. Figure 1 ) to the terminal subgraph (i.e. Figure 2 ) are the numbers of all subgraphs (all nodes) passed through.

[0045] Considering that subgraphs correspond to nodes, and all subgraphs are numbered and marked with subgraph numbers in the tree graph model, in order to facilitate intuitive understanding of the solution of the present invention, the subgraph numbers are directly used for description in the following introduction.

[0046] The overall process of constructing a tree diagram model from the dispatching section operation diagram base map is as follows: Figure 7 As shown, the process will call the retrieval method, branching method and pruning method in sequence, and determine the next operation based on the execution result of each step, and finally complete the tree diagram construction.

[0047] Figure 7 The overall flowchart shown first sets the initial node as the current node. After the process executes the retrieval method for the current node, it obtains all the subgraph numbers that satisfy the connectivity relationship, and then reads the subgraph numbers one by one and executes the pruning method and the branching method. 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 branching method creates a new node, the process sets the new node as the current node and executes the retrieval method. After the new branch is created, the retrieval results of the parent node will be stored in the cache, and the retrieval process of the remaining subgraph numbers will continue after the retrieval results of the new branch are completely traversed. If the current node has traversed all the retrieval results, the parent node is set as the current node and its retrieval results are loaded, and the traversal process of the previous level of the tree diagram continues until the process returns to the initial node and ends.

[0048] The specific contents of the retrieval method, pruning method and branching method involved in the above process are described in detail as follows: (1) Search method

[0049] The search method searches for all subgraph numbers that satisfy the connectivity relationship with the current node as the search result of the current node. The basis for judging the connectivity relationship is whether there is a connecting station between the searched subgraph and the subgraph corresponding to the current node. Figure 7 In the process shown, the initial node is connected to all subgraphs by default.

[0050] (2) Pruning method

[0051] The pruning method executes the cross-subgraph station sequence acquisition method for the current node. The starting subgraph number, current subgraph number, and ending subgraph number of the method correspond to the second to last item, the last item, and a search result of the current node (that is, the single other subgraph mentioned above) of the absolute relationship series of the current node, respectively. If the returned station sequence 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 performed, and the node corresponding to the ending subgraph number parameter (that is, a search result of the current node) should not be newly created. If the returned station sequence 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 performed, and the node corresponding to the ending subgraph number may be newly created. If the length of the absolute relationship series is less than 2, the pruning operation should not be performed due to the lack of relevant parameters of the starting subgraph and the ending subgraph.

[0052] (3) Branching method.

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

[0054] After all tree graph models are constructed, the complete subgraph connection relationship information can be obtained. For example, the absolute relationship series corresponding to all tree graph nodes are stored in the subgraph connection relationship table shown in Table 2. The data in Table 2 is based on Figure 6 The tree diagram model shown is constructed.

[0055] Table 2: Subgraph connection relationship table

[0056] 4. Automatically check the integrity of the command point.

[0057] During the period of being affected by an emergency or executing a construction plan, the automatic verification process of the command point of the present invention automatically parses the starting station name, the ending station name and the station sequence information selected by the train dispatcher in the dispatch command special program according to the dispatch command special program. Figure 8 The verification process shown automatically verifies the affected stations in the dispatching section, and automatically determines that the verification has failed if there are any missed or wrong dispatches.

[0058] Figure 8 The process shown first converts the name of the starting station and the name of the ending station into corresponding subgraph numbers and station serial numbers based on the base map information of the dispatching section operation diagram. If the subgraph numbers of the starting station and the ending station are the same, the same subgraph station sequence acquisition method is executed, and the obtained station sequence is loaded as the expected station sequence. If the subgraph numbers of the starting station and the ending station are inconsistent, the absolute relationship sequence is obtained from the subgraph connection relationship table according to the subgraph numbers of the starting station and the ending station. 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. For example, the subgraph to which the starting station belongs is the subgraph. Figure 3 , the subgraph to which the terminal station belongs is Figure 2 , then the absolute relationship sequence {3,2} is obtained through the above subgraph connection relationship table; then the absolute relationship sequence is set as the starting group, the ending group and multiple connection groups, and each cross-graph group contains the starting subgraph, the current subgraph and the ending subgraph information.

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

[0060] Table 3: How to set and load cross-graph grouping

[0061] Figure 8 The process shown traverses the cross-graph grouping and executes the sub-graph station sequence acquisition method across the sub-graph, 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 dispatch command dedicated program. If the two are consistent, it is automatically determined that the verification has passed. Otherwise, it means that the dispatch command has been missed or sent incorrectly, and the verification is automatically determined to have failed.

[0062] The above solution provided by the embodiment of the present invention constructs the operation diagram base map as a tree diagram model, and automatically verifies the receiving point according to the station information provided by the dispatching command dedicated program, so as to automatically determine the omission or wrong sending of the dispatching command. The beneficial effects brought by the automatic verification method of the integrity of the dispatching command receiving point can be summarized as follows: (1) Reduce errors caused by human factors such as fatigue, negligence or subjective judgment, and improve the accuracy of train dispatchers' verification of dispatch orders; (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.

[0063] 2. Example introduction.

[0064] For ease of understanding, an example is used for introduction. In this example, the tree diagram model is constructed and the command points are automatically checked based on the base map parameters of the dispatching section 1 operation diagram shown in Table 4. Dispatching section 1 is divided into 7 sub-maps, and there are connecting stations between different sub-maps. During the train dispatcher's duty, emergencies or construction plan impacts occur in dispatching section 1 as shown in Table 5, and the train dispatcher needs to use the dispatching command special program to deal with it. The details in Table 5 include the station sequence selected by the train dispatcher in the dispatching command special program, as well as the sub-map number and station serial number of the starting station and the ending station of the event. The sub-map number and station serial number are obtained by extracting the station name text from the dispatching command text by the dispatching command special program and parsing the station name text.

[0065] Table 4: Operation diagram base map parameter table for dispatching section 1

[0066] Table 5: Details of emergency or construction plan

[0067] 1. Construction of tree diagram model.

[0068] Since the initial node connects all subgraphs, the initial node obtains 5 search results after executing the search method. The search results are 5 subgraphs, corresponding to subgraph numbers 1, 2, 3, 4, and 5. As mentioned above, the tree graph model of the present invention is constructed for subgraphs. For ease of understanding, the subgraph numbers are also used directly for description below. The absolute relationship sequence of the current node is empty, represented by {}, and the search result is 1. Since the absolute relationship sequence of the initial node is {}, the relevant parameters of the starting subgraph and the ending subgraph 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, and the new node is marked as [1], corresponding to the subgraph numbered 1. 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 {1}, and then the new node is set as the current node.

[0069] (1) The steps for constructing the tree diagram model corresponding to sub-diagram number 1 of the dispatching section operation diagram base map shown in Table 4 are as follows: (1.1) The current node [1] executes the search method and obtains 2 search results, which are subgraph numbers 2 and 3. The absolute relationship sequence of the current node is {1}, and the search result is 2. Since the absolute relationship sequence of the current node is {1}, the relevant parameters of the starting subgraph and the ending subgraph 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, and the new node is marked as [2]. At the same time, the search 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 new node is set as the current node.

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

[0071] (1.3) The next search result of the current node [2] is 3. Here, 3 refers to the subgraph number 3. This is also the case in the following text, so I will not repeat it here. The starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 1, 2, and 3 respectively, and the station sequence returned is {26}. The station sequence contains only one station, so the pruning operation is performed. The search results of the nodes marked as 2 are all processed, and the parent node [1] is set as the current node and the search results are loaded.

[0072] (1.4) The next search 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}, the relevant parameters of the starting subgraph and the ending subgraph 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, and the new node is marked as [3]. At the same time, the search result of the current node is cached, and the absolute relationship sequence of the new tree diagram node is updated to {1,3}, and then the new node is set as the current node.

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

[0074] (1.6) The next search result of the current node [3] is 2, and the absolute relationship sequence is {1,3}. The starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 1, 3, and 2 respectively, and the returned station sequence is {26}. The station sequence contains only one station, so the pruning operation is performed and the next search result is read.

[0075] (1.7) The next search result of the current node [3] is 4, and the absolute relationship sequence is {1,3}. The starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 1, 3, and 4, respectively, and the returned station sequence is {22, 26}. The station sequence is greater than 1 station, 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, and the new 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 {1, 3, 4}, and then the new node is set as the current node.

[0076] (1.8) 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 {1, 3, 4}, 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 3, 4, and 3 respectively, and the returned station sequence is {22}. The station sequence contains only one station, so the pruning operation is performed and the next search result is read.

[0077] (1.9) The next search result of the current node [4] is 5, and the absolute relationship sequence is {1,3,4}. The starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 3,4,5, respectively, and the returned station sequence is {22}. The station sequence contains only one station, so the pruning operation is performed. The search results of the node marked as 4 are all processed, and the parent node [3] is set as the current node and the search results are loaded.

[0078] (1.10) The next search result of the current node [3] is 5, and the absolute relationship sequence is {1,3}. The starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 1, 3, and 5, respectively, and the returned station sequence is {22, 26}. The station sequence is greater than 1 station, 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, and the new 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 {1, 3, 5}, and then the new node is set as the current node.

[0079] (1.11) The current node [5] executes the search method and obtains 2 search results, which are subgraph numbers 3 and 4. The absolute relationship sequence of the current node is {1,3,5}, 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 3,5,3 respectively, and the returned station sequence is {22}. The station sequence contains only one station, so the pruning operation is performed and the next search result is read.

[0080] (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 subgraph number, current subgraph number and end subgraph number parameters of the pruning method are loaded as 3,5,4 respectively, and the returned station sequence is {22}. The station sequence contains only one station, so the pruning operation is performed. The search results of the node marked as 5 are all processed, and the parent node [3] is set as the current node and the search results are loaded.

[0081] (1.13) The search results of the current node [3] have been processed completely, set the parent node [1] as the current node and load the search results. After loading, the search results of the current node [1] have been processed completely, set the initial node as the current node and load the search results, and continue the tree diagram construction process of the next subgraph number.

[0082] (2) The steps for constructing the tree diagram model corresponding to sub-diagram number 2 of the dispatching section operation diagram base map shown in Table 4 are as follows: (2.1) The next search result of the initial node is subgraph number 2. Since the absolute relationship sequence of the initial node is {}, the relevant parameters of the starting subgraph and the ending subgraph 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, and the new node is marked as [2]. 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 {2}, and then the new node is set as the current node.

[0083] (2.2) The current node [2] executes the search method and obtains 2 search results, which are subgraph numbers 1 and 3. The absolute relationship sequence of the current node is {2}, and the first search result is 1. Since the absolute relationship sequence of the current node is {2}, the relevant parameters of the starting subgraph and the ending subgraph 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, and the new node is marked as [1]. 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 {2,1}, and then the new node is set as the current node.

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

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

[0086] (2.5) The next search result of the current node [2] is 3, and the absolute relationship sequence is {2}. Since the absolute relationship sequence of the current node is {2}, the relevant parameters of the starting subgraph and the ending subgraph 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, and the new node is marked as [3]. At the same time, the search result of the current node is cached, and the absolute relationship sequence of the new tree diagram node is updated to {2,3}, and then the new node is set as the current node.

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

[0088] (2.7) The next search result of the current node [3] is 2, and the absolute relationship sequence is {2,3}. The starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 2, 3, and 2 respectively, and the returned station sequence is {26}. The station sequence contains only one station, so the pruning operation is performed and the next search result is read.

[0089] (2.8) The next search result of the current node [3] is 4, and the absolute relationship sequence is {2,3}. The starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 2, 3, and 4, respectively, and the returned station sequence is {22, 26}. The station sequence is greater than 1 station, 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, and the new 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 {2, 3, 4}, and then the new node is set as the current node.

[0090] (2.9) 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 {2, 3, 4}, 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 3, 4, and 3 respectively, and the returned station sequence is {22}. The station sequence contains only one station, so the pruning operation is performed and the next search result is read.

[0091] (2.10) The next search result of the current node [4] is 5, and the absolute relationship sequence is {2,3,4}. The starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 3,4,5, respectively, and the returned station sequence is {22}. The station sequence contains only one station, so the pruning operation is performed. The search results of the node marked as 4 are all processed, and the parent node [3] is set as the current node and the search results are loaded.

[0092] (2.11) The current node [5] executes the search method and obtains 2 search results, which are subgraph numbers 3 and 4. The absolute relationship sequence of the current node is {2, 3, 5}, 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 3, 5, 3 respectively, and the returned station sequence is {22}. The station sequence contains only one station, so the pruning operation is performed and the next search result is read.

[0093] (2.12) The next search result of the current node [5] is 4, the absolute relationship sequence is {2,3,5}, the search result is 4, the start subgraph number, current subgraph number and end subgraph number parameters of the pruning method are loaded as 3,5,4 respectively, and the returned station sequence is {22}. The station sequence contains only one station, so the pruning operation is performed. The search results of the node marked as 5 are all processed, and the parent node [3] is set as the current node and the search results are loaded.

[0094] (2.13) The search results of the current node [3] have been processed completely, set the parent node [2] as the current node and load the search results. After loading, the search results of the current node [2] have been processed completely, set the initial node as the current node and load the search results, and continue the tree diagram construction process of the next subgraph number.

[0095] (3) The steps for constructing the tree diagram model corresponding to sub-diagram number 3 of the dispatching section operation diagram base map shown in Table 4 are as follows: (3.1) The next search result of the initial node is the subgraph corresponding to subgraph number 3. Since the absolute relationship sequence of the initial node is {}, the relevant parameters of the starting subgraph and the ending subgraph 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, and the new node is marked as [3]. 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}, and then the new node is set as the current node.

[0096] (3.2) The current node [3] executes the search method and obtains 4 search results, which are subgraph numbers 1, 2, 4, and 5. The absolute relationship sequence of the current node is {3}, and the first search result is 1. Since the absolute relationship sequence of the current node is {3}, the relevant parameters of the starting subgraph and the ending subgraph 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, and the new node is marked as [1]. 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,1}, and then the new node is set as the current node.

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

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

[0099] (3.5) The next search 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}, the relevant parameters of the starting subgraph and the ending subgraph 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, and the new node is marked as [2]. At the same time, the search result of the current node is cached, and the absolute relationship sequence of the new tree diagram node is updated to {3,2}, and then the new node is set as the current node.

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

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

[0102] (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}, the relevant parameters of the starting subgraph and the ending subgraph 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, and the new 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 diagram node is updated to {3,4}, and then the new node is set as the current node.

[0103] (3.9) 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 {3, 4}, and the first search result is 3. The starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 3, 4, and 3 respectively, and the returned station sequence is {22}. The station sequence contains only one station, so the pruning operation is performed and the next search result is read.

[0104] (3.10) The next search result of the current node [4] is 5, and the absolute relationship sequence is {3, 4}. The starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 3, 4, and 5 respectively, and the station sequence returned is {22}. The station sequence contains only one station, so the pruning operation is performed. The search results of the node marked as 4 are all processed, and the parent node [3] is set as the current node and the search results are loaded.

[0105] (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}, the relevant parameters of the starting subgraph and the ending subgraph 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, and the new 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 diagram node is updated to {3,5}, and then the new node is set as the current node.

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

[0107] (3.13) The next search result of the current node [5] is 4, and the absolute relationship sequence is {3,5}. The starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 3, 5, and 4 respectively, and the returned station sequence is {22}. The station sequence contains only one station, so the pruning operation is performed. The search results of the node marked as 5 are all processed, and the parent node [3] is set as the current node and the search results are loaded.

[0108] (3.14) The search results of the current node [3] have been processed. Set the initial node as the current node and load the search results. Continue the tree diagram construction process of the next subgraph number.

[0109] (4) The steps for constructing the tree diagram model corresponding to sub-diagram number 4 of the dispatching section operation diagram base map shown in Table 4 are as follows: (4.1) The next search result of the initial node is 4. Since the absolute relationship sequence of the initial node is {}, the relevant parameters of the starting subgraph and the ending subgraph 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, and the new node is marked as [3]. 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 {4}, and then the new node is set as the current node.

[0110] (4.2) The current node [4] executes the search method and obtains two search results, which are subgraph numbers 3 and 5. The absolute relationship sequence of the current node is {4}, and the first search result is 3. Since the absolute relationship sequence of the current node is {4}, the relevant parameters of the starting subgraph and the ending subgraph 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, and the new node is marked as [3]. 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 {4,3}, and then the new node is set as the current node.

[0111] (4.3) The current node [3] executes the search method and obtains 4 search results, which are subgraph numbers 1, 2, 4, and 5. The absolute relationship sequence of the current node is {4,3}, and the first search result is 1. The starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 4, 3, and 1 respectively, and the returned station sequence is {22, 26}. The station sequence is greater than 1 station, 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, and the new node is marked as [1]. 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 {4, 3, 1}, and then the new node is set as the current node.

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

[0113] (4.5) The next search 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}. The station sequence contains only one station, so the pruning operation is performed. The search results of the nodes marked as 1 are all processed, and the parent node [3] is set as the current node and the search results are loaded.

[0114] (4.6) The next search 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 search result is 2. The starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 4, 3, and 2 respectively, and the returned station sequence is {22, 26}. The station sequence is greater than 1 station, 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, and the new node is marked as [2]. 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 {4, 3, 2}, and then the new node is set as the current node.

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

[0116] (4.8) The next search 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}. The station sequence contains only one station, so the pruning operation is performed. The search results of the nodes marked as 2 are all processed, and the parent node [3] is set as the current node and the search results are loaded.

[0117] (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 starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 4, 3, and 4 respectively, and the returned station sequence is {22}. The station sequence contains only one station, so the pruning operation is performed and the next search result is read.

[0118] (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 starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 4, 3, and 5 respectively, and the returned station sequence is {22}. The station sequence contains only 1 station, so the pruning operation is performed and the next search result is read. The search results of the node marked as 3 are all processed, and the parent node [4] is set as the current node and the search results are loaded.

[0119] (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 starting subgraph and the ending subgraph 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, and the new 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 diagram node is updated to {4,5}, and then the new node is set as the current node.

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

[0121] (4.13) The next search result of the current node [5] is 4, and the absolute relationship sequence is {4,5}. The starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 4, 5, and 4, respectively, and the returned station sequence is {22}. The station sequence contains only one station, so the pruning operation is performed. All the 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 results are loaded.

[0122] (4.14) The search results of the current node [4] have been processed. Set the initial node as the current node and load the search results. Continue the tree diagram construction process of the next subgraph number.

[0123] (5) The steps for constructing the tree diagram model corresponding to sub-diagram number 5 of the dispatching section operation diagram base map shown in Table 4 are as follows: (5.1) The next search result of the initial node is 5. Since the absolute relationship sequence of the initial node is {}, the relevant parameters of the starting subgraph and the ending subgraph 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, and the new 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 {5}, and then the new node is set as the current node.

[0124] (5.2) The current node [5] executes the search method and obtains two search results, which are subgraph numbers 3 and 4. The absolute relationship sequence of the current node is {5}, and the first search result is 3. Since the absolute relationship sequence of the current node is {5}, the relevant parameters of the starting subgraph and the ending subgraph 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, and the new node is marked as [3]. 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,3}, and then the new node is set as the current node.

[0125] (5.3) The current node [3] executes the search method and obtains 4 search results, which are subgraph numbers 1, 2, 4, and 5. The absolute relationship sequence of the current node is {5,3}, and the first search result is 1. The starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 5, 3, and 1 respectively, and the returned station sequence is {22, 26}. The station sequence is greater than 1 station, 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, and the new node is marked as [1]. 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, 3, 1}, and then the new node is set as the current node.

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

[0127] (5.5) The next search result of the current node [1] is 3, and the absolute relationship sequence is {5,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}. The station sequence contains only one station, so the pruning operation is performed. The search results of the nodes marked as 1 are all processed, and the parent node [3] is set as the current node and the search results are loaded.

[0128] (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 starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 5, 3, and 2 respectively, and the returned station sequence is {22, 26}. The station sequence is greater than 1 station, 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, and the new node is marked as [2]. 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, 3, 2}, and then the new node is set as the current node.

[0129] (5.7) The current node [2] executes the search method and obtains 2 search results, which 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 starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 3, 2, and 1 respectively, and the returned station sequence is {26}. The station sequence contains only one station, so the pruning operation is performed and the next search result is read.

[0130] (5.8) The next search result of the current node [2] is 3, and the absolute relationship sequence is {5,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}. The station sequence contains only one station, so the pruning operation is performed. The search results of the nodes marked as 2 are all processed, and the parent node [3] is set as the current node and the search results are loaded.

[0131] (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 starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 5, 3, and 4 respectively, and the returned station sequence is {22}. The station sequence contains only one station, so the pruning operation is performed and the next search result is read.

[0132] (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 starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 5, 3, and 5, respectively, and the returned station sequence is {22}. The station sequence contains only one station, so the pruning operation is performed and the next search result is read. The search results of the node marked as 3 are all processed, and the parent node [5] is set as the current node and the search results are loaded.

[0133] (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 starting subgraph and the ending subgraph 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, and the new 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 diagram node is updated to {5,4}, and then the new node is set as the current node.

[0134] (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 starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 5, 4, and 3 respectively, and the returned station sequence is {22}. The station sequence contains only one station, so the pruning operation is performed and the next search result is read.

[0135] (5.13) The next search result of the current node [4] is 5, and the absolute relationship sequence is {5, 4}. The starting subgraph number, current subgraph number, and ending subgraph number parameters of the pruning method are loaded as 5, 4, and 5, respectively, and the returned station sequence is {22}. The station sequence contains only one station, so 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 results are loaded.

[0136] (5.14) The search results for the current node [5] have all been processed.

[0137] like Fig. 9 As shown, this is the tree graph model of the above 5 subgraphs. The tree graph model of each subgraph can be distinguished by the root node of the tree graph model. For example, the tree graph model in the upper left corner has a root node of 1, which means it is the tree graph model of subgraph number 1.

[0138] Based on the above process, all the initial node search results are processed and stored as the scheduling section 1 subgraph connection relationship table shown in Table 6 according to the starting subgraph number and the ending subgraph number of the absolute relationship series information.

[0139] Table 6: Schedule section 1 subgraph connection relationship table

[0140] 2. Automatically check the integrity of the command receiving point.

[0141] (1) The steps for automatic verification of the command point corresponding to event 1 in Table 5 are as follows: (1.1) The dispatch command dedicated program parses the dispatch command text and obtains the sub-map number 3 and station number 29 of the starting station of event 1 and the sub-map number 3 and station number 33 of the ending station.

[0142] (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 same subgraph station sequence acquisition method is executed. The subgraph number is 3, the starting station sequence number is 29, and the ending station sequence number is 33. The returned station sequence is {29, 30, 32, 33}, and the expected station sequence is {29, 30, 32, 33}.

[0143] (1.3) In event 1, the station sequence selected by the train dispatcher on the dispatch command special program is {29, 30, 32, 33}, which is consistent with the expected station sequence {29, 30, 32, 33}, so it is automatically judged that the verification has passed.

[0144] (2) The steps for automatic verification of the command point corresponding to event 2 in Table 5 are as follows: (2.1) The dispatch command dedicated program parses the dispatch command text and obtains the subgraph number 2 and station number 23 of the starting station of event 2 and the subgraph number 3 and station number 27 of the ending station.

[0145] (2.2) The subgraph number of the starting station is 2, and the subgraph number of the ending station is 3. Since the subgraph numbers of the starting station and the ending station are inconsistent, the corresponding absolute relation sequence {2,3} is obtained from Table 6. The first two subgraph numbers 2 and 3 are taken from the absolute relation sequence. The first subgraph number 2 is set as the current subgraph, the second subgraph number 3 is set as the starting subgraph and the ending subgraph, and the starting group of the absolute relation sequence {2,3} is set to {3,2,3}. The last two subgraph numbers 2 and 3 are taken from the absolute relation sequence, the second subgraph number is set as the current subgraph, the first subgraph number is set as the starting subgraph and the ending subgraph, and the ending group of the absolute relation sequence {2,3} is set to {2,3,2}. Since the number of subgraph numbers contained in the absolute relation sequence {2,3} is less than 3, there is no connected grouping in this sequence.

[0146] (2.3) The current group is the starting 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, the ending station 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 group.

[0147] (2.4) The current group is the terminal group {2,3,2}. Execute the method to obtain the station sequence across subgraphs to obtain the current subgraph. Figure 3 The station number of the connecting station is 26. Then execute the same subgraph station sequence acquisition method, the subgraph number is 3, the starting station number is 26, and the ending station number is 27. The station sequence {26, 27} is obtained, and the expected station sequence is loaded as {23, 26, 27}. All grouping is completed.

[0148] (2.5) In event 2, the station sequence selected by the train dispatcher on the dispatch command special program is {23,22,27}, which is inconsistent with the expected station sequence {23,26,27}. The dispatch command is sent incorrectly, so the automatic check fails.

[0149] (3) The steps for automatic verification of the command point corresponding to event 3 in Table 5 are as follows: (3.1) The dispatch command dedicated program parses the dispatch command text and obtains the subgraph number 4 and station number 31 of the starting station of event 3 and the subgraph number 2 and station number 23 of the ending station.

[0150] (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}.

[0151] (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.

[0152] (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.

[0153] (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.

[0154] (3.6) In event 3, the station sequence selected by the train dispatcher on the dispatch command special program is {22,23,26,31}, which is inconsistent with the expected station sequence {22,23,26,28,31}. The dispatch command is missed, so the automatic verification is judged to have failed.

[0155] Through the description of the above implementation methods, those skilled in the art can clearly understand that the above embodiments can be implemented by software, or by means of software plus necessary general hardware platforms. Based on such understanding, the technical solutions of the above embodiments can be embodied in the form of software products, 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 enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in the various embodiments of the present invention.

[0156] The above is only a preferred specific embodiment of the present invention, but the protection scope of the present invention is not limited thereto. Any changes or substitutions that can be easily thought of by a person skilled in the art within the technical scope disclosed in the present invention should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention should be based on 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 number 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