Automatic cleaning method, device, equipment and medium for aircraft wing pipeline

Abstract

The embodiment of the present invention discloses an automatic cleaning method, device, equipment and medium for aircraft wing pipelines, wherein the method includes: determining neighbor table matrix information based on the main oil inlet node, the main oil outlet node and each intermediate pipeline node information on the aircraft wing pipeline; determining at least one path to be cleaned based on the neighbor table matrix information; each path to be cleaned starts from the main oil inlet node and ends at the main oil outlet node; cleaning each path to be cleaned in turn; wherein the state of the node in the path to be cleaned during the cleaning process is an open state. By executing the technical solution provided by the embodiment of the present invention, automatic planning of the cleaning path and automatic cleaning can be achieved, avoiding damage caused by repeated disassembly and assembly of the test piece during the cleaning process, simplifying the test process, improving the cleaning efficiency, and traceability of the test data.

Description

Technical Field

[0001] The invention relates to the technical field of hydraulic pipeline cleaning on an aircraft, and in particular to an automatic cleaning method, device, equipment and medium for aircraft wing pipelines. Background Art

[0002] The aircraft hydraulic pipeline system is large and complex in structure. Before conducting functional tests of the hydraulic, flight control, landing gear and other systems, the pipeline system must be pressure-cleaned to remove oil particles and pollutants in the pipeline; prevent pipeline blockage and maintain uniform pressure drop; and prevent oil particles from damaging finished parts and affecting equipment operation.

[0003] In the on-board hydraulic pipeline cleaning test in the related technology, the test path planning and execution mainly rely on manual work, with complex steps, low efficiency and low degree of automation. During the test, the hydraulic finished product needs to be repeatedly disassembled and assembled, resulting in thread damage and seizure at the pipeline interface, which in turn affects the pipeline connection performance and creates potential quality and safety hazards. The entire test process is manually recorded, lacks comprehensive test data, and the test process and data traceability are poor, making it impossible to achieve effective management. Summary of the invention

[0004] The embodiments of the present invention provide an automatic cleaning method, device, equipment and medium for aircraft wing pipes, which can realize automatic planning of cleaning paths and automatic cleaning, avoid damage caused by repeated disassembly and assembly of test pieces during the cleaning process, simplify the test process, improve cleaning efficiency, and make test data traceable.

[0005] In a first aspect, an embodiment of the present invention provides an automatic cleaning method for an aircraft wing pipeline, the method comprising:

[0006] Determine neighbor table matrix information based on information of main oil inlet nodes, main oil outlet nodes and each intermediate pipeline node on the aircraft wing pipeline; the neighbor table matrix information is used to characterize the connectivity relationship between each node; at least some of the intermediate pipeline nodes are valve nodes; the connectivity relationship includes an adjacent relationship and an on-off relationship;

[0007] Determine at least one path to be cleaned based on the neighbor list matrix information; each of the paths to be cleaned starts from a main oil inlet node and ends at a main oil outlet node;

[0008] Each of the paths to be cleaned is cleaned in turn; wherein the state of the nodes in the paths to be cleaned during the cleaning process is an open state.

[0009] In a second aspect, an embodiment of the present invention further provides an automatic cleaning device for an aircraft wing pipeline, the device comprising:

[0010] The neighbor table matrix information determination module is used to determine the neighbor table matrix information according to the main oil inlet node, the main oil outlet node and each intermediate pipeline node information on the aircraft wing pipeline; the neighbor table matrix information is used to characterize the connectivity relationship between each node; at least some of the intermediate pipeline nodes are valve nodes; the connectivity relationship includes an adjacent relationship and an on-off relationship;

[0011] A path determination module to be cleaned, used to determine at least one path to be cleaned based on the neighbor list matrix information; each of the paths to be cleaned has a main oil inlet node as a starting point and a main oil outlet node as an end point;

[0012] The path to be cleaned cleaning module is used to clean each of the paths to be cleaned in turn; wherein the state of the nodes in the path to be cleaned in the cleaning process is an open state.

[0013] In a third aspect, an embodiment of the present invention further provides an electronic device, the electronic device comprising:

[0014] at least one processor; and

[0015] a memory communicatively connected to the at least one processor; wherein,

[0016] The memory stores a computer program executable by the at least one processor, and the computer program is executed by the at least one processor so that the at least one processor can execute the automatic cleaning method for aircraft wing pipes described in any embodiment of the present invention.

[0017] In a fourth aspect, an embodiment of the present invention further provides a computer-readable storage medium, wherein the computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a processor to implement the automatic cleaning method for aircraft wing pipes described in any embodiment of the present invention when executed.

[0018] The technical solution provided by the embodiment of the present invention determines the neighbor table matrix information based on the main oil inlet node, the main oil outlet node and each intermediate pipeline node information on the aircraft wing pipeline; the neighbor table matrix information is used to characterize the connectivity relationship between each node; at least some of the intermediate pipeline nodes are valve nodes; the connectivity relationship includes an adjacent relationship and an on-off relationship; at least one path to be cleaned is determined based on the neighbor table matrix information; each path to be cleaned starts from the main oil inlet node and ends at the main oil outlet node; each path to be cleaned is cleaned in turn; wherein the state of the node in the path to be cleaned in the cleaning process is an open state. By executing the technical solution provided by the embodiment of the present invention, automatic planning of the cleaning path and automatic cleaning can be achieved, and damage caused by repeated disassembly and assembly of the test piece during the cleaning process can be avoided. The test process can be simplified, the cleaning efficiency can be improved, and the test data can be traced.

