Method, device and storage medium for identifying applicability of repair solution

Abstract

This application relates to a method, apparatus, device, and storage medium for identifying the applicability of a maintenance plan. The method includes: obtaining an applicability condition formula for the maintenance plan; parsing the applicability condition formula to obtain multiple condition groups and sub-conditions in each condition group; generating a condition syntax tree based on each condition group and sub-conditions; traversing the condition syntax tree and identifying the type of each leaf node to obtain the type identification result of each leaf node in the condition syntax tree; and generating an aircraft applicability result for the applicable maintenance plan based on the type identification result of each leaf node. This eliminates the need for manual judgment, avoids errors caused by human factors, effectively improves the accuracy of maintenance plan applicability identification, and significantly reduces the time and human resources required.

Description

Technical Field

[0001] This application relates to the field of computer technology, and in particular to a method, apparatus, device, and storage medium for identifying the applicability of a repair scheme. Background Technology

[0002] In the field of aircraft maintenance engineering, the applicability assessment of the vast majority of maintenance options still relies on traditional manual methods. Engineers need to manually consult the aircraft's MOD (Modifications of Other Devices) list, basic aircraft data, and aircraft configuration data, and then evaluate the applicability of each maintenance option line by line using the appropriate formulas. This process is time-consuming and labor-intensive. With the increasing number of aircraft, the diversification of aircraft types, and the increasing complexity of maintenance work, the difficulty of traditional manual assessment has risen sharply. It is prone to errors and requires a significant amount of time and human resources. Summary of the Invention

[0003] Therefore, it is necessary to provide a method, apparatus, equipment, and storage medium for identifying the applicability of maintenance solutions to address the aforementioned technical problems. This method can effectively improve the accuracy of identifying the applicability of maintenance solutions and significantly reduce the time and human resources required.

[0004] Firstly, this application provides a method for identifying the applicability of a repair solution, the method comprising:

[0005] Formulas for obtaining the applicability conditions of maintenance solutions;

[0006] The applicability condition formula is analyzed to obtain multiple condition groups of the maintenance scheme and sub-conditions in each condition group;

[0007] A conditional syntax tree is generated based on each of the condition groups and the sub-conditions in each of the condition groups;

[0008] The conditional syntax tree is traversed node by node, and the type of the traversed leaf nodes is identified to obtain the type identification result of each leaf node in the conditional syntax tree.

[0009] Based on the type identification results of each leaf node, an aircraft applicability result suitable for the maintenance scheme is generated.

[0010] In one embodiment, the step of parsing the applicability condition formula to obtain multiple condition groups of the maintenance plan and sub-conditions in each condition group includes:

[0011] The first logical relation in the applicability condition formula was detected;

[0012] Based on the first logical relation, the applicability condition formula is parsed to obtain multiple condition groups for the maintenance scheme;

[0013] Detect the second logical relation in each of the condition groups;

[0014] Based on the second logical relation, each of the condition groups is parsed to obtain the sub-conditions in each condition group.

[0015] In one embodiment, generating a condition syntax tree based on each of the condition groups and the sub-conditions in each of the condition groups includes:

[0016] A condition syntax tree is constructed, with each condition group as the parent node and the sub-conditions in each condition group as child nodes.

[0017] In one embodiment, the step of traversing the conditional syntax tree and identifying the type of each leaf node encountered to obtain the type identification result of each leaf node in the conditional syntax tree includes:

[0018] The conditional syntax tree is traversed node by node, and the leaf nodes encountered are labeled to obtain the label information of each leaf node.

[0019] Continue traversing the conditional syntax tree and identify the leaf nodes encountered to obtain the identification results of each leaf node.

[0020] For each leaf node in the conditional syntax tree, when the identification result of the leaf node is consistent with the corresponding label information, the type identification result of the leaf node is determined based on the identification result.

[0021] In one embodiment, when the identification result of the leaf node matches the corresponding label information, determining the type identification result of the leaf node based on the identification result includes:

[0022] If the conditional syntax tree has a target node with a custom configuration and the recognition result of the target node is consistent with the label information of the target node, then the corresponding custom conditional formula is searched in the configuration library based on the recognition result.

[0023] Identify the keywords in the custom condition formula to obtain the type identification result of the target node;

[0024] When the recognition results of other nodes in the conditional syntax tree are consistent with the corresponding tag information, the type recognition result of the other nodes is determined based on the recognition results of the other nodes.

[0025] In one embodiment, generating aircraft suitability results for the maintenance scheme based on the type identification results of each of the leaf nodes includes:

[0026] Based on the aggregation requirements corresponding to the second logical relation, the type identification results belonging to the same condition group are aggregated to obtain the first aggregation result of the same condition group;

[0027] Based on the aggregation requirements corresponding to the first logical relation, the first aggregation results of each condition group are aggregated to obtain the second aggregation result;

[0028] Based on the second aggregation result, an aircraft applicability result applicable to the maintenance scheme is generated.

[0029] Secondly, this application also provides a repair scheme applicability identification device, the device comprising:

[0030] The acquisition module is used to obtain the applicability condition formulas for the maintenance plan;

[0031] The parsing module is used to parse the applicability condition formula to obtain multiple condition groups of the maintenance scheme and sub-conditions in each condition group;

[0032] The first generation module is used to generate a condition syntax tree based on each of the condition groups and the sub-conditions in each of the condition groups;

