# US 2020/0391885 A1 · Methods and systems for identifying aircraft faults

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2020/0391885 A1
- Document ID: US20200391885A1
- Status: Published application
- Kind: A1
- Application number: 16/898,483
- Filed: 2020-06-11
- Published: 2020-12-17
- Earliest claimed: 2019-06-11
- Assignees: Qatar Foundation for Education, Science and Community Development; The Boeing Company
- Applicants: Qatar Foundation for Education, Science and Community Development; The Boeing Company
- Inventors: Mohamed M. Elshrif; Sanjay Chawla; Franz D. Betz; Dragos D. Margineantu
- Web page: https://patentgrep.com/patent/US20200391885A1

## CPC

- B64F 5/60: Testing or inspecting aircraft components or systems
- B64F 5/40: Maintaining or repairing aircraft
- B64D 2045/0085: {Devices for aircraft health monitoring, e.g. monitoring flutter or vibration}
- B64F: GROUND OR AIRCRAFT-CARRIER-DECK INSTALLATIONS SPECIALLY ADAPTED FOR USE IN CONNECTION WITH AIRCRAFT; DESIGNING, MANUFACTURING, ASSEMBLING, CLEANING, MAINTAINING OR REPAIRING AIRCRAFT, NOT OTHERWISE PROVIDED FOR; HANDLING, TRANSPORTING, TESTING OR INSPECTING AIRCRAFT COMPONENTS, NOT OTHERWISE PROVIDED FOR
- B64D: EQUIPMENT FOR FITTING IN OR TO AIRCRAFT; FLIGHT SUITS; PARACHUTES; ARRANGEMENT OR MOUNTING OF POWER PLANTS OR PROPULSION TRANSMISSIONS IN AIRCRAFT

## Abstract

A method for identifying aircraft faults, comprising: receiving aircraft health dataset comprising plurality of maintenance identifiers which each identify aircraft fault; storing diagnostics database storing plurality of part identifiers which each identify part of aircraft which is possible cause of generation of at least one maintenance identifier; generating graph of plurality of maintenance identifiers and plurality of edges in which maintenance identifiers are connected to one another by edge if maintenance identifiers are identified by common part identifier in diagnostics database; extracting clique from graph, clique comprising plurality of maintenance identifiers and respective plurality of edges of graph; determining intersection between at least two edges of clique; identifying candidate part identifier which is common to intersecting edges of clique, candidate part identifier identifying part of aircraft which is possible cause of generation of at least some of maintenance identifiers of clique; and outputting candidate part identifier.

## Claims

### Claim 1

A method for identifying aircraft faults, the method comprising:
receiving, at a processing arrangement which incorporates a processor and a memory, an aircraft health dataset comprising a plurality of maintenance identifiers, each maintenance identifier of the plurality of maintenance identifiers identifying an aircraft fault;
storing, at the processing arrangement, a diagnostics database storing a plurality of part identifiers, each part identifier of the plurality of part identifiers identifying a part of an aircraft which is a possible cause of the generation of at least one maintenance identifier;
generating, by the processing arrangement, a graph of the plurality of maintenance identifiers and a plurality of edges in which maintenance identifiers are connected to one another by an edge of the plurality of edges if the maintenance identifiers are identified by a common part identifier in the diagnostics database;
extracting, by the processing arrangement, a clique from the graph, the clique comprising a plurality of the maintenance identifiers and a respective plurality of edges of the graph;
determining, by the processing arrangement, an intersection between at least two edges of the clique;
identifying, by the processing arrangement, a candidate part identifier which is common to the intersecting edges of the clique, the candidate part identifier identifying a part of the aircraft which is a possible cause of the generation of at least some of the maintenance identifiers of the clique; and
outputting, from the processing arrangement, the candidate part identifier to enable a user to perform a maintenance task on the part of the aircraft which is identified by the candidate part identifier.

### Claim 2 (depends on 1)

The method of claim 1, wherein extracting a clique from the graph comprises:
enumerating a maximal clique in the graph.

### Claim 3 (depends on 2)

The method of claim 2, wherein enumerating a maximal clique in the graph comprises performing, by the processing arrangement, a Bron-Kerbosch algorithm.

### Claim 4 (depends on 3)

The method of claim 3, wherein the method further comprises:
extracting, by the processing arrangement, a monochromatic maximum clique in the graph.

### Claim 5 (depends on 1)

The method of claim 1, wherein the method further comprises:
extracting, by the processing arrangement, a further clique from the graph, the further clique comprising a further plurality of the maintenance identifiers and a respective further plurality of edges of the graph;
determining, by the processing arrangement, an intersection between at least two edges of the further clique; and
identifying, by the processing arrangement, a further candidate part identifier which is common to the intersecting edges of the further clique, the further candidate part identifier identifying a further part of the aircraft which is a possible cause of the generation of at least some of the further maintenance identifiers of the further clique.

### Claim 6 (depends on 5)