[0019] It should be understood that the contents described in this section are not intended to identify the key or important features of the embodiments of the present invention, nor are they intended to limit the scope of the present invention. Other features of the present invention will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0021] Figure 1 This is a flow chart of an automatic cleaning method for an aircraft wing pipeline provided by an embodiment of the present invention;

[0022] Figure 2 It is a schematic diagram of adjacent models of nodes of the left wing of the wing section provided by an embodiment of the present invention;

[0023] Figure 3 is a schematic diagram of at least one path to be cleaned provided by an embodiment of the present invention;

[0024] Figure 4 is a flow chart of another automatic cleaning method for aircraft wing pipes provided by an embodiment of the present invention;

[0025] Figure 5 This is a flow chart of another automatic cleaning method for aircraft wing pipes provided by an embodiment of the present invention;

[0026] Figure 6 It is a schematic structural diagram of an automatic cleaning device for aircraft wing pipes provided by an embodiment of the present invention;

[0027] Figure 7 It is a schematic diagram of the structure of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0028] In order to enable those skilled in the art to better understand the scheme of the present invention, the technical scheme in the embodiments of the present invention will be clearly and completely described below 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 should fall within the scope of protection of the present invention.

[0029] It should be noted that the term "target" and the like in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0030] Figure 1 This is a flow chart of an automatic cleaning method for aircraft wing pipes provided by an embodiment of the present invention. The method can be executed by an automatic cleaning device for aircraft wing pipes. The device can be implemented by software and / or hardware. The device can be configured in an electronic device for automatic cleaning of aircraft wing pipes. The method is applied to a scenario in which a cleaning path in an aircraft wing pipe is determined. Figure 1 As shown, the technical solution provided by the embodiment of the present invention specifically includes:

[0031] S110: Determine neighbor table matrix information based on the main oil inlet node, the main oil outlet node and each intermediate pipeline node information on the aircraft wing pipeline.

[0032] Among them, the neighbor list matrix information is used to characterize the connectivity relationship between each node; at least some of the intermediate pipeline nodes are valve nodes; and the connectivity relationship includes an adjacent relationship and an on-off relationship.

[0033] For example, Figure 2 As shown, each number represents a node on the aircraft wing pipeline. In this scheme, the hydraulic oil is only provided by a single hydraulic source, so number 1 represents the only pressure oil inlet of the example cleaning process, that is, the main oil inlet node, and number 22 represents the only oil return outlet of the example cleaning process, that is, the main oil outlet node. Other numbers except numbers 1 and 22 represent intermediate pipeline nodes. At least some of the intermediate pipeline nodes are valve nodes, for example, node 7, node 9, node 11, node 13 and node 15 are all valve nodes. This scheme can determine the neighbor table matrix information based on the main oil inlet node, the main oil outlet node and each intermediate pipeline node information on the aircraft wing pipeline. The neighbor table matrix information can characterize the connectivity relationship between any two nodes on the aircraft wing pipeline. The connectivity relationship can be whether they are adjacent or connected. For example, the element (1,1) in the 6th row and 7th column of the neighbor table matrix can indicate that the intermediate pipeline node 6 is adjacent to and connected to the valve node 7. The valve node can be set to an open state or a closed state.

[0034] S120: Determine at least one path to be cleaned based on the neighbor list matrix information.

[0035] Each of the paths to be cleaned starts from a main oil inlet node and ends at a main oil outlet node.

[0036] Among them, this solution can determine at least two cleaning node links based on the neighbor list matrix information, and connect them through at least two cleaning node links to obtain at least one path to be cleaned starting from the main oil inlet node and ending at the main oil outlet node.

[0037] For example, this solution can determine the adjacent node connected to the main oil inlet node based on the neighbor table matrix information, use the connected adjacent node as the current pipeline node, add the main oil inlet node and the current pipeline node to the path preservation matrix in sequence, and use the link composed of the main oil inlet node and the current pipeline node as the cleaning node link. Then, based on the neighbor table matrix information, determine a connected adjacent node of the current pipeline node. If it is determined that the adjacent node is not the main oil outlet node and is not in the path preservation matrix, use the adjacent node as the current pipeline node, add the current pipeline node to the path preservation matrix, and use the link composed of the previous adjacent node of the current pipeline node and the current pipeline node as the cleaning node link. Return to perform the operation of determining a connected adjacent node of the current pipeline node based on the neighbor table matrix information until the current pipeline node is the main oil outlet node, and obtain at least two sequentially connected cleaning node links, thereby obtaining the path to be cleaned.

[0038] In addition, it should be noted that since some nodes on the main pipeline of the aircraft wing pipeline need to be accessed each time the path to be cleaned is determined, even if these nodes are already in the path saving matrix, they need to be used again when determining the next path to be cleaned. Figure 3 As shown, both the first path to be cleaned and the second path to be cleaned include nodes 1, 2, 3, 4, and 5.

[0039] This solution can also, if it is determined that the current pipeline node does not have an adjacent node that is not in the path preservation matrix, use the previous adjacent node of the current pipeline node as the current pipeline node; return to execute the operation of determining an adjacent node of the current pipeline node based on the adjacent table matrix information, until the current pipeline node is the main oil output node, and obtain at least two cleaning node links.

[0040] In addition, if this scheme determines that the current pipeline node is not connected to the next adjacent node of the current pipeline node in the path storage matrix, and the previous adjacent node adjacent to the current pipeline node is the main oil inlet node, the operation of determining the path to be cleaned is stopped.