[0033] The identification module is used to traverse the conditional syntax tree and identify the type of the leaf nodes traversed, so as to obtain the type identification result of each leaf node in the conditional syntax tree.

[0034] The second generation module is used to generate aircraft applicability results suitable for the maintenance scheme based on the type identification results of each leaf node.

[0035] In one embodiment, the parsing module is further configured to detect a first logical relation in the applicability condition formula; parse the applicability condition formula based on the first logical relation to obtain multiple condition groups of the maintenance scheme; detect a second logical relation in each condition group; and parse each condition group based on the second logical relation to obtain sub-conditions in each condition group.

[0036] In one embodiment, the first generation module is further configured to construct a condition syntax tree including the parent node and the child node, with each of the condition groups as the parent node and the sub-conditions in each of the condition groups as the child nodes.

[0037] In one embodiment, the identification module is further configured to perform node traversal on the conditional syntax tree and label the leaf nodes encountered to obtain label information for each leaf node; continue to perform node traversal on the conditional syntax tree and identify the leaf nodes encountered to obtain identification results for each leaf node; for each leaf node in the conditional syntax tree, when the identification result of the leaf node is consistent with the corresponding label information, determine the type identification result of the leaf node based on the identification result.

[0038] In one embodiment, the identification module is further configured to: if the conditional syntax tree has a target node with a custom configuration and the identification result of the target node is consistent with the label information of the target node, then search in the configuration library and search for the corresponding custom conditional formula based on the identification result; identify the keywords in the custom conditional formula to obtain the type identification result of the target node; and when the identification results of other nodes in the conditional syntax tree are consistent with the corresponding label information, determine the type identification result of the other nodes based on the identification results of the other nodes.

[0039] In one embodiment, the second generation module is further configured to aggregate the type identification results belonging to the same condition group based on the aggregation requirements corresponding to the second logical relation, to obtain a first aggregation result of the same condition group; aggregate the first aggregation results of each condition group based on the aggregation requirements corresponding to the first logical relation, to obtain a second aggregation result; and generate an aircraft applicability result applicable to the maintenance scheme based on the second aggregation result.

[0040] Thirdly, this application also provides a computer device, the computer device including a memory and a processor, the memory storing a computer program, and the processor executing the computer program to implement the steps of the applicability identification method of the maintenance scheme.

[0041] Fourthly, this application also provides a computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the steps of the applicability identification method for the repair scheme.

[0042] Fifthly, this application also provides a computer program product, which includes a computer program that, when executed by a processor, implements the steps of the applicability identification method for the repair scheme.

[0043] The aforementioned method, apparatus, computer equipment, storage medium, and computer program product for applicability identification of maintenance solutions obtain the applicability condition formula of the maintenance solution, parse the applicability condition formula to obtain multiple condition groups and sub-conditions in each condition group of the maintenance solution, generate a condition syntax tree based on each condition group and sub-conditions in each condition group, traverse the condition syntax tree node by node, identify the type of the traversed leaf nodes, obtain the type identification result of each leaf node in the condition syntax tree, and generate the aircraft applicability result of the applicable maintenance solution based on the type identification result of each leaf node. Therefore, no manual judgment is required, avoiding the problem of human error in judgment, which can effectively improve the accuracy of maintenance solution applicability identification, and also greatly reduce the time and human resources consumed. Attached Figure Description

[0044] Figure 1 This is an application environment diagram of the applicability identification method for a maintenance scheme in one embodiment;

[0045] Figure 2 This is a flowchart illustrating the applicability identification method for a maintenance plan in one embodiment;

[0046] Figure 3 This is a schematic diagram of a tool page in one embodiment;

[0047] Figure 4 This is a flowchart illustrating the overall scheme in one embodiment;

[0048] Figure 5 This is a schematic diagram of the process flow executed by the data input layer in one embodiment;

[0049] Figure 6 This is a schematic diagram of the data parsing layer execution process in one embodiment;

[0050] Figure 7 This is a schematic diagram of the execution scheme of the data output layer in one embodiment;

[0051] Figure 8 This is a detailed flowchart illustrating the execution of the data parsing layer in one embodiment;

[0052] Figure 9 This is a structural block diagram of a maintenance scheme applicability identification device in one embodiment;

[0053] Figure 10 This is an internal structural diagram of a computer device in one embodiment. Detailed Implementation

[0054] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the scope of this application.

[0055] It should be noted that the terms "first," "second," etc., used in this application can be used to describe various elements, but these elements are not limited by these terms. These terms are only used to distinguish the first element from the second element. The terms "comprising" and "having," and any variations thereof, used in this application, are intended to cover non-exclusive inclusion. The term "multiple" used in this application refers to two or more. The term "and / or" used in this application refers to one of the embodiments, or any combination of multiple embodiments.

[0056] The applicability identification method for the repair scheme provided in this application embodiment can be applied to, for example, Figure 1 In the application environment shown, terminal 102 communicates with server 104 via a network. A data storage system can store the data that server 104 needs to process. The data storage system can be set up independently, integrated into server 104, or placed in the cloud or on other devices.

[0057] Terminal 102 can obtain the maintenance plan from the hard drive or server 104, thereby obtaining the applicability condition formula of the maintenance plan; it parses the applicability condition formula to obtain multiple condition groups of the maintenance plan and sub-conditions in each condition group; it generates a condition syntax tree based on each condition group and sub-conditions in each condition group; it performs node traversal on the condition syntax tree and performs type identification on the leaf nodes traversed to obtain the type identification results of each leaf node in the condition syntax tree; based on the type identification results of each leaf node, it generates the aircraft applicability result of the applicable maintenance plan.

