# US 2024/0005802 A1 · Aircraft conflict detection and resolution

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

- Number: US 2024/0005802 A1
- Document ID: US20240005802A1
- Status: Published application
- Kind: A1
- Application number: 17/853,478
- Filed: 2022-06-29
- Published: 2024-01-04
- Earliest claimed: 2022-06-29
- Assignees: General Electric Company
- Applicants: General Electric Company
- Inventors: Baoluo MENG; Szabolcs Andras BORGYOS; Michael Richard DURLING; Paul SASWATA
- Web page: https://patentgrep.com/patent/US20240005802A1

## CPC

- G08G 5/32: for flight plan preparation
- G08G 5/34: for flight plan modification
- G08G 5/53: for cruising
- G08G 5/55: for a single aircraft
- G08G 5/56: for two or more aircraft
- G08G 5/57: for unmanned aircraft
- G08G 5/59: in accordance with predefined flight zones, e.g. to avoid prohibited zones
- G08G 5/80: Anti-collision systems
- G08G: TRAFFIC CONTROL SYSTEMS (guiding railway traffic, ensuring the safety of railway traffic B61L; arrangement of road signs or traffic signals E01F9/00; radar or analogous systems, sonar systems, lidar systems specially adapted for traffic control G01S13/91, G01S15/88, G01S17/88; {radar or analogous systems, sonar systems, lidar systems specially adapted for anti-collision purposes G01S13/93, G01S15/93, G01S17/93})

## Abstract

Methods, apparatus and systems for generating verifiable conflict-free flight plans for aircraft are disclosed. In an embodiment, a server computer receives a set of air traffic flight plans for an airspace that includes elements, and receives at least two of aerodynamic constraint data, business constraint data and operational constraint data for an aircraft. The server computer then generates using a first constraint satisfaction solver, a plurality of candidate flight plans for the aircraft based on the at least two of the aerodynamic constraint data, the business constraint data and the operational constraint data. The server computer next checks, utilizing a second constraint solver, for conflicts with the elements of the air traffic flight plans for the airspace, and provides at least one verifiable conflict-free flight plan for the aircraft from the plurality of candidate flight plans when a candidate flight plan is conflict-free from all of the elements of the set of air traffic flight plans.

## Claims

### Claim 1

A method for generating verifiable conflict-free flight plans for aircraft comprising:
receiving, by a server computer from a user device, a set of air traffic flight plans for an airspace comprising elements and at least two of aerodynamic constraint data, business constraint data and operational constraint data for an aircraft;
generating, by the server computer utilizing a first constraint satisfaction solver, a plurality of candidate flight plans for the aircraft based on the at least two of the aerodynamic constraint data, the business constraint data and the operational constraint data;
checking, by the server computer utilizing a second constraint solver as each candidate flight plan is generated, for conflicts with the elements of the air traffic flight plans for the airspace; and
providing, by the server computer using the second constraint solver, at least one verifiable conflict-free flight plan for the aircraft from the plurality of candidate flight plans when a candidate flight plan is conflict-free from all of the elements of the set of air traffic flight plans.

### Claim 2 (depends on 1)

The method of claim 1, further comprising generating, by the server computer, a proof certificate for the verifiable conflict-free flight plan.

### Claim 3 (depends on 2)

The method of claim 2, further comprising transmitting, by the server computer to a third-party server, the proof certificate for enabling formal verification of the verifiable conflict-free flight plan.

### Claim 4 (depends on 3)

The method of claim 3, further comprising transmitting, by the server computer, the verifiable conflict-free flight plan to at least one of the user device and an authoritative registry of flight plans.

### Claim 5 (depends on 1)

The method of claim 1, wherein at least one of the first constraint satisfaction solver and the second constraint satisfaction solver comprises a Satisfiability Modulo Theories (SMT) solver.

### Claim 6 (depends on 1)

The method of claim 1, wherein the business constraint data comprises at least one of total fuel cost constraint data and total operational cost constraint data.

### Claim 7 (depends on 1)

The method of claim 1, wherein the operational constraint data comprises at least one of operational risk data, arc length constraint data, operational area data, operational volume data, altitude data, and total flight time constraint data.

### Claim 8