[0041] Each path to be cleaned starts from the main oil inlet node on the aircraft wing pipeline and ends at the main oil outlet node. For example, at least one path to be cleaned determined based on the neighbor list matrix information can be as follows: Figure 3 As shown. Figure 3 It can be seen that the first path to be cleaned determined based on the neighbor list matrix information is 1-->2-->3-->4-->5-->6-->7-->8-->17-->18-->19-->20-->21-->22, and the last path to be cleaned may be 1-->2-->15-->16-->21-->22.

[0042] S130: Clean each of the paths to be cleaned in sequence.

[0043] Among them, the state of the nodes in the path to be cleaned during the cleaning process is the open state.

[0044] Specifically, the scheme can clean the path to be cleaned every time it is determined that a path to be cleaned is completed. The scheme can also clean each path to be cleaned separately in a determined order after each path to be cleaned is determined to be completed. When cleaning the path to be cleaned, the scheme needs to ensure that the status of all nodes in the path to be cleaned is turned on.

[0045] When this scheme cleans each path to be cleaned in a determined order, it can clean the path to be cleaned that is determined for the first time, and set the valve nodes in the path to be cleaned that is determined for the first time to be cleaned to a closed state; take the next path to be cleaned as the current cleaning path; set the valve nodes of the current cleaning path to an open state, and clean the current path to be cleaned; set the valve nodes of the current path to be cleaned to a closed state; return to execute the operation of taking the next path to be cleaned as the current cleaning path, until all the paths to be cleaned where the valve nodes are located are cleaned, and stop cleaning each path to be cleaned.

[0046] In addition, before cleaning each path to be cleaned in turn, in order to ensure that the cleaning oil does not flow back, for each path to be cleaned, the on-off relationship associated with each node in the neighbor table matrix information is updated according to the order of the nodes in the path to be cleaned. For example, for the path to be cleaned 1-->2-->15-->16-->21-->22, the element in the second row and first column of the neighbor table matrix information needs to be set to (1,0), that is, node 1 is connected to node 2, but node 2 is disconnected from node 1, thereby avoiding the backflow of the cleaning oil.

[0047] The technical solution provided by the embodiment of the present invention determines the neighbor table matrix information based on the main oil inlet node, the main oil outlet node and each intermediate pipeline node information on the aircraft wing pipeline; the neighbor table matrix information is used to characterize the connectivity relationship between each node; at least some of the intermediate pipeline nodes are valve nodes; the connectivity relationship includes an adjacent relationship and an on-off relationship; at least one path to be cleaned is determined based on the neighbor table matrix information; each path to be cleaned starts from the main oil inlet node and ends at the main oil outlet node; each path to be cleaned is cleaned in turn; wherein the state of the node in the path to be cleaned in the cleaning process is an open state. By executing the technical solution provided by the embodiment of the present invention, automatic planning of the cleaning path and automatic cleaning can be achieved, and damage caused by repeated disassembly and assembly of the test piece during the cleaning process can be avoided. The test process can be simplified, the cleaning efficiency can be improved, and the test data can be traced.

[0048] Figure 4 FIG. 1 is a flow chart of an automatic cleaning method for aircraft wing pipes provided by an embodiment of the present invention. This embodiment is optimized based on the above embodiment. Figure 4 As shown, the automatic cleaning method of the aircraft wing pipeline in the embodiment of the present invention may include:

[0049] S210: Determine neighbor table matrix information based on the main oil inlet node, the main oil outlet node and each intermediate pipeline node information on the aircraft wing pipeline.

[0050] S220: Determine at least two cleaning node chains according to the neighbor list matrix information.

[0051] Each of the cleaning node links includes a link consisting of two adjacent nodes that can be connected during cleaning, and the two adjacent nodes are composed of a main oil inlet node, at least one intermediate pipeline node and two nodes of the main oil outlet node.

[0052] Among them, this scheme can determine at least two cleaning node chains connected in sequence according to the neighbor list matrix information. The cleaning node chain can be a link composed of two adjacent nodes that can be connected during cleaning. The two adjacent nodes can be composed of a main oil inlet node, at least one intermediate pipeline node and two nodes in the main oil outlet node.

[0053] In this embodiment, optionally, determining at least two cleaning node links according to the neighbor table matrix information includes: determining the adjacent nodes of the main oil inlet node based on the neighbor table matrix information, and taking the adjacent nodes of the main oil inlet node as the current pipeline node, and adding the main oil inlet node and the current pipeline node to the path preservation matrix in sequence; the main oil inlet node is connected to the current pipeline node; determining an adjacent node of the current pipeline node based on the neighbor table matrix information; if it is determined that an adjacent node of the current pipeline node is not the main oil outlet node and is not in the path preservation matrix, taking an adjacent node of the current pipeline node as the current pipeline node, and adding the current pipeline node to the path preservation matrix; returning to perform the operation of determining an adjacent node of the current pipeline node based on the neighbor table matrix information, until the current pipeline node is the main oil outlet node, and obtaining at least two cleaning node links.

[0054] For example, Figure 2 As shown, this solution can determine the adjacent and connected node 2 of the main oil inlet node 1 based on the neighbor table matrix information, and use the adjacent node 2 of the main oil inlet node 1 as the current pipeline node, and add the main oil inlet node 1 and the current pipeline node 2 to the path preservation matrix in sequence. Then, an adjacent and connected node 3 of the current pipeline node 2 is determined based on the neighbor table matrix information. Since the adjacent node 3 is not the main oil outlet node and is not in the path preservation matrix, the adjacent node 3 is used as the current pipeline node and the current pipeline node is added to the path preservation matrix; return to perform the operation of determining an adjacent node of the current pipeline node based on the neighbor table matrix information until the current pipeline node is the main oil outlet node 22, and obtain at least two cleaning node links connected in sequence, and then obtain a path to be cleaned. For example, the path to be cleaned can be: 1-->2-->3-->4-->5-->6-->7-->8-->17-->18-->19-->20-->21-->22.