[0058] The terminal 102 can be, but is not limited to, various personal computers, laptops, smartphones, tablets, drones, low-altitude aircraft, IoT devices, and portable wearable devices. IoT devices can include smart speakers, smart TVs, smart air conditioners, smart in-vehicle devices, and projection equipment. Portable wearable devices can include smartwatches, smart bracelets, and head-mounted displays. Head-mounted displays can be virtual reality (VR) devices, augmented reality (AR) devices, and smart glasses.

[0059] Server 104 can be a standalone physical server or a service node in a blockchain system. These service nodes form a peer-to-peer (P2P) network, where the P2P protocol is an application layer protocol running on top of the Transmission Control Protocol (TCP). Furthermore, server 104 can also be a server cluster composed of multiple physical servers, and can be a cloud server providing basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, content delivery networks (CDNs), and big data and artificial intelligence platforms.

[0060] In one embodiment, such as Figure 2 As shown, a method for identifying the applicability of a maintenance solution is provided. This method can be derived from... Figure 1 The method is executed by a server or terminal, or by a server and terminal working together. Figure 1 Taking the terminal execution in the example, the following steps are included:

[0061] S202, Formula for obtaining the applicability conditions of the maintenance plan.

[0062] The maintenance plan can be a maintenance instruction document for repairing an aircraft or other flying machine (described below using an aircraft as an example). This maintenance plan includes multiple maintenance plan entries, each containing the maintenance method, applicability formulas, and other information for various components of the aircraft (such as the air conditioning system and displays). This maintenance plan is typically provided by the aircraft manufacturer.

[0063] The obtained applicability condition formula can be the applicability condition formula for all maintenance program items in the maintenance program, or it can be the applicability condition formula for some maintenance program items, such as the applicability condition formula for one or more maintenance program items.

[0064] In one embodiment, the terminal displays a tool page, and in response to an input operation triggered on the tool page, the user inputs the applicability condition formula of the repair solution into the tool page to obtain the applicability condition formula of the repair solution; or, in response to an upload operation triggered on the tool page, the user uploads the repair solution and displays the upload information (such as file identifier) ​​of the repair solution on the tool page, and extracts the applicability condition formula from the repair solution.

[0065] This tool page can be the page for the aircraft suitability analysis tool in the management system. This tool page can have two analysis areas. The first analysis area is mainly used to analyze the suitability condition formulas for one or a few maintenance program items, including an input area and an output area. The input area can include a formula input box and an aircraft information box, and the output area can include a "suitable" box, a "reason explanation" box, and a "suitable aircraft" box, such as... Figure 3 As shown. The formula input box can be used to enter applicability condition formulas, supporting multi-line text and OR logical connectors; the aircraft information box can be used to select aircraft owned by an aircraft operator (such as an airline), allowing selection of all aircraft owned by that airline or a specific aircraft owned by that airline; the applicability box displays whether the maintenance program item corresponding to the entered applicability condition formula is applicable to the selected aircraft. If all aircraft are selected, it will display "yes" as long as at least one aircraft is applicable; the reason box displays an explanation of whether the selected aircraft is applicable to the maintenance program item, and an explanation of whether the selected aircraft is not applicable to the maintenance program item; the applicable aircraft box displays the aircraft models applicable to the maintenance program item.

[0066] In addition, the second analysis area is primarily used to analyze the applicability condition formulas for multiple maintenance program items or all maintenance program items. This second analysis area may include an aircraft information box, a file type box, and import controls, such as... Figure 3 As shown. The aircraft information box can be used to select aircraft owned by an airline. You can select all aircraft owned by that airline, or you can select a specific aircraft owned by that airline; the file type is used to enter the type of file to be uploaded; the import control is used to import maintenance plans (i.e., maintenance instruction documents).

[0067] In another embodiment, the terminal displays a dialog page, and in response to an input operation triggered on the dialog page, the user enters an applicability condition formula for one or more maintenance program items, as well as corresponding operation instructions (such as analyzing which aircraft are applicable); or, the user uploads the entire maintenance program on the dialog page and enters corresponding operation instructions.

[0068] S204 analyzes the applicability condition formula to obtain multiple condition groups of the maintenance plan and sub-conditions in each condition group.

[0069] Here, a condition group can be a set of conditions containing one or more sub-conditions, obtained by decomposing the applicability condition formula.

[0070] In one embodiment, before parsing the applicability condition formula or performing type identification, the terminal may first load the aircraft basic data, custom configuration data, and MOD data so that they can be used according to the actual situation in the subsequent type identification process.

[0071] The aircraft basic data can be the basic data of aircraft owned by the airline, which can be read from the aircraft database of the maintenance program. This basic aircraft data can include the aircraft serial number, model, and MSN (Manufacturing Serial Number). The MSN is a unique serial number provided by the aircraft manufacturer to distinguish specific individuals within the same model. Custom configuration data can be data about custom configurations. A custom configuration can be a sub-formula identifier in an applicability condition formula, indicating the existence of custom nested formulas within that formula. During type identification, the corresponding nested formula can be retrieved, parsed, and its type identified. MOD data can be data indicating the MOD execution status, which can refer to the aircraft's modification status, such as whether a modifiable component of the aircraft has been modified. This MOD data can be read from the aircraft MOD management module of the maintenance program and includes MOD number information indicating whether the aircraft has been modified.

