Driving dispatching command checking method based on longest common subsequence

Abstract

The invention discloses a method for checking a train dispatching command based on a longest common subsequence, which can improve the accuracy of the train dispatching command, process information of a plurality of correlative elements and improve the efficiency of train dispatching command work, thereby solving the related problems in the prior art. When unexpected text deletion and modification exist in the driving dispatching command element information, the element information can be identified through a context matching mechanism, the information legality is judged, and the accuracy of the driving dispatching command is improved; and a plurality of correlative element information can be processed, the complex information checking requirement in actual train dispatching work is met, and meanwhile, the efficiency of train dispatching command work is improved.

Description

Technical Field

[0001] The invention relates to the technical field of train dispatching order verification in railways, and in particular to a train dispatching order verification method based on the longest common subsequence. Background Art

[0002] In the train dispatching command system, the train dispatching order is edited, drafted and issued by the train dispatcher. It is the written basis for organizing the coordination of multiple types of work in construction operations or emergencies. The text of the train dispatching order contains basic information such as the line name, station name, dispatching desk name, train number, speed limit kilometer mark and change length parameters. Incorrect information can easily cause confusion and errors in the transportation organization of different types of work. The train dispatcher needs to coordinate with other positions to conduct single or multiple verifications and issue the train dispatching order after confirmation.

[0003] In the train dispatching command system and the centralized dispatching system, the use of computer programs to assist in the verification of train dispatching orders has become a key method to improve the efficiency of train dispatching operations and the accuracy of element information. The verification program uses a specific information parsing method to identify and extract the element information of the train dispatching order, and then combines the real-time information (train number, train section location, etc.) mastered by the train dispatcher and the effective information provided by other positions (construction plan, strong wind warning, earthquake warning, etc.) to verify the integrity of the ordered object, the accuracy of element information, and the coordination of multiple types of work of the train dispatching order. The verification program can quickly identify potential errors in the text of the train dispatching order, and immediately notify the train dispatcher through the human-computer interface to ensure that the train dispatching order issued by the train dispatcher complies with the transportation safety and type of work coordination specifications, which has a good effect of reducing the workload of the train dispatcher.

[0004] The verification method adopted by the prior art performs a preprocessing process of standardizing and cleaning the text of the train dispatching command through a word knowledge base, and then uses regular expressions to realize the recognition and extraction of the element information of the train dispatching command, and then checks and verifies the extracted content. Specifically, the prior art first constructs a word knowledge base containing reference information such as similar words, useless words, and keywords, and then replaces non-standard terms in the text of the train dispatching command according to given similar words, cleans invalid text in the text of the train dispatching command according to given useless words, and then uses keywords to construct regular expressions to effectively extract element information such as train number, speed limit value, kilometer mark, etc. from the text of the train dispatching command, and then judges and verifies the accuracy of the element information by obtaining the interface operation status and the train dispatching reference information mastered by the train dispatcher, and completes the verification process of the train dispatching command.

[0005] However, in the high-intensity train dispatching work, unexpected deletion or modification of text may occur in the body of the train dispatching order. The existing technology is highly dependent on regular expressions constructed by keywords. The deletion and modification of words in the body of the train dispatching order will cause the existing technology to be unable to correctly identify the element information, affecting the accuracy of the identification and extraction of the train dispatching order element information. In addition, the existing technology is limited to the extraction of single element information, and has limitations when dealing with contextual correlations between multiple elements, and cannot meet the verification needs of multiple interrelated element information in actual train dispatching work. Due to the lack of a mechanism for processing multiple context-related element information, the existing technology is difficult to meet the more complex verification requirements, which has formed a certain degree of restriction on the efficiency and accuracy of train dispatching and command work. Summary of the invention

[0006] The purpose of the present invention is to provide a train dispatching command verification method based on the longest common subsequence, which can improve the accuracy of train dispatching commands, process multiple interrelated element information, improve the efficiency of train dispatching and command work, and thus solve the related problems existing in the prior art.