[0055] It should be noted that since some nodes on the main pipeline of the aircraft wing pipeline need to be accessed each time when the path to be cleaned is determined, even if these nodes are already in the path saving matrix, they may be used again as needed when determining the next path to be cleaned. Figure 3 As shown, both the first path to be cleaned and the second path to be cleaned include nodes 1, 2, 3, 4, and 5.

[0056] Thus, at least two cleaning node links are determined through the neighbor list matrix information, and then a path to be cleaned is determined, so that a connected path to be cleaned starting from the main oil inlet node and ending at the main oil outlet node can be determined.

[0057] In a feasible implementation, optionally, if it is determined that the current pipeline node does not have an adjacent node that is not in the path saving matrix, the previous adjacent node of the current pipeline node is used as the current pipeline node; the operation of determining an adjacent node of the current pipeline node based on the neighbor list matrix information is returned to execute until the current pipeline node is the main oil output node, and at least two cleaning node links are obtained.

[0058] For example, it is assumed that after determining that the path to be cleaned is completed

[0059] After 1-->2-->3-->4-->5-->6-->7-->8-->17-->18-->19-->20-->21-->22, the next node that has been determined in the path to be cleaned is 1-->2-->3-->4-->5-->6. Based on the neighbor list matrix information, an adjacent node 7 of the current pipeline node 6 is determined. Since the current pipeline node 6 has one and only one adjacent node 7, and the adjacent node 7 is already in the path saving matrix, that is, the current pipeline node 6 does not have an adjacent node that is not in the path saving matrix, it means that the previous pipeline node 6 is a dead point and the point is abandoned. The previous adjacent node 5 of the current pipeline node 6 is used as the current pipeline node, and the operation of determining an adjacent node 9 of the current pipeline node 5 based on the neighbor list matrix information is returned until the current pipeline node is the main oil output node 22, and at least two cleaning node links connected in sequence are obtained, and then a path to be cleaned is obtained. For example, the path to be cleaned can be:

[0060] 1-->2-->3-->4-->5-->6-->9-->10-->18-->19-->20-->21-->22.

[0061] Thus, if it is determined that the current pipeline node does not have an adjacent node that is not in the path saving matrix, the previous adjacent node of the current pipeline node is used as the current pipeline node; and the operation of determining an adjacent node of the current pipeline node based on the adjacent table matrix information is returned until the current pipeline node is the main oil output node, and at least two cleaning node links are obtained. It can be achieved to determine multiple non-interfering connected paths to be cleaned that start from the main oil input node and end at the main oil output node.

[0062] In this embodiment, optionally, if it is determined that the current pipeline node does not have an adjacent node that is not in the path saving matrix, and the previous adjacent node adjacent to the current pipeline node is a main oil inlet node, the operation of determining the path to be cleaned is stopped.

[0063] Exemplarily, after determining that the last path to be cleaned 1-->2-->15-->16-->21-->22 is completed, this solution continues to perform the operation of determining the next path to be cleaned: determine the adjacent node 2 of the main oil inlet node 1 based on the neighbor list matrix information, and use the adjacent node of the main oil inlet node as the current pipeline node, and add the main oil inlet node 1 and the current pipeline node 2 to the path preservation matrix in sequence. Since the current pipeline node 2 does not have an adjacent node that is not in the path preservation matrix, it means that the current pipeline node 2 is a dead point and the point is abandoned. Use the previous adjacent node 1 of the current pipeline node 2 as the current pipeline node, and the adjacent node 1 is the main oil inlet node, which means that the determination of each path to be cleaned is completed, and the operation of determining the path to be cleaned is stopped.

[0064] Therefore, if it is determined that the current pipeline node does not have an adjacent node that is not in the path storage matrix, and the previous adjacent node adjacent to the current pipeline node is a main oil inlet node, then the operation of determining the path to be cleaned is stopped. This can achieve termination of determining the path to be cleaned and avoid invalid calculations.

[0065] S230: Connecting the at least two cleaning node links to obtain a path to be cleaned starting from the main oil inlet node and ending at the main oil outlet node.

[0066] S240: Clean each of the paths to be cleaned in sequence.

[0067] In this embodiment, optionally, each of the paths to be cleaned is cleaned in turn, including: cleaning the path to be cleaned that is determined for the first time, and setting the valve nodes in the path to be cleaned that is determined for the first time to be cleaned to a closed state; taking the next path to be cleaned as the current cleaning path; setting the valve nodes of the current cleaning path to an open state, and cleaning the current cleaning path; setting the valve nodes of the current cleaning path to a closed state; returning to execute the operation of taking the next path to be cleaned as the current cleaning path, until all the paths to be cleaned where the valve nodes are located are cleaned, and stopping cleaning each of the paths to be cleaned.

[0068] Among them, when this scheme cleans each path to be cleaned in the order in which the paths to be cleaned are determined, the path to be cleaned that is determined for the first time can be cleaned first, and the valve nodes in the path to be cleaned that is determined for the first time can be set to a closed state when the cleaning is completed. Then the next path to be cleaned is used as the current cleaning path, the valve nodes of the current cleaning path are set to an open state, the current path to be cleaned is cleaned, and the valve nodes of the current path to be cleaned are set to a closed state when the cleaning is completed. Return to execute the operation of using the next path to be cleaned as the current cleaning path until all the paths to be cleaned where the valve nodes are located are cleaned, which means that the cleaning of the entire aircraft wing pipeline is completed, and the cleaning of each path to be cleaned is stopped.