[0072] In one embodiment, the terminal can detect the first logical relation in the applicability condition formula; parse the applicability condition formula based on the first logical relation to obtain multiple condition groups of the maintenance plan; detect the second logical relation in each condition group; and parse each condition group based on the second logical relation to obtain the sub-conditions in each condition group.

[0073] The first logical relation can be a character used to represent a parallel or union relationship, such as `or`. The second logical relation is a character used to represent a sequential or intersection relationship, such as `and` or a newline character. These logical relations can also be called logical connectors, such as the first logical connector and the second logical connector.

[0074] For example, the terminal can detect the OR logical connector in the applicability condition formula, and take the part before and after each OR logical connector in the applicability condition formula as a condition group, thereby obtaining multiple condition groups; then, it can detect the AND logical connector or newline character in each condition group, and take the part before and after each AND logical connector or newline character in the condition group as a sub-condition.

[0075] S206, Generate a condition syntax tree based on each condition group and the sub-conditions in each condition group.

[0076] Among them, the conditional syntax tree can be used to record the parent-child relationship between nodes.

[0077] In one embodiment, for each maintenance plan entry in the maintenance plan, the terminal can generate a condition syntax tree based on the condition groups and corresponding sub-conditions corresponding to the applicability condition formula of the maintenance plan entry, so that each maintenance plan entry corresponds to a condition syntax tree; or, it can generate a condition syntax tree based on the condition groups and corresponding sub-conditions corresponding to the applicability condition formula of all maintenance plan entries, so that all maintenance plan entries correspond to a condition syntax tree.

[0078] In one embodiment, the terminal can construct a condition syntax tree that includes parent nodes and child nodes, with each condition group as the parent node and the sub-conditions in each condition group as child nodes.

[0079] S208, perform node traversal on the conditional syntax tree and perform type identification on the leaf nodes encountered, to obtain the type identification results of each leaf node in the conditional syntax tree.

[0080] The type identification result can be at least one of the following types: ALL, MOD (SB number), MOD number, model, custom configuration, and others. For example, a leaf node can be of type ALL or type MOD (SB number).

[0081] In the applicability condition formula, the keyword for the ALL type can be ALL. Furthermore, MOD (SB number) primarily uses the format PRE (or POST) + number + (SB number), such as PRE12345(24-123), indicating that modification 12345(24-123) has not been performed, and POST12345(24-123), indicating that modification 12345(24-123) has been performed. MOD number type primarily uses the format PRE (or POST) + number, such as PRE34567, indicating that modification 34567 has not been performed, and POST34567, indicating that modification 34567 has been performed. Additionally, aircraft type primarily uses the aircraft model, such as A318 / A319 / A320 / A321. Other types can be types that do not belong to any of the above categories.

[0082] It should be noted that the numbers in MOD (SB number) represent the part number, such as 12345 (24-123) representing the part number; the numbers in MOD represent the part number, such as 34567 representing the part number.

[0083] In one embodiment, the terminal can traverse the conditional syntax tree. When traversing to the node corresponding to the condition group, it continues to traverse downwards, that is, traverses the child nodes of that node. When traversing to the node corresponding to the child condition (i.e., the leaf node), it performs type identification on the leaf node. After traversing all the leaf nodes in the conditional syntax tree, the type identification result of each leaf node in the conditional syntax tree is obtained.

[0084] In one embodiment, the terminal can traverse the conditional syntax tree (CSTR) node by node, labeling the leaf nodes encountered to obtain label information for each leaf node; continue traversing the CSTR and identifying the leaf nodes encountered to obtain identification results for each leaf node; for each leaf node in the CSTR, when the identification result of the leaf node matches the corresponding label information, the type identification result of the leaf node is determined based on the identification result. By labeling each leaf node before proceeding with subsequent identification to obtain the type identification result, problems can be quickly traced back to their source in case of issues, thereby quickly locating the incorrectly identified node.

[0085] In one embodiment, if the terminal has a target node with a custom configuration in the conditional syntax tree and the recognition result of the target node is consistent with the label information of the target node, it searches in the configuration library and finds the corresponding custom condition formula based on the recognition result; it identifies the keywords in the custom condition formula to obtain the type recognition result of the target node; when the recognition result of other nodes in the conditional syntax tree is consistent with the corresponding label information, it determines the type recognition result of other nodes based on the recognition result of other nodes.

[0086] In one embodiment, after finding a custom condition formula, the terminal can parse the custom condition formula to obtain at least one condition group and sub-conditions in each condition group; generate a new condition syntax tree based on each condition group and sub-conditions in each condition group; traverse the nodes of the condition syntax tree and perform type identification on the traversed leaf nodes to obtain the type identification results of each leaf node in the condition syntax tree.

[0087] S210 generates aircraft applicability results for applicable maintenance schemes based on the type identification results of each leaf node.

[0088] The aircraft applicability result may include the applicability conclusion (such as whether the maintenance method in the corresponding maintenance program item applies), the reason for applicability (or the applicable status), and the set of applicable aircraft. The set of applicable aircraft may be a detailed set of aircraft models.

[0089] In one embodiment, the type identification results of each leaf node belonging to the same condition group are aggregated to obtain a first aggregation result of the same condition group; then, the first aggregation results of each condition group are aggregated to obtain a second aggregation result; and the aircraft applicability result of the applicable maintenance scheme is generated based on the second aggregation result.