[0007] The objective of the present invention is achieved through the following technical solutions:

[0008] A vehicle dispatching command verification method based on the longest common subsequence comprises:

[0009] The driving dispatch command body and the driving dispatch command template are grouped separately, which are called text groups and template groups respectively, and the groups are matched. Then, based on the longest common subsequence algorithm and the set screening conditions, the corresponding template group is screened for each text group, and the added part and the shared part calculated by the longest common subsequence algorithm are obtained;

[0010] For each text grouping, a context matching mechanism is constructed using the corresponding added parts and common parts. Combined with the preset keyword parameter table for matching the previous and next contexts, the previous and next contexts are matched from the common parts of the text groupings, and the added parts and common parts between the previous and next contexts are taken out as element information and stored in the verification content linked list group. When all text groups are matched, the obtained verification content linked list group is checked.

[0011] It can be seen from the technical solution provided by the present invention that when there is unexpected text deletion or modification in the element information of the train dispatching command, the context matching mechanism can be used to identify the element information and determine the legitimacy of the information, thereby improving the accuracy of the train dispatching command; and multiple interrelated element information can be processed to meet the complex information verification needs in actual train dispatching work, while improving the efficiency of train dispatching and command work. BRIEF DESCRIPTION OF THE DRAWINGS

[0012] 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.

[0013] Figure 1 A flowchart of a vehicle dispatching command verification method based on the longest common subsequence provided by an embodiment of the present invention;

[0014] Figure 2 A schematic diagram of the process of processing a vehicle dispatching command by the LCS algorithm provided in an embodiment of the present invention;

[0015] Figure 3 A schematic diagram of a process of grouping and pairing a vehicle dispatching command body and a vehicle dispatching command template provided by an embodiment of the present invention;

[0016] Figure 4 A schematic diagram of a retention result of group pairing provided by an embodiment of the present invention;

[0017] Figure 5 A schematic diagram of a context matching mechanism of a vehicle dispatch command verification method provided by an embodiment of the present invention;

[0018] Figure 6 A schematic diagram of a verification content linked list group of a vehicle dispatch command verification method provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0019] 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.

[0020] First, the terms that may be used in this article are explained as follows:

[0021] 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.

[0022] 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.

[0023] Unless otherwise specified or limited, the terms "installed", "connected", "connected", "fixed" and the like should be understood in a broad sense, for example: it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection, or it can be an indirect connection through an intermediate medium, or it can be the internal communication of two components. For ordinary technicians in this field, the specific meanings of the above terms in this article can be understood according to specific circumstances.

[0024] The following is a detailed description of a vehicle dispatching command verification method based on the longest common subsequence 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 professionals in the field. If no specific conditions are specified in the embodiments of the present invention, the conditions are carried out according to the conventional conditions in the field or the conditions recommended by the manufacturer. If the manufacturer of the reagents or instruments used in the embodiments of the present invention is not specified, they are all conventional products that can be purchased commercially.

[0025] like Figure 1 As shown, a vehicle dispatching command verification method based on the longest common subsequence mainly includes the following steps:

[0026] Step 1: Calculate the added part and the shared part of the vehicle dispatching order body and the vehicle dispatching order based on the longest common subsequence algorithm.

[0027] In this step, the driving dispatch command body and the driving dispatch command template are grouped separately, which are called text groups and template groups respectively, and the groups are paired. Then, based on the longest common subsequence algorithm and the set screening conditions, the corresponding template group is screened out for each text group, and the calculation result of the longest common subsequence algorithm is obtained, including: an added part, a deleted part and a shared part; among them, the added part and the shared part are used to construct a context matching mechanism, and the deleted part is used to distinguish the added part from the shared part and does not participate in subsequent processing.

[0028] Preferably, the vehicle dispatch command body and the vehicle dispatch command template each contain text content of several paragraphs, and different paragraphs are separated by separators; the vehicle dispatch command body and the vehicle dispatch command template are each grouped according to the separators.