[0069] Therefore, by setting the valve nodes in the paths to be cleaned in the cleaning process to the open state and the valve nodes in other paths to be cleaned to the closed state during the process of cleaning each path to be cleaned in turn, it is possible to scientifically and efficiently clean each path to be cleaned in turn, avoid unnecessary repeated operations, and improve test efficiency.

[0070] In another feasible implementation, optionally, before cleaning each of the paths to be cleaned in turn, it also includes: for each of the paths to be cleaned, updating the on-off relationship associated with each node in the path to be cleaned in the neighbor list matrix information according to the order of the nodes in the path to be cleaned.

[0071] Specifically, before cleaning each path to be cleaned, in order to ensure that the cleaning oil does not flow back, the scheme can also update the on-off relationship associated with each node in the neighbor table matrix information for each path to be cleaned according to the order of the nodes in the path to be cleaned. For example, for the path to be cleaned 1-->2-->15-->16-->21-->22, since the intermediate pipeline node 2 is adjacent to the intermediate pipeline node 3, the main oil inlet node 1 and the valve node 15, respectively, in order to ensure that the cleaning oil is cleaned according to the order of the nodes in the path to be cleaned, the scheme needs to set the elements of the second row and the first column and the elements of the second row and the third column in the neighbor table matrix information to (1,0), that is, node 1 to node 2 and node 2 to node 15 are connected, but node 2 to node 1 and node 2 to node 3 are disconnected, so that the cleaning oil can only flow from the intermediate pipeline node 2 to the valve node 15, avoiding the backflow of the cleaning oil.

[0072] Thus, for each path to be cleaned, the on-off relationship associated with each node in the neighbor table matrix information is updated according to the order of the nodes in the path to be cleaned. Cleaning can be performed according to the order of the nodes in the path to be cleaned, and repeated cleaning caused by the backflow of the cleaning oil can be avoided. The cleaning path is clear and the cleaning efficiency can be improved.

[0073] The technical solution provided by the embodiment of the present invention determines the neighbor table matrix information based on the main oil inlet node, the main oil outlet node and each intermediate pipeline node information on the aircraft wing pipeline; determines at least two cleaning node links based on the neighbor table matrix information; each cleaning node link includes a link composed of two adjacent nodes that can be connected during cleaning, and the two adjacent nodes are composed of the main oil inlet node, at least one intermediate pipeline node and two nodes in the main oil outlet node; connects through at least two cleaning node links to obtain a path to be cleaned starting from the main oil inlet node and ending at the main oil outlet node; cleans each path to be cleaned in turn. By executing the technical solution provided by the embodiment of the present invention, automatic planning of cleaning paths and automatic cleaning can be achieved, avoiding damage caused by repeated disassembly and assembly of test pieces during cleaning, simplifying the test process, improving cleaning efficiency, and traceability of test data.

[0074] In order to clearly describe the technical solution of the present invention, Figure 5 FIG. 1 is a flow chart of an automatic cleaning method for an aircraft wing pipeline provided by an embodiment of the present invention. Figure 5 As shown, the automatic cleaning method of the aircraft wing pipeline in the embodiment of the present invention may include the following steps:

[0075] Step 1: Determine the neighbor table matrix information based on the main oil inlet node, the main oil outlet node and each intermediate pipeline node information on the aircraft wing pipeline.

[0076] Among them, the neighbor list matrix information is used to characterize the connectivity relationship between each node. The connectivity relationship includes the adjacent relationship and the on-off relationship. The corresponding relationship between two adjacent nodes is 1, and the corresponding relationship between two non-adjacent nodes is 0. The corresponding relationship between two connected nodes is 1, and the corresponding relationship between two non-connected nodes is 0.

[0077] Step 2: Determine the adjacent nodes of the main oil inlet node based on the neighbor list matrix information, and use the adjacent nodes of the main oil inlet node as the current pipeline node, and add the main oil inlet node and the current pipeline node to the path saving matrix in sequence.

[0078] Among them, this scheme can take the main oil inlet node as the starting point, find the adjacent node a that has not been traversed, and if found, set the point as the current pipeline node a, and store the current pipeline node a in the path saving matrix.

[0079] Step 3: Determine an adjacent node of the current pipeline node based on the neighbor list matrix information.

[0080] Determine whether an adjacent node of the current pipeline node is in the path saving matrix. If so, execute step 4; if not, execute step 5.

[0081] Among them, this scheme can determine the adjacent nodes of the current pipeline node according to the information of the adjacent table matrix, and store all the adjacent nodes of the current pipeline node in the adjacent node matrix. Then, any adjacent node b of the point a that is not an element of the path preservation matrix is ​​determined from the adjacent node matrix, and point b is set as the current pipeline node and stored in the path preservation matrix, and the connectivity relationship between (a, b) and (b, a) in the adjacent table matrix is ​​set to 0, that is, it is considered that after point a and point b are connected, points a and b are not adjacent by default to prevent backtracking.

[0082] Step 4: If it is determined that the current pipeline node does not have an adjacent node that is not in the path saving matrix, the previous adjacent node of the current pipeline node is used as the current pipeline node. Return to step 3.

[0083] Among them, if this scheme determines that the adjacent node b has no adjacent nodes that are not in the path saving matrix, then the point is a dead point, and it goes back to the previous adjacent node of the adjacent node b, then re-determine an adjacent node according to step 3, delete point b in the path saving matrix, and change the connectivity relationship between (a, b) and (b, a) in the neighbor list matrix to 1 to prevent the subsequent re-path finding from mistakenly believing that points a and b are connected; if the adjacent node b can find the next adjacent node c that meets the conditions, then point b is set as the current pipe node, and the path is re-finded according to step 3. If point b is a valve node, the corresponding valve node switch state is changed.