[0090] Specifically, the terminal can aggregate the type identification results belonging to the same condition group based on the aggregation requirements corresponding to the second logical relation to obtain the first aggregation result of the same condition group; aggregate the first aggregation results of each condition group based on the aggregation requirements corresponding to the first logical relation to obtain the second aggregation result; and generate the aircraft applicability result of the applicable maintenance scheme based on the second aggregation result.

[0091] The first aggregation result indicates that the maintenance method in the corresponding maintenance plan entry applies to aircraft that have simultaneously modified the components corresponding to the various types of identification results in the condition group.

[0092] For example, for condition group A, which has three leaf nodes, the type identification results of each leaf node are POST12345, POST12346, and POST12347. Aggregating the type identification results of each leaf node in condition group A yields a first aggregation result. This first aggregation result indicates that the maintenance method in the corresponding maintenance plan item is applicable to aircraft that have undergone modifications to models 12345, 12346, and 12347.

[0093] In the above embodiments, the applicability condition formula of the maintenance plan is obtained, the applicability condition formula is parsed to obtain multiple condition groups of the maintenance plan and sub-conditions in each condition group, a condition syntax tree is generated based on each condition group and sub-conditions in each condition group, the node traversal of the condition syntax tree is performed, and the type identification of the traversed leaf nodes is performed to obtain the type identification results of each leaf node in the condition syntax tree, and the aircraft applicability result of the applicable maintenance plan is generated based on the type identification results of each leaf node. Therefore, no manual judgment is required, avoiding the problem of judgment errors due to human factors, which can effectively improve the accuracy of maintenance plan applicability identification, and also greatly reduce the time and human resources consumed.

[0094] As an example, combined Figure 4-8 The scheme of this application is described in detail as follows:

[0095] The technical solution of this application includes a data input layer, a core processing layer, and a result output layer, wherein:

[0096] (a) Data Input Layer

[0097] Function Description:

[0098] 1) Formula text input: Accepts complex conditional formulas input by the user, supports multi-line text and OR logical connector;

[0099] 2) Loading basic aircraft data: Retrieves basic aircraft information from the maintenance plan aircraft database, including aircraft number, model, and MSN number;

[0100] 3) Custom configuration loading: Reads custom configurations and their corresponding applicable aircraft numbers from the maintenance scheme configuration group management;

[0101] 4) MOD execution status: Read the completed MOD number information of the aircraft from the aircraft MOD management module of the maintenance plan.

[0102] (II) Core Processing Layer

[0103] Functional Description: It contains three modules: a formula parsing module, a type recognition module, and a logical calculation module.

[0104] A. Formula Analysis Module

[0105] Technical Implementation:

[0106] (1) OR relation splitting: Use regular expressions to identify the "OR" keyword and split the formula into independent condition groups;

[0107] (2) AND relation identification: Identify the sub-conditions of the AND relation by separating each group by a newline character;

[0108] (3) Syntax tree construction: Construct a hierarchical conditional syntax tree and record the parent-child relationship;

[0109] B. Type Recognition Module

[0110] It includes 6 recognition types, with the following priorities:

[0111] 1) ALL type detection: Exactly matches the keyword "ALL";

[0112] 2) MOD (SB number) type detection: Regular expression matching of the format "PRE / POST number (SB number)";

[0113] 3) MOD ID type detection: Regular expression matching for "PRE / POST number" format;

[0114] 4) Model type detection: Includes keywords A318 / A319 / A320 / A321;

[0115] 5) Custom configuration type detection: Fully matches the custom configuration library;

[0116] 6) Other types: The aforementioned types that cannot be recognized.

[0117] C. Logical Calculation Module

[0118] Core algorithm flow:

[0119] 1) Single-condition filtering:

[0120] - ALL type: Returns the entire set of aircraft;

[0121] - Model type: Fuzzy match the model field;

[0122] - MOD number type: PRE / POST logic determines the inclusion relationship of MOD numbers;

[0123] - MOD (SB Number) type: Combines MOD numbering logic and SB numbering custom rules;

[0124] - Custom configuration type: Query the custom configuration library to obtain the set of applicable aircraft numbers;

[0125] - Other types: Returns an empty set.

[0126] 2) Set operations:

[0127] - AND relation: the intersection of the results of multiple conditional formulas;

[0128] - OR relation: the union of multiple conditional formulas.

[0129] 3) Result aggregation:

[0130] - Aggregate upwards layer by layer, from leaf nodes to root nodes;

[0131] - Maintain the set of applicable / inapplicable aircraft numbers.

[0132] (III) Result Output Layer

[0133] Output content:

[0134] Type identification results for each conditional formula;

[0135] The applicable status of each conditional formula (fully applicable / not applicable / partially applicable);

[0136] Detailed information on applicable aircraft serial numbers;

[0137] Explanation of the logical relationships between conditional formulas;

[0138] Final applicability conclusions and reasons for their application.

[0139] Specific application scenarios

[0140] Scenario: Applicability assessment of routine maintenance solutions;

[0141] Problem: Maintenance engineers need to quickly determine whether a particular maintenance solution is applicable to all aircraft in the fleet;

[0142] Solution: Input the formula for the solution conditions, and the system will automatically parse and output the applicable conditions for the aircraft;

[0143] Technical Solution Core Algorithm

[0144] Formula Analysis Algorithm

[0145] def Analyze formula(formula text):