[0029] Preferably, the method of selecting a corresponding template group for each text group based on the longest common subsequence algorithm and set screening conditions includes: pairing each text group with a number of template groups, and calculating the text length of the common part between each text group and each template group in the pairing based on the longest common subsequence algorithm; and selecting the template group with the longest text length of the common part.

[0030] Preferably, the step of obtaining the added part, deleted part and shared part calculated by the longest common subsequence algorithm includes: obtaining the added part, deleted part and shared part of each text group relative to the template group with the longest text length.

[0031] Step 2: Based on the added part and the shared part, a context matching mechanism is constructed to identify element information and implement driving dispatch command verification.

[0032] In this step, for each text grouping, a context matching mechanism is constructed using the corresponding added parts and common parts, and the preset keyword parameter table for matching the previous and next contexts is combined to match the previous and next contexts from the common parts of the text groupings, and the added parts and common parts between the previous and next contexts are taken out as element information and stored in the verification content linked list group; when all text groups are matched, the obtained verification content linked list group is checked.

[0033] In the embodiment of the present invention, the added part, deleted part and common part all contain text information and index information; wherein the index information of the added part and the common part comes from the corresponding text group, and the index information of the deleted part comes from the corresponding template group.

[0034] Preferably, the preset keyword parameter table stores phrase information associated with the context, each phrase includes a plurality of keyword pairs, each keyword pair includes two keywords, and the corresponding contexts are used to match the preceding and following contexts of the text grouping.

[0035] Preferably, the combination of the preset keyword parameter table for matching the preceding and following contexts, matching the preceding and following contexts from the common part of the text grouping, and taking out the added part and the common part between the preceding and following contexts as element information includes: selecting all keyword pairs required for the inspection process from the preset keyword parameter table; matching the first keyword pair from the beginning of the text grouping, and matching subsequent keyword pairs after the matching position of the previous keyword pair; if the first keyword of the keyword pair is the same as a certain text content of the common part in the text grouping or satisfies the inclusion relationship, the corresponding text content of the common part is the preceding context, if the second keyword of the keyword pair is the same as a certain text content of the common part in the text grouping or satisfies the inclusion relationship, the corresponding text content of the common part is the following context, taking out the added part and the common part between the preceding and following contexts, and obtaining all the text information as element information in combination with the corresponding index information.

[0036] Preferably, the storing of the verification content linked list group includes: the verification content linked list group includes multiple linked lists, each linked list corresponds to a single unique phrase serial number; after obtaining the element information, according to the current phrase serial number, creating or calling out the corresponding linked list in the linked list group and storing the corresponding element information.

[0037] Preferably, the verification check on the obtained verification content linked list group includes: verifying the obtained verification content linked list group according to the type of verification check and in combination with the imported train scheduling reference information; wherein the train scheduling reference information includes: station name, train number, power supply card number and command receiving range.

[0038] The above-mentioned scheme provided by the embodiment of the present invention can improve the accuracy of train dispatching commands, and can process multiple interrelated element information, thereby improving the efficiency of train dispatching and commanding work, thereby solving related problems existing in the prior art.

[0039] 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 below.

[0040] 1. The working principle of the vehicle dispatching command verification method.

[0041] The longest common subsequence (LCS) algorithm is a method for finding the longest shared part between two or more sequences. The algorithm compares the elements in the sequence to find the longest subsequence that is common to all sequences. The basic principle of the LCS algorithm is dynamic programming, which records the solutions to subproblems by constructing a two-dimensional array, and gradually fills the array to eventually determine the longest common subsequence. In the text recognition of the railway bureau's train dispatching orders, by comparing the train dispatching order template and the train dispatching order text, the LCS algorithm can identify the added parts, deleted parts, and the common parts that remain unchanged in the train dispatching order text relative to the train dispatching order template. The process of using the LCS algorithm to process train dispatching orders is as follows: Figure 2 shown. Figure 2 The shared part, added part and deleted part contain text information and index information of related texts.