[0084] Step 5: Return to step 3.

[0085] Among them, this solution can repeat step 3 and step 4 until a complete path to be cleaned leading to the main oil outlet node is found.

[0086] Step 6: If it is determined that the current pipeline node does not have an adjacent node that is not in the path saving matrix, and the previous adjacent node adjacent to the current pipeline node is a main oil inlet node, the operation of determining the path to be cleaned is stopped.

[0087] Among them, this solution can find a new next adjacent node again, repeating steps 2, 3, and 4 until tracing back to the main oil inlet node.

[0088] After tracing back to the starting point, the hydraulic pipeline model of the left wing of the aircraft has been traversed, and all the paths from the starting point to the end point are stored in the matrix allroutes, and the switch status of the valve node corresponding to each path to be cleaned is stored in the matrix M.

[0089] This solution can use the flight control actuator dummy module (with a pipeline positioning installation interface, which can be connected to the controller through a cable, and can realize the "reversing valve" functions such as programmable oil circuit reversing, cutting, and passage). The dummy module replaces the real hydraulic finished parts and solves the problem of repeatedly disassembling and assembling the finished parts to carry out cleaning and pressure resistance tests. Each dummy part has a cable that can be connected to a controller, and a controller can control the switches of more than a dozen flight control dummy parts at the same time.

[0090] Exemplarily, taking the left wing of a civil aircraft wing section as an example, this solution can determine the following Figure 2 The adjacent model diagram of each node of the left wing of the wing section is shown. Application Figure 5 Flow chart of automatic search for the path to be cleaned. Assume that the main oil inlet node is the currently visited vertex. After marking the main oil inlet node 1, select an undetected path from point 1 to reach node 2. If node 2 is found to have been visited, reselect another undetected path from node 1. If point 2 has not been visited, visit node 2 and mark it as visited; then start searching from node 2 until a complete path from the main oil inlet node to the main oil outlet node is found. Where there is a valve node on the path, the opening and closing status of the valve node is automatically given. The controller controls the opening and closing of the valve node at the dummy according to the algorithm to complete the cleaning of a path to be cleaned.

[0091] The algorithm traces back to the node before the main oil outlet node, changes the valve node state at that point, and searches for a new path to the main oil outlet node. If the search is successful, the controller controls the start of the valve node at the dummy according to the algorithm to complete the cleaning of a new path. Otherwise, it traces back to the previous node.

[0092] Repeat the steps of backtracking and searching the path until you backtrack to the main oil inlet node and complete the search of all paths, that is, the hydraulic pipeline of the aircraft wing section is cleaned. Figure 3 At least one path to be cleaned is shown, so that the test process and data can be traced and effectively managed.

[0093] The technical solution provided by the embodiment of the present invention connects the components and pipelines through reversible valve nodes, which can automatically search for cleaning paths, control the reversal of valve nodes, avoid damage caused by repeated disassembly and assembly of connectors, and record the direction status of valve nodes at each connection. The cleaning path is visible and the cleaning process is traceable, avoiding repeated cleaning or missed cleaning of pipelines. It has a high degree of automation, simple steps and high efficiency.

[0094] Figure 6 1 is a schematic diagram of the structure of an automatic cleaning device for aircraft wing pipes provided by an embodiment of the present invention. The device can be configured in an electronic device for automatic cleaning of aircraft wing pipes. Figure 6 As shown, the device comprises:

[0095] The neighbor table matrix information determination module 310 is used to determine the neighbor table matrix information according to the main oil inlet node, the main oil outlet node and each intermediate pipeline node information on the aircraft wing pipeline; the neighbor table matrix information is used to characterize the connectivity relationship between each node; at least some of the intermediate pipeline nodes are valve nodes; the connectivity relationship includes an adjacent relationship and an on-off relationship;

[0096] A path determination module 320 for cleaning is used to determine at least one path for cleaning based on the neighbor list matrix information; each of the paths for cleaning starts from a main oil inlet node and ends at a main oil outlet node;

[0097] The path to be cleaned cleaning module 330 is used to clean each of the paths to be cleaned in sequence; wherein the state of the nodes in the path to be cleaned in the cleaning process is an open state.

[0098] Optionally, the module for determining the path to be cleaned 320 includes a cleaning node link determination unit, which is used to determine at least two cleaning node links based on the neighbor list matrix information; each of the cleaning node links includes a link composed of two adjacent nodes that can be connected during cleaning, and the two adjacent nodes are composed of a main oil inlet node, at least one intermediate pipeline node and two nodes of the main oil outlet node; the path to be cleaned determination unit is used to connect through the at least two cleaning node links to obtain a path to be cleaned starting from the main oil inlet node and ending at the main oil outlet node.

[0099] Optionally, the cleaning node link determination unit includes a current pipeline node determination subunit, which is used to determine the adjacent nodes of the main oil inlet node based on the neighbor list matrix information, and use the adjacent nodes of the main oil inlet node as the current pipeline node, and add the main oil inlet node and the current pipeline node to the path preservation matrix in sequence; the main oil inlet node is connected to the current pipeline node; an adjacent node determination subunit, which is used to determine an adjacent node of the current pipeline node based on the neighbor list matrix information; a current pipeline node update subunit, which is used to use an adjacent node of the current pipeline node as the current pipeline node if it is determined that an adjacent node of the current pipeline node is not the main oil outlet node and is not in the path preservation matrix, and add the current pipeline node to the path preservation matrix; a first cleaning node link determination subunit, which is used to return to execute the operation of determining an adjacent node of the current pipeline node based on the neighbor list matrix information, until the current pipeline node is the main oil outlet node, and at least two cleaning node links are obtained.