[0146] # Step 1: Split by OR

[0147] Condition group list = regular expression split(formula text, "OR")

[0148] # Step 2: Split within each group by AND

[0149] for condition group in condition group list:

[0150] Sub-condition list = separated by newline character (condition group)

[0151] # Step 3: Constructing the syntax tree

[0152] Syntax tree = Constructing a syntax tree (list of condition groups)

[0153] return syntax tree

[0154] Type recognition algorithm

[0155] def identifies condition type (condition text):

[0156] if condition text == "ALL":

[0157] return "ALL"

[0158] elif matches MOD_SB number format (conditional text):

[0159] return "MOD(SB number)"

[0160] elif matches MOD number format (conditional text):

[0161] return "MOD ID"

[0162] elif contains model keyword (conditional text):

[0163] return "model"

[0164] elif exists in the custom configuration library (conditional text):

[0165] return "Custom Configuration"

[0166] else:

[0167] return "Other"

[0168] Logical computation algorithm

[0169] def Calculate condition result(condition type, condition text):

[0170] if condition type == "ALL":

[0171] Return all AC numbers

[0172] elif condition type == "model":

[0173] return fuzzy match device model(conditional text)

[0174] elif condition type == "MOD number":

[0175] return value containing the logic for determining the MOD number (condition text).

[0176] # ... Other types of processing

[0177] Therefore, as Figure 4 As shown, the overall scheme of this application is as follows:

[0178] S402 receives the conditional formulas for maintenance program entries and loads the aircraft basic data, custom configuration data, and MOD data.

[0179] S404, analyzes conditional formulas, identifies condition types, and calculates the applicable set of aircraft.

[0180] S406 outputs a detailed set of applicable conclusions, applicable states, and machine models.

[0181] like Figure 5 As shown, the steps of the data input layer of this application are as follows:

[0182] S502, Input conditional formula.

[0183] S504, loading basic aircraft data.

[0184] S506, Load custom configuration data.

[0185] S508, loading MOD data.

[0186] S510, data input complete.

[0187] like Figure 6 As shown, the steps of the data parsing layer in this application are as follows:

[0188] S602 receives data input from the data input layer.

[0189] S604, Formula parsing and conditional syntax tree construction.

[0190] S606, traverses the conditional syntax tree and labels the leaf nodes traversed.

[0191] S608 performs type identification on the traversed leaf nodes.

[0192] S610 outputs the processing result.

[0193] like Figure 7 As shown, the steps of the data output layer of this application are as follows:

[0194] S702 receives the processing results output by the data parsing layer.

[0195] S704 outputs applicable conclusions, applicable statuses, and machine number details.

[0196] S706, Output logic description and conclusion traceability.

[0197] S708, submit the results to the backend.

[0198] like Figure 8 As shown, the detailed steps of the data parsing layer in this application are as follows:

[0199] The system receives input data, splits it into condition groups according to OR, and then into AND sub-conditions according to newline characters. It constructs a condition syntax tree, parses the formula, traverses the conditions to be recognized, and labels the types according to their priority order. Then, it performs recognition to obtain the corresponding recognition results. Finally, it aggregates the data according to logical relational operators to obtain the final applicable set and outputs the processing results.

[0200] The solution proposed in this application can have the following beneficial effects:

[0201] Improved processing efficiency: Supports batch processing of hundreds of formulas, reducing the time from manual processing minutes per formula to automatic processing of less than 10 seconds per formula.

[0202] Accuracy improvement: from approximately 80% accuracy by manual methods to 90% accuracy by the system;

[0203] Traceability: Completely records the judgment process and basis for each condition formula;

[0204] Integrity check: Automatically identifies issues such as missing data and incorrect formatting;

[0205] Risk reduction: Avoid misjudging the applicability of maintenance solutions due to human error;

[0206] Furthermore, MOD (Modification of Design) management directly impacts fleet airworthiness. The self-developed system can assess the MOD completion status of all Airbus aircraft, eliminating the need to check the AIR (Airline Aircraft Inventory) for each aircraft's MOD completion status to determine the applicability of maintenance items for each aircraft. This significantly reduces the difficulty of applicability assessment and effectively ensures the accuracy of configuration data. In addition, it greatly reduces assessment time, thereby improving work efficiency and reducing the need for additional manpower in solution evaluation, achieving cost savings. The self-developed platform is expected to improve solution item evaluation efficiency by approximately 3 (3-person process) * 2 minutes * 78,000 items (average 78,000 items evaluated annually) = 7,800 man-hours / year.

[0207] It should be understood that although the steps in the flowcharts of the embodiments described above are shown sequentially according to the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless explicitly stated herein, there is no strict order restriction on the execution of these steps, and they can be executed in other orders. Moreover, at least some steps in the flowcharts of the embodiments described above may include multiple steps or multiple stages. These steps or stages are not necessarily completed at the same time, but can be executed at different times. The execution order of these steps or stages is not necessarily sequential, but can be performed alternately or in turn with other steps or at least some of the steps or stages of other steps.

[0208] Based on the same inventive concept, this application also provides a maintenance scheme applicability identification device for implementing the maintenance scheme applicability identification method described above. The solution provided by this device is similar to the implementation described in the above method; therefore, the specific limitations of one or more maintenance scheme applicability identification device embodiments provided below can be found in the limitations of the maintenance scheme applicability identification method described above, and will not be repeated here.

[0209] In one embodiment, such as Figure 9 As shown, a device for identifying the applicability of a maintenance solution is provided, comprising:

[0210] Module 902 is used to obtain the applicability condition formula of the maintenance plan;

[0211] The parsing module 904 is used to parse the applicability condition formula to obtain multiple condition groups of the maintenance scheme and the sub-conditions in each condition group;

[0212] The first generation module 906 is used to generate a condition syntax tree based on each condition group and the sub-conditions in each condition group;

[0213] The recognition module 908 is used to traverse the conditional syntax tree and perform type recognition on the leaf nodes traversed, so as to obtain the type recognition results of each leaf node in the conditional syntax tree.

[0214] The second generation module 910 is used to generate aircraft applicability results for applicable maintenance schemes based on the type identification results of each leaf node.

[0215] In one embodiment, the parsing module 904 is further configured to detect the first logical relation in the applicability condition formula; parse the applicability condition formula based on the first logical relation to obtain multiple condition groups of the maintenance scheme; detect the second logical relation in each condition group; and parse each condition group based on the second logical relation to obtain the sub-conditions in each condition group.

[0216] In one embodiment, the first generation module 906 is further configured to construct a condition syntax tree including parent nodes and child nodes, with each condition group as the parent node and the sub-conditions in each condition group as the child nodes.

[0217] In one embodiment, the identification module 908 is further configured to perform node traversal on the conditional syntax tree and label the leaf nodes traversed to obtain the label information of each leaf node; continue to perform node traversal on the conditional syntax tree and identify the leaf nodes traversed to obtain the identification result of each leaf node; for each leaf node in the conditional syntax tree, when the identification result of the leaf node is consistent with the corresponding label information, determine the type identification result of the leaf node based on the identification result.

[0218] In one embodiment, the identification module 908 is further configured to: if the conditional syntax tree has a target node with a custom configuration and the identification result of the target node is consistent with the label information of the target node, then search in the configuration library and search for the corresponding custom conditional formula based on the identification result; identify the keywords in the custom conditional formula to obtain the type identification result of the target node; and when the identification result of other nodes in the conditional syntax tree is consistent with the corresponding label information, determine the type identification result of other nodes based on the identification result of other nodes.

[0219] In one embodiment, the second generation module 910 is further configured to aggregate the type identification results belonging to the same condition group based on the aggregation requirements corresponding to the second logical relation, to obtain a first aggregation result of the same condition group; aggregate the first aggregation results of each condition group based on the aggregation requirements corresponding to the first logical relation, to obtain a second aggregation result; and generate an aircraft applicability result for an applicable maintenance scheme based on the second aggregation result.

[0220] In the above embodiments, the applicability condition formula of the maintenance plan is obtained, the applicability condition formula is parsed to obtain multiple condition groups of the maintenance plan and sub-conditions in each condition group, a condition syntax tree is generated based on each condition group and sub-conditions in each condition group, the node traversal of the condition syntax tree is performed, and the type identification of the traversed leaf nodes is performed to obtain the type identification results of each leaf node in the condition syntax tree, and the aircraft applicability result of the applicable maintenance plan is generated based on the type identification results of each leaf node. Therefore, no manual judgment is required, avoiding the problem of judgment errors due to human factors, which can effectively improve the accuracy of maintenance plan applicability identification, and also greatly reduce the time and human resources consumed.

[0221] Each module in the applicability identification device for the aforementioned repair scheme can be implemented entirely or partially through software, hardware, or a combination thereof. These modules can be embedded in or independent of the processor in a computer device, or stored in the memory of a computer device as software, so that the processor can call and execute the operations corresponding to each module.

[0222] In one embodiment, a computer device is provided, which may be a server, including a processor, memory, input / output (I / O) interfaces, and a communication interface. The processor, memory, and I / O interfaces are connected via a system bus, and the communication interface is connected to the system bus via the I / O interfaces. The processor of the computer device provides computing and control capabilities. The memory of the computer device includes non-volatile storage media and internal memory. The non-volatile storage media stores an operating system, computer programs, and a database. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The database of the computer device stores aircraft-related data. The I / O interfaces of the computer device are used for exchanging information between the processor and external devices. The communication interface of the computer device is used for communicating with external terminals via a network connection. When the computer program is executed by the processor, it implements a method for identifying the applicability of a maintenance program.

[0223] In one embodiment, a computer device is provided, which may be a terminal, and its internal structure diagram may be as follows: Figure 10As shown, the computer device includes a processor, memory, input / output interface, communication interface, display unit, and input device. The processor, memory, and input / output interface are connected via a system bus, and the communication interface, display unit, and input device are also connected to the system bus via the input / output interface. The processor provides computing and control capabilities. The memory includes a non-volatile storage medium and internal memory. The non-volatile storage medium stores the operating system and computer programs. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage medium. The input / output interface is used for exchanging information between the processor and external devices. The communication interface is used for wired or wireless communication with external terminals; wireless communication can be achieved through Wi-Fi, mobile cellular networks, NFC (Near Field Communication), or other technologies. When executed by the processor, the computer program implements a method for identifying the applicability of a repair solution. The display unit of the computer device is used to form a visually visible image. It can be a display screen, a projection device, or a virtual reality imaging device. The display screen can be an LCD screen or an e-ink screen. The input device of the computer device can be a touch layer covering the display screen, or buttons, trackballs, or touchpads set on the casing of the computer device, or external keyboards, touchpads, or mice, etc.