[0042] 2. Calculate the added, deleted and shared parts of the vehicle dispatch order body and the vehicle dispatch order based on the longest common subsequence algorithm.

[0043] In the train dispatching command system, the train dispatching command needs to record the details of the transportation organization of multiple types of work. The train dispatching command text and the train dispatching command template therefore contain the text content of multiple paragraphs, and different paragraphs are separated by separators (for example, carriage return symbols). The train dispatching command text and the train dispatching command template can be divided into several independent text groups and template groups based on the carriage return symbol, and the train dispatching command text and the train dispatching command template group matching process is performed. In the matching process, each text group establishes a combination relationship with each template, such as Figure 3 shown.

[0044] After the group matching is completed, the LCS algorithm is used to calculate the length of the common text in each pairing, and the template group with the longest common text length and its LCS algorithm calculation result are retained for each text group. Figure 3 The results of group pairing are as follows: Figure 4 The pairing with the longest common text length is marked by a solid line in the figure, and the calculation results of other template groups are no longer retained and are marked by dotted lines in the figure.

[0045] 3. Build a context matching mechanism to identify element information and implement driving dispatch command verification.

[0046] The calculation results of the LCS algorithm for a single group pairing include the added part, deleted part, and shared part of the text group relative to the template group, and each part is composed of text information and index information. The index information used by the added part and the shared part comes from the text group, and the index information used by the deleted part comes from the template group; among them, the deleted part is mainly used to distinguish the added part from the shared part, and the calculated deleted part is not further processed.

[0047] By calling the information of the added part and the shared part, the following is constructed according to the order of the text content in the text grouping: Figure 5 The context matching mechanism shown extracts element information from the body of the vehicle dispatch command. Figure 5 An example of constructing a context matching mechanism using two text groups corresponding to an added part and a common part is provided, and the various index information involved in this example is only for example.

[0048] Figure 5 In , the keyword parameter table is used to store phrase information associated with the context, and each phrase contains multiple keyword pairs. Each keyword pair consists of two keywords, which are used to match the previous and next context of the text group. The first keyword pair processed by the vehicle dispatch command verification method is matched from the beginning of the text group, and the subsequent keyword pairs start searching after the matching position of the previous keyword pair. If the first keyword of the keyword pair is the same as a certain text content in the common part of the text group or satisfies the inclusion relationship, the corresponding text content of the common part is the previous context. If the second keyword of the keyword pair is the same as a certain text content in the common part of the text group or satisfies the inclusion relationship, the corresponding text content of the common part is the following context, that is, the matching relationship between the keyword and the corresponding common part is established, and the added part and the common part between the previous and next context are taken out, and all the text information is obtained as element information in combination with the corresponding index information and stored in Figure 6 In the check content linked list group shown.

[0049] Figure 6 The verification content linked list group shown is composed of multiple linked lists, and each linked list corresponds to a single unique phrase number. After obtaining the text information as the element information, according to the current phrase number, the corresponding linked list is created or called out in the linked list group and the element information is stored. When executing the verification check logic, the element information is called out from the linked list group for verification. The type of verification check can be the legitimacy of the station name, the consistency of the command text, and other inspection types. In addition, the present invention can import train scheduling reference information for verification, and the train scheduling reference information can be information such as the station name, train number, power supply card number, and command receiving range.

[0050] For ease of understanding, relevant examples are provided below for illustration based on the above-introduced solution.

[0051] In the following example, the train dispatching command shown in Table 1 is verified, including two types of verification checks: station name legitimacy check and command text consistency check. The train dispatching command numbered 1 corresponds to the station name legitimacy check, and the train dispatching command numbered 2 corresponds to the command text consistency check.

[0052] Table 1: Driving dispatch command and template examples

[0053]

[0054] Example 1: Checking the validity of station names