[0100] Optionally, the device also includes a second cleaning node link determination module, which is used to, after determining an adjacent node of the current pipeline node based on the adjacent table matrix information, if it is determined that the current pipeline node does not have an adjacent node that is not in the path saving matrix, use the previous adjacent node of the current pipeline node as the current pipeline node; return to execute the operation of determining an adjacent node of the current pipeline node based on the adjacent table matrix information until the current pipeline node is the main oil-exporting node, and obtain at least two cleaning node links.

[0101] Optionally, the device also includes a module for stopping determining the path to be cleaned, which is used to stop the operation of determining the path to be cleaned if it is determined that the current pipeline node does not have an adjacent node that is not in the path saving matrix, and the previous adjacent node adjacent to the current pipeline node is a main oil inlet node.

[0102] Optionally, the path to be cleaned cleaning module 330 includes a first cleaning unit, which is used to clean the path to be cleaned that is determined for the first time, and set the valve nodes in the path to be cleaned that is determined for the first time to be cleaned to a closed state; a current cleaning path determination unit, which is used to set the next path to be cleaned as the current cleaning path; a current path to be cleaned cleaning unit, which is used to set the valve nodes of the current cleaning path to an open state and clean the current cleaning path; a valve node closing unit, which is used to set the valve nodes of the current cleaning path to a closed state; and a continue cleaning unit, which is used to return to execute the operation of setting the next path to be cleaned as the current cleaning path, until all the paths to be cleaned where the valve nodes are located are cleaned, and the cleaning of each of the paths to be cleaned is stopped.

[0103] Optionally, the device also includes a connectivity relationship updating module, which is used to update the connectivity relationship associated with each node of the path to be cleaned in the neighbor list matrix information according to the order of the nodes in the path to be cleaned, for each path to be cleaned, before cleaning each path to be cleaned in turn.

[0104] The device provided in the above-mentioned embodiments can execute the automatic cleaning method of the aircraft wing pipeline provided in any embodiment of the present invention, and has the corresponding functional modules and beneficial effects of the execution method.

[0105] Figure 7A schematic diagram of the structure of an electronic device 40 that can be used to implement an embodiment of the present invention is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices (such as helmets, glasses, watches, etc.) and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present invention described and / or required herein.

[0106] like Figure 7 As shown, the electronic device 40 includes at least one processor 41, and a memory connected to the at least one processor 41, such as a read-only memory (ROM) 42, a random access memory (RAM) 43, etc., wherein the memory stores a computer program that can be executed by at least one processor, and the processor 41 can perform various appropriate actions and processes according to the computer program stored in the read-only memory (ROM) 42 or the computer program loaded from the storage unit 48 to the random access memory (RAM) 43. In the RAM 43, various programs and data required for the operation of the electronic device 40 can also be stored. The processor 41, the ROM 42, and the RAM 43 are connected to each other through a bus 44. An input / output (I / O) interface 45 is also connected to the bus 44.

[0107] A number of components in the electronic device 40 are connected to the I / O interface 45, including: an input unit 46, such as a keyboard, a mouse, etc.; an output unit 47, such as various types of displays, speakers, etc.; a storage unit 48, such as a disk, an optical disk, etc.; and a communication unit 49, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 49 allows the electronic device 40 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.

[0108] The processor 41 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the processor 41 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various special artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, a digital signal processor (DSP), and any appropriate processor, controller, microcontroller, etc. The processor 41 executes the various methods and processes described above, such as the intelligent voice outbound calling method.

[0109] In some embodiments, the intelligent voice outbound calling method may be implemented as a computer program, which is tangibly contained in a computer-readable storage medium, such as a storage unit 48. In some embodiments, part or all of the computer program may be loaded and / or installed on the electronic device 40 via the ROM 42 and / or the communication unit 49. When the computer program is loaded into the RAM 43 and executed by the processor 41, one or more steps of the intelligent voice outbound calling method described above may be performed. Alternatively, in other embodiments, the processor 41 may be configured to execute the intelligent voice outbound calling method in any other appropriate manner (e.g., by means of firmware).

[0110] Various implementations of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0111] Computer programs for implementing the methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that when the computer program is executed by the processor, the functions / operations specified in the flow chart and / or block diagram are implemented. The computer program may be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.

[0112] In the context of the present invention, a computer-readable storage medium may be a tangible medium that may contain or store a computer program for use by or in combination with an instruction execution system, device or equipment. A computer-readable storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices or equipment, or any suitable combination of the foregoing. Alternatively, a computer-readable storage medium may be a machine-readable signal medium. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0113] To provide interaction with a user, the systems and techniques described herein may be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and a pointing device (e.g., a mouse or trackball) through which the user can provide input to the electronic device. Other types of devices may also be used to provide interaction with the user; for example, the feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form (including acoustic input, voice input, or tactile input).

[0114] The systems and techniques described herein may be implemented in a computing system that includes backend components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes frontend components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such backend components, middleware components, or frontend components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), a blockchain network, and the Internet.

[0115] A computing system may include a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The client and server relationship is generated by computer programs running on the corresponding computers and having a client-server relationship with each other. The server may be a cloud server, also known as a cloud computing server or cloud host, which is a host product in the cloud computing service system to solve the defects of difficult management and weak business scalability in traditional physical hosts and VPS services.

[0116] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps described in the present invention can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solution of the present invention can be achieved, and this document does not limit this.

