METHOD FOR DETERMINING THE STATE OF A DEVICE IN AN AIRCRAFT

• US 20150269280A1
• Filed: 03/19/2015
• Published: 09/24/2015
• Est. Priority Date: 03/20/2014
• Status: Active Grant

• Current Assignee: Airbus
• Original Assignee: Airbus
• Inventors: ASTIER, Julien
• Granted Patent: US 10,248,737 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06Q 10/00 Administration; Management

Abstract

A method and a system for determining the state of a device in an aircraft, this state being specified by a current version of the device as implemented in the aircraft. The method according to the invention comprises: transmitting a request to a database and receiving in response a list of updates previously performed on the device, each update specifying an earlier version and a later version; and from a directed graph, such that each edge corresponds to an update of a set of updates associated with devices of the type of the device of interest, determining a sub-graph corresponding to the list.

Claims

1. A method for determining a state of a device of interest in an aircraft, this state specifying a version of the device of interest present in the aircraft, the method comprising:

transmitting, by one or more computers, and to at least one database, a request formed from an identifier of the aircraft;

receiving, by the one or more computers and in response to the transmitting, a list of updates previously performed on the device of interest, each update specifying an earlier version of the device of interest before the update and a later version of the device of interest after the update;

from a directed graph, stored in a memory, and such that each edge of a plurality of edges of the directed graph corresponds to one update out of a set of updates associated with devices of a type of the device of interest, determining, by the one or more computers, a sub-graph of the directed graph corresponding to the list of updates;

determining, by the one or more computers, the state of the device of interest from the sub-graph; and

causing, by the one or more computers, the state of the device of interest to be displayed on a display device.

2. The method of claim 1, wherein the directed graph and the sub-graph are each stored in the form of an adjacent matrix, each non-zero coefficient of the adjacent matrix of the generic graph being associated with at least one update.

3. The method of claim 2, comprising determining, by the one or more computers, the power N of the adjacent matrix of the sub-graph, in which N is the number of updates of the list of updates received by the one or more computers.

4. The method of claim 1, comprising determining, by the one or more computers, for each peak of a plurality of peaks of the sub-graph, the indegree and the outdegree of the peak and comparing the indegree and the outdegree.

5. The method of claim 4, wherein the indegrees and outdegrees are stored in the form of a vector of indegrees and a vector of outdegrees, each component of the vector of indegrees being associated with a later version of the device of interest, and each component of the vector of outdegrees being associated with an earlier version of the device of interest.

6. The method of claim 4, wherein comparing the indegree and the outdegree comprises selecting at least one first peak of the sub-graph, of which the indegree is greater than the outdegree.

7. The method of claim 6, wherein the state of the device of interest is determined based on the later version associated with the first peak.

8. The method of claim 4, comprising determining at least two first peaks of which the indegree is greater than the outdegree, the method comprising:

comparing the sub-graph and the generic graph, and identifying at least one edge of the sub-graph omitted and/or errored;

correcting the sub-graph;

for each peak of the corrected sub-graph, determining the indegree and of the outdegree, then comparing the indegree and the outdegree.

9. The method of claim 8, wherein comparing and identifying comprises:

selecting at least two second peaks of the sub-graph, such that the indegree is less than the outdegree; and

searching, in the directed graph, for a missing edge going from one of the second peaks to one of the first peaks;

wherein correcting the sub-graph comprises adding the missing edge to the sub-graph.

10. The method of claim 8, comprising making a correction of the list of updates stored in the database, to make the list of updates correspond to the corrected sub-graph.

11. The method of claim 8, wherein the list of updates distinguishes updates performed before delivery of the aircraft and updates performed after delivery of the aircraft, and wherein the method comprises:

determining the state of the device, just after delivery of the aircraft, using a first generic graph such that each edge corresponds to an update before delivery, and using the updates from the list performed before delivery of the aircraft;

when the determination of the state of the device after delivery has implemented a correction of a particular sub-graph, correcting the list of updates;

determining the state of the device, using a second generic graph such that each edge corresponds to an update before or after delivery, and using the corrected list of updates if it exists or the list of updates otherwise.

12. The method of claim 5, comprising storing, in the memory, a triplet corresponding to a particular sub-graph and comprising the vector of the indegrees, the vector of the outdegrees, and the state of the device of interest.

13. The method of claim 5, comprising storing, in the memory, a first adjacent matrix of a particular sub-graph associated with a first instant t₁, the method comprising:

transmitting, at a second instant t₂ after the first instant t₁, a request (R) formed from an identifier of the aircraft, and receiving, in response, a list of updates previously performed on the device of interest;

determining a particular sub-graph associated with the second instant t₂, stored in the form of a second adjacent matrix;

subtracting the first adjacent matrix from the second adjacent matrix, to obtain a matrix of the modifications;

determining the vector of indegrees and the vector of outdegrees associated with the matrix of modifications, to deduce therefrom the state of the device of interest at the second instant t₂.

14. The method of claim 1, comprising, when the state of the device of interest as determined corresponds to a version identified as obsolete, updating the device of interest of the aircraft to a non-obsolete version of said device.

15. A system comprising:

at least one database, storing, for each aircraft of a plurality of aircrafts, a list of updates previously performed on a device of interest;

one or more processors;

a memory storing a directed graph and instructions that, when executed by the one or more processors, cause the one or more processors to perform operations comprising;

transmitting, to the database, a request formed from an identifier of an aircraft;

receiving, in response to the transmitting, a list of updates previously performed on the device of interest, each update specifying an earlier version of the device of interest before the update and a later version of the device of interest after the update;

from the directed graph, wherein the directed graph is constructed such that each edge of a plurality of edges of the directed graph corresponds to one update out of a set of updates associated with devices of a type of the device of interest, determining a sub-graph of the directed graph corresponding to the list of updates;

determining the state of the device of interest from the sub-graph; and

causing the state of the device of interest to be displayed on a display device.

16. The system of claim 15, wherein the directed graph and the sub-graph are each stored in the form of an adjacent matrix, each non-zero coefficient of the adjacent matrix of the generic graph being associated with at least one update.

17. The system of claim 16, the operations comprising determining the power N of the adjacent matrix of the sub-graph, in which N is the number of updates of the list of updates received by the one or more computers.

18. The system of claim 15, the operations comprising determining for each peak of a plurality of peaks of the sub-graph, the indegree and the outdegree of the peak and comparing the indegree and the outdegree.

19. The system of claim 18, wherein the indegrees and outdegrees are stored in the form of a vector of indegrees and a vector of outdegrees, each component of the vector of indegrees being associated with a later version of the device of interest, and each component of the vector of outdegrees being associated with an earlier version of the device of interest.

20. The system of claim 18, wherein comparing the indegree and the outdegree comprises selecting at least one first peak of the sub-graph, of which the indegree is greater than the outdegree.