The method of claim 5, wherein extracting a further clique from the graph comprises:
enumerating a further maximal clique in the graph.

### Claim 7 (depends on 6)

The method of claim 6, wherein enumerating a further maximal clique in the graph comprises performing, by the processing arrangement, a Bron-Kerbosch algorithm.

### Claim 8 (depends on 7)

The method of claim 7, wherein the method further comprises:
extracting, by the processing arrangement, a further monochromatic maximum clique in the graph.

### Claim 9 (depends on 8)

The method of claim 8, wherein the method further comprises:
ranking, by the processing arrangement, the clique and the further clique by size.

### Claim 10 (depends on 8)

The method of claim 8, wherein the method further comprises:
ranking, by the processing arrangement, the clique and the further clique by monochromaticity.

### Claim 11 (depends on 1)

The method of claim 1, wherein the method further comprises:
performing a maintenance task on the part of the aircraft which is identified by the candidate part identifier.

### Claim 12 (depends on 11)

The method of claim 11, wherein the method further comprises:
receiving, at the processing arrangement, an updated aircraft health dataset; and
checking, by the processing arrangement, whether any maintenance messages have been cleared in response to the maintenance task being performed.

### Claim 13

A system for identifying aircraft faults, the system comprising:
a processor and a memory, the memory storing executable instructions which, when executed by the processor, cause the processor to:
receive an aircraft health dataset comprising a plurality of maintenance identifiers, each maintenance identifier of the plurality of maintenance identifiers identifying an aircraft fault;
store a diagnostics database storing a plurality of part identifiers, each part identifier of the plurality of part identifiers identifying a part of an aircraft which is a possible cause of the generation of at least one maintenance identifier;
generate a graph of the plurality of maintenance identifiers and a plurality of edges in which maintenance identifiers are connected to one another by an edge of the plurality of edges if the maintenance identifiers are identified by a common part identifier in the diagnostics database;
extract a clique from the graph, the clique comprising a plurality of the maintenance identifiers and a respective plurality of edges of the graph;
determine an intersection between at least two edges of the clique;
identify a candidate part identifier which is common to the intersecting edges of the clique, the candidate part identifier identifying a part of the aircraft which is a possible cause of the generation of at least some of the maintenance identifiers of the clique; and
output the candidate part identifier to enable a user to perform a maintenance task on the part of the aircraft which is identified by the candidate part identifier.

### Claim 14 (depends on 13)

The system of claim 13, wherein the memory stores executable instructions which, when executed by the processor, cause the processor to:
extract the clique from the graph by enumerating a maximal clique in the graph.

### Claim 15 (depends on 14)

The system of claim 14, wherein the memory stores executable instructions which, when executed by the processor, cause the processor to:
perform a Bron-Kerbosch algorithm to extract the clique from the graph.

### Claim 16 (depends on 15)

The system of claim 15, wherein the memory stores executable instructions which, when executed by the processor, cause the processor to:
extract a monochromatic maximum clique in the graph.

### Claim 17 (depends on 13)

The system of claim 13, wherein the memory stores executable instructions which, when executed by the processor, cause the processor to:
extract a further clique from the graph, the further clique comprising a further plurality of the maintenance identifiers and a respective further plurality of edges of the graph;
determine an intersection between at least two edges of the further clique; and
identify a further candidate part identifier which is common to the intersecting edges of the further clique, the further candidate part identifier identifying a further part of the aircraft which is a possible cause of the generation of at least some of the further maintenance identifiers of the further clique.

### Claim 18 (depends on 17)

The system of claim 17, wherein the memory stores executable instructions which, when executed by the processor, cause the processor to:
extract a further monochromatic maximum clique in the graph.

### Claim 19 (depends on 18)

The system of claim 18, wherein the memory stores executable instructions which, when executed by the processor, cause the processor to:
rank the clique and the further clique by monochromaticity.

### Claim 20

A computer-readable medium storing executable instructions which, when executed by a processor, cause the processor to:
receive an aircraft health dataset comprising a plurality of maintenance identifiers, each maintenance identifier of the plurality of maintenance identifiers identifying an aircraft fault;
store a diagnostics database storing a plurality of part identifiers, each part identifier of the plurality of part identifiers identifying a part of an aircraft which is a possible cause of the generation of at least one maintenance identifier;
generate a graph of the plurality of maintenance identifiers and a plurality of edges in which maintenance identifiers are connected to one another by an edge of the plurality of edges if the maintenance identifiers are identified by a common part identifier in the diagnostics database;
extract a clique from the graph, the clique comprising a plurality of the maintenance identifiers and a respective plurality of edges of the graph;
determine an intersection between at least two edges of the clique;
identify a candidate part identifier which is common to the intersecting edges of the clique, the candidate part identifier identifying a part of the aircraft which is a possible cause of the generation of at least some of the maintenance identifiers of the clique; and
output the candidate part identifier to enable a user to perform a maintenance task on the part of the aircraft which is identified by the candidate part identifier.