[0117] The above specific implementations do not constitute a limitation on the protection scope of the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. An automatic cleaning method for aircraft wing pipes, characterized in that: include: Determine the neighbor table matrix information based on the main oil inlet node, the main oil outlet node and each intermediate pipeline node information on the aircraft wing pipeline; The neighbor list matrix information is used to characterize the connectivity relationship between nodes; at least some of the intermediate pipeline nodes are valve nodes; the connectivity relationship includes an adjacent relationship and an on-off relationship; Determine the adjacent nodes of the main oil inlet node based on the neighbor list matrix information, use the adjacent nodes of the main oil inlet node as the current pipeline node, and add the main oil inlet node and the current pipeline node to the path saving matrix in sequence; The main oil inlet node is connected to the current pipeline node; Determine an adjacent node of the current pipeline node based on the adjacent table matrix information; If it is determined that one of the adjacent nodes of the current pipeline node is not a main oil export node and is not in the path saving matrix, then taking one of the adjacent nodes of the current pipeline node as the current pipeline node and adding the current pipeline node to the path saving matrix; If it is determined that one of the adjacent nodes of the current pipeline node is not the main oil-exporting node and is in the path saving matrix, then if it is determined that the current pipeline node does not have an adjacent node that is not in the path saving matrix, then the previous adjacent node of the current pipeline node is used as the current pipeline node; Return to perform the operation of determining an adjacent node of the current pipeline node based on the adjacent table matrix information, until the current pipeline node is a main oil outlet node, and obtain at least two cleaning node links, each of the cleaning node links includes a link composed of two adjacent nodes that can be connected during cleaning, and the two adjacent nodes are composed of a main oil inlet node, at least one intermediate pipeline node, and two nodes of the main oil outlet node; At least one path to be cleaned is obtained by connecting the at least two cleaning node links; each of the paths to be cleaned has a main oil inlet node as a starting point and a main oil outlet node as an end point; Each of the paths to be cleaned is cleaned in turn; wherein the state of the nodes in the paths to be cleaned during the cleaning process is an open state.

2. The method according to claim 1, characterized in that The method further comprises: If it is determined that the current pipeline node does not have an adjacent node that is not in the path storage matrix, and the previous adjacent node adjacent to the current pipeline node is a main oil inlet node, the operation of determining the path to be cleaned is stopped.

3. The method according to claim 1, characterized in that: Cleaning each of the paths to be cleaned in sequence, including: Cleaning the path to be cleaned that is determined for the first time, and setting the valve nodes in the path to be cleaned that is determined for the first time to be cleaned to a closed state when the cleaning of the path to be cleaned that is determined for the first time is completed; The next path to be cleaned is used as the current cleaning path; Setting the valve node of the current cleaning path to an open state to clean the current cleaning path; Setting the valve node of the current cleaning path to a closed state; Return to execute the operation of taking the next path to be cleaned as the current cleaning path, until all the paths to be cleaned where the valve nodes are located are cleaned, and stop cleaning the paths to be cleaned.

4. The method according to claim 3, characterized in that Before cleaning each of the paths to be cleaned in sequence, the method further comprises: For each of the to-be-cleaned paths, the on-off relationships associated with the nodes in the to-be-cleaned paths in the neighbor list matrix information are updated according to the order of the nodes in the to-be-cleaned paths.

5. An automatic cleaning device for aircraft wing pipes, characterized in that: include: The neighbor table matrix information determination module is used to determine the neighbor table matrix information according to the main oil inlet node, the main oil outlet node and each intermediate pipeline node information on the aircraft wing pipeline; The neighbor list matrix information is used to characterize the connectivity relationship between nodes; at least some of the intermediate pipeline nodes are valve nodes; the connectivity relationship includes an adjacent relationship and an on-off relationship; A path determination module to be cleaned is used to determine the adjacent nodes of the main oil inlet node based on the neighbor list matrix information, and use the adjacent nodes of the main oil inlet node as the current pipeline node, and add the main oil inlet node and the current pipeline node to the path preservation matrix in sequence; The main oil inlet node is connected to the current pipeline node; an adjacent node of the current pipeline node is determined based on the neighbor list matrix information; if it is determined that an adjacent node of the current pipeline node is not the main oil outlet node and is not in the path preservation matrix, an adjacent node of the current pipeline node is used as the current pipeline node, and the current pipeline node is added to the path preservation matrix; If it is determined that one of the adjacent nodes of the current pipeline node is not the main oil-exporting node and is in the path saving matrix, then if it is determined that the current pipeline node does not have an adjacent node that is not in the path saving matrix, then the previous adjacent node of the current pipeline node is used as the current pipeline node; Return to perform the operation of determining an adjacent node of the current pipeline node based on the neighbor list matrix information, until the current pipeline node is the main oil outlet node, and obtain at least two cleaning node links, each of the cleaning node links includes a link composed of two adjacent nodes that can be connected during cleaning, and the two adjacent nodes are composed of the main oil inlet node, at least one intermediate pipeline node and two nodes of the main oil outlet node; connect through the at least two cleaning node links to obtain at least one path to be cleaned; each of the paths to be cleaned has the main oil inlet node as a starting point and the main oil outlet node as an end point; The path to be cleaned cleaning module is used to clean each of the paths to be cleaned in turn; wherein the state of the nodes in the path to be cleaned in the cleaning process is an open state.

6. An electronic device, characterized in that: The electronic device comprises: at least one processor; and a memory communicatively connected to the at least one processor; wherein, The memory stores a computer program executable by the at least one processor, and the computer program is executed by the at least one processor so that the at least one processor can perform the automatic cleaning method for aircraft wing pipes according to any one of claims 1 to 4.

7. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a processor to implement the automatic cleaning method for aircraft wing pipes according to any one of claims 1 to 4 when executed.

Images