An apparatus for generating verifiable conflict-free flight plans for aircraft comprising:
a processor;
a communication device operably connected to the processor; and
a storage device operably connected to the processor, wherein the storage device comprise processor executable instructions which when executed cause the processor to:
receive a set of air traffic flight plans for an airspace comprising elements and at least two of aerodynamic constraint data, business constraint data and operational constraint data for an aircraft;
generate, utilizing a first constraint satisfaction solver, a plurality of candidate flight plans for the aircraft based on the at least two of the aerodynamic constraint data, the business constraint data and the operational constraint data;
check, utilizing a second constraint solver as each candidate flight plan is generated, for conflicts with the elements of the air traffic flight plans; and
provide, using the second constraint solver, at least one verifiable conflict-free flight plan for the aircraft from the plurality of candidate flight plans when the verifiable conflict-free flight plan is conflict-free from all of the elements of the set of traffic flight plans.

### Claim 9 (depends on 8)

The apparatus of claim 8, wherein the storage device comprises further processor executable instructions which when executed cause the processor to generate a proof certificate for the verifiable conflict-free flight plan.

### Claim 10 (depends on 9)

The apparatus of claim 9, wherein the storage device comprises further processor executable instructions which when executed cause the processor to transmit the proof certificate to a third-party server enabling formal verification of the verifiable conflict-free flight plan.

### Claim 11 (depends on 10)

The apparatus of claim 10, wherein the storage device comprises further processor executable instructions which when executed cause the processor to transmit the verifiable conflict-free flight plan to at least one of the user device and an authoritative registry of flight plans.

### Claim 12 (depends on 8)

The apparatus of claim 8, wherein at least one of the first constraint satisfaction solver and the second constraint satisfaction solver comprises a Satisfiability Modulo Theories (SMT) solver.

### Claim 13 (depends on 8)

The apparatus of claim 8, wherein the business constraint data comprises at least one of total fuel cost constraint data and total operational cost constraint data.

### Claim 14 (depends on 8)

The apparatus of claim 8, wherein the operational constraint data comprises at least one operational risk data, arc length constraint data, operational area data, operational volume data, altitude data, and total flight time constraint data.

### Claim 15

A method for updating an authoritative conflict-free flight plan directory comprising:
receiving, by a server computer associated with an authoritative flight plan registry from a plurality of user devices, a plurality of candidate conflict-free flight plans for an airspace;
retrieving, by the server computer from a database, constraint data for the airspace, restriction data for the airspace, and a plurality of verified conflict-free flight plans associated with the airspace;
verifying on a first-in basis, by the server computer using a constraint satisfaction solver, that a candidate conflict-free flight plan of the plurality of candidate conflict-free flight plans is conflict-free; and
storing, by the server computer in the authoritative flight plan registry, the candidate conflict-free flight plan as a verified conflict-free flight plan.

### Claim 16 (depends on 15)

The method of claim 15, wherein verifying that a candidate conflict-free flight plan of the plurality of candidate conflict-free flight plans is conflict-free comprises determining, by the server computer, that no conflicts exist between data defining the candidate conflict-free flight plan and the constraint data, the restriction data, and data defining the verified conflict-free flight plan data.

### Claim 17 (depends on 15)

The method of claim 15, further comprising transmitting, by the server computer to a user device, a notification that the candidate conflict-free flight plan has been verified.

### Claim 18 (depends on 15)

The method of claim 15, further comprising generating, by the server computer, a proof certificate for the verified conflict-free flight plan.

### Claim 19 (depends on 18)

The method of claim 18, further comprising transmitting, by the server computer to a third party, the proof certificate for formal verification.

### Claim 20 (depends on 15)

The method of claim 15, further comprising, after retrieving the constraint data for the airspace, the restriction data for the airspace, and the plurality of verified conflict-free flight plans associated with the airspace:
determining, by the server computer using a constraint satisfaction solver, that a candidate conflict-free flight plan of the plurality of candidate conflict-free flight plans is not conflict-free;
rejecting, by the server computer, the candidate conflict-free flight plan; and
transmitting, by the server computer to a user device of the plurality of user devices associated with the candidate conflict-free flight plan, a rejection notification.

### Claim 21 (depends on 15)

The method of claim 15, wherein the constraint satisfaction solver comprises a Satisfiability Modulo Theories (SMT) solver.