[0055] After grouping the train dispatch command body and the train dispatch command template according to the carriage return symbol, the text grouping and template grouping results are shown in Table 2 and Table 3.

[0056] Table 2: Text grouping results of station name validity check

[0057]

[0058] Table 3: Template grouping results for station name validity check

[0059]

[0060] The process of grouping and pairing the driving dispatch command body and the driving dispatch command template is performed. After the grouping and pairing is completed, the LCS algorithm is executed to calculate the common part and its text length in each pairing. The calculation results of the grouping and pairing are shown in Table 4. The pairing with the longest common part text length and the calculation results of the LCS algorithm are retained from the grouping and shown in Table 5.

[0061] Table 4: Group pairing calculation results of station name validity check

[0062]

[0063] Table 5: Selected group pairing information for station name validity check

[0064]

[0065] According to the added part and common part information shown in Table 5, all keyword pairs used in the station name legitimacy check process are taken out from the keyword parameter table, and a matching relationship between the common part and the context keyword is established in the text grouping. According to the index information obtained by matching the context keyword, the adjacent added part and common part are determined as element information, as shown in Table 6.

[0066] Table 6: Keyword pairs and index information for station name validity check

[0067]

[0068] When performing the station name validity check, first obtain the first element information in the linked list corresponding to each phrase number from the verification content linked list group, then import the train dispatch reference information, and obtain the legal station names A, B, C, D, E, and F. By comparing the element information with the legal station names, it is determined that A1 is not a station name and B is a station name, thereby completing the station name validity verification process.

[0069] Example 2: Command text consistency check.

[0070] The vehicle dispatching command verification method groups the vehicle dispatching command text and the vehicle dispatching command template according to the carriage return symbol. The text grouping and template grouping results are shown in Table 7 and Table 8.

[0071] Table 7: Text grouping results of command text consistency check

[0072]

[0073] Table 8: Text grouping results of command text consistency check

[0074]

[0075] The vehicle dispatching command verification method performs a grouping and pairing process of the vehicle dispatching command body and the vehicle dispatching command template. After the grouping and pairing are completed, the vehicle dispatching command verification method executes the LCS algorithm to calculate the common part and its text length in each pairing. The calculation results of the grouping and pairing are shown in Table 9. The vehicle dispatching command verification method retains the pairing with the longest common part text length and the calculation results of the LCS algorithm from the grouping and pairing, as shown in Table 10.

[0076] Table 9: Group pairing calculation results of command text consistency check

[0077]

[0078]

[0079] Table 10: Selected group pairing information for command text consistency check

[0080]

[0081] According to the added part and the common part information shown in Table 10, the driving dispatch command verification method takes out all the keyword pairs used in the command text consistency check process from the keyword parameter table, and establishes a matching relationship between the common part and the context keyword in the text grouping. According to the index information obtained by matching the context keyword, the driving dispatch command verification method determines the adjacent added part and the common part as element information, as shown in Table 11.

[0082] Table 11: Keyword pairs and index information for command text consistency check

[0083]

[0084] When executing the command text consistency check, the driving dispatch command verification method obtains the element information with the same keyword pair ID from each verification content linked list group. When the keyword pair ID is 1, the element information corresponds to the text part of "B station II channel" in different text groups; when the keyword pair ID is 2, the element information corresponds to the text part of "C station III channel" in different text groups. Since the text content in different text groups is consistent, the driving dispatch command verification method determines that the text in the driving dispatch command is consistent, and then completes the verification process of the command text consistency.

[0085] 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.

[0086] 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 any technician familiar with the technical field 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. The information disclosed in the background technology section of this article is only intended to deepen the understanding of the overall background technology of the present invention, and should not be regarded as an admission or in any form that the information constitutes prior art known to those skilled in the art.

Claims