[0224] Those skilled in the art will understand that Figure 10 The structure shown is merely a block diagram of a portion of the structure related to the present application and does not constitute a limitation on the computer device to which the present application is applied. Specific computer devices may include more or fewer components than those shown in the figure, or combine certain components, or have different component arrangements.

[0225] In one embodiment, a computer device is provided, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the steps of the above-described applicability identification method for repair schemes.

[0226] In one embodiment, a computer-readable storage medium is provided having a computer program stored thereon, which, when executed by a processor, implements the steps of the above-described applicability identification method for the repair scheme.

[0227] In one embodiment, a computer program product is provided, including a computer program that, when executed by a processor, implements the steps of the above-described applicability identification method for repair schemes.

[0228] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, data stored, data displayed, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of related data must comply with the relevant laws, regulations and standards of the relevant countries and regions.

[0229] Those skilled in the art will understand that all or part of the processes in the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium. When executed, the computer program can include the processes of the embodiments described above. Any references to memory, databases, or other media used in the embodiments provided in this application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM). The databases involved in the embodiments provided in this application may include at least one type of relational database and non-relational database. Non-relational databases may include, but are not limited to, blockchain-based distributed databases. The processors involved in the embodiments provided in this application may be general-purpose processors, central processing units, graphics processing units, digital signal processors, programmable logic devices, and other data processing logic devices, and are not limited to these.

[0230] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0231] The embodiments described above are merely illustrative of several implementation methods of this application, and while the descriptions are specific and detailed, they should not be construed as limiting the scope of this patent application. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of this application, and these all fall within the protection scope of this application. Therefore, the protection scope of this application should be determined by the appended claims.

Claims

1. A method for identifying the applicability of a maintenance scheme, characterized in that, The method includes: Formulas for obtaining the applicability conditions of maintenance solutions; The applicability condition formula is analyzed to obtain multiple condition groups of the maintenance scheme and sub-conditions in each condition group; A conditional syntax tree is generated based on each of the condition groups and the sub-conditions in each of the condition groups; The conditional syntax tree is traversed node by node, and the type of the traversed leaf nodes is identified to obtain the type identification result of each leaf node in the conditional syntax tree. Based on the type identification results of each leaf node, an aircraft applicability result suitable for the maintenance scheme is generated.

2. The method according to claim 1, characterized in that, The process of analyzing the applicability condition formula to obtain multiple condition groups for the maintenance plan and sub-conditions in each condition group includes: The first logical relation in the applicability condition formula was detected; Based on the first logical relation, the applicability condition formula is parsed to obtain multiple condition groups for the maintenance scheme; Detect the second logical relation in each of the condition groups; Based on the second logical relation, each of the condition groups is parsed to obtain the sub-conditions in each condition group.

3. The method according to claim 1, characterized in that, The generation of a condition syntax tree based on each of the condition groups and the sub-conditions in each of the condition groups includes: A condition syntax tree is constructed, with each condition group as the parent node and the sub-conditions in each condition group as child nodes.

4. The method according to claim 1, characterized in that, The step of traversing the conditional syntax tree and identifying the type of each leaf node to obtain the type identification result of each leaf node in the conditional syntax tree includes: The conditional syntax tree is traversed node by node, and the leaf nodes encountered are labeled to obtain the label information of each leaf node. Continue traversing the conditional syntax tree and identify the leaf nodes encountered to obtain the identification results of each leaf node. For each leaf node in the conditional syntax tree, when the identification result of the leaf node is consistent with the corresponding label information, the type identification result of the leaf node is determined based on the identification result.

5. The method according to claim 4, characterized in that, When the identification result of the leaf node matches the corresponding label information, determining the type identification result of the leaf node based on the identification result includes: If the conditional syntax tree has a target node with a custom configuration and the recognition result of the target node is consistent with the label information of the target node, then the corresponding custom conditional formula is searched in the configuration library based on the recognition result. Identify the keywords in the custom condition formula to obtain the type identification result of the target node; When the recognition results of other nodes in the conditional syntax tree are consistent with the corresponding tag information, the type recognition result of the other nodes is determined based on the recognition results of the other nodes.

6. The method according to any one of claims 1 to 5, characterized in that, The generation of aircraft suitability results for the maintenance scheme based on the type identification results of each leaf node includes: Based on the aggregation requirements corresponding to the second logical relation, the type identification results belonging to the same condition group are aggregated to obtain the first aggregation result of the same condition group; Based on the aggregation requirements corresponding to the first logical relation, the first aggregation results of each condition group are aggregated to obtain the second aggregation result; Based on the second aggregation result, an aircraft applicability result applicable to the maintenance scheme is generated.

7. A device for identifying the applicability of a maintenance scheme, characterized in that, The device includes: The acquisition module is used to obtain the applicability condition formulas for the maintenance plan; The parsing module is used to parse the applicability condition formula to obtain multiple condition groups of the maintenance scheme and sub-conditions in each condition group; The first generation module is used to generate a condition syntax tree based on each of the condition groups and the sub-conditions in each of the condition groups; The identification module is used to traverse the conditional syntax tree and identify the type of the leaf nodes traversed, so as to obtain the type identification result of each leaf node in the conditional syntax tree. The second generation module is used to generate aircraft applicability results suitable for the maintenance scheme based on the type identification results of each leaf node.

8. A computer device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that, When the processor executes the computer program, it implements the steps of the method according to any one of claims 1 to 6.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 6.

10. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 6.

Images