1. A vehicle dispatching command verification method based on the longest common subsequence, characterized in that: include: The driving dispatch command body and the driving dispatch command template are grouped separately, which are called text groups and template groups respectively, and the groups are matched. Then, based on the longest common subsequence algorithm and the set screening conditions, the corresponding template group is screened for each text group, and the added part and the shared part calculated by the longest common subsequence algorithm are obtained; For each text grouping, a context matching mechanism is constructed using the corresponding added parts and common parts. Combined with the preset keyword parameter table for matching the previous and next contexts, the previous and next contexts are matched from the common parts of the text groupings, and the added parts and common parts between the previous and next contexts are taken out as element information and stored in the verification content linked list group. When all text groups are matched, the obtained verification content linked list group is checked.

2. The vehicle dispatching command verification method based on the longest common subsequence according to claim 1 is characterized in that: The grouping of the driving dispatch command body and the driving dispatch command template comprises: The driving dispatch order body and the driving dispatch order template each contain text content of several paragraphs, and different paragraphs are separated by separators; The vehicle dispatching command body and the vehicle dispatching command template are grouped separately according to the separation symbol.

3. The vehicle dispatching command verification method based on the longest common subsequence according to claim 1 is characterized in that: The method of filtering out corresponding template groups for each text group based on the longest common subsequence algorithm and the set filtering conditions includes: Each text group is paired with a number of template groups, and based on the longest common subsequence algorithm, the length of the common part between each text group and each template group in the pair is calculated; Select the template group with the longest common text length.

4. The method for checking vehicle dispatching commands based on the longest common subsequence according to claim 3, characterized in that: The added part and the shared part calculated by the algorithm for obtaining the longest common subsequence include: Obtain the added portion and the shared portion of each text group relative to the template group with the longest text length.

5. A vehicle dispatching command verification method based on the longest common subsequence according to claim 1 or 4, characterized in that: The added part and the common part both contain text information and index information, and the index information of the added part and the common part comes from the corresponding text grouping.

6. The method for checking vehicle dispatching commands based on the longest common subsequence according to claim 1, characterized in that: The combination of the preset keyword parameter table for matching the preceding and following texts, matching the preceding and following texts from the common parts of the text groups, and taking out the added part and the common part between the preceding and following texts as element information includes: Select all the keyword pairs required for the inspection process from the preset keyword parameter table; The first keyword pair is matched from the beginning of the text grouping, and the subsequent keyword pairs are matched after the matching position of the previous keyword pair; if the first keyword of the keyword pair is the same as a text content in the common part of the text grouping or satisfies the inclusion relationship, the corresponding text content of the common part is the previous context; if the second keyword of the keyword pair is the same as a text content in the common part of the text grouping or satisfies the inclusion relationship, the corresponding text content of the common part is the following context, the added part and the common part between the previous context and the following context are taken out, and all the text information is obtained as element information in combination with the corresponding index information.

7. The method for checking vehicle dispatching commands based on the longest common subsequence according to claim 6, characterized in that: The preset keyword parameter table stores phrase information associated with the context, each phrase includes a plurality of keyword pairs, each keyword pair includes two keywords, and the corresponding contexts are used to match the preceding and following contexts of the text grouping.

8. The method for checking vehicle dispatching commands based on the longest common subsequence according to claim 1, characterized in that: The stored verification content linked list group includes: The verification content linked list group includes a plurality of linked lists, each linked list corresponding to a single unique phrase sequence number; After obtaining the element information, according to the current phrase sequence number, a corresponding linked list is created or called out in the linked list group and the corresponding element information is stored.

9. The vehicle dispatching command verification method based on the longest common subsequence according to claim 1 is characterized in that: The checking of the obtained verification content linked list group includes: According to the type of verification check, the obtained verification content linked list group is verified in combination with the imported train dispatch reference information; Among them, the train dispatch reference information includes: station name, train number, power supply card number and command receiving scope.

10. A vehicle dispatching command verification method based on the longest common subsequence according to any one of claims 1 to 9, characterized in that: The types of verification checks include: station name legitimacy check and command text consistency check.

Images