US5058024A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Conflict detection and resolution between moving objects
Assignee: International Business Machines Corp
•
Filing: 1989-01-23
•
Granted: 1991-10-15
•
Expires: 2009-01-23
Abstract
Abstract A machine-implemented method for detecting and resolving conflict between a plurality of objects on trajectories in space. A two-dimensional representation is generated which depicts the trajectory of one of the objects and the times remaining until conflict of said one object with front and back limiting trajectories, respectively, of at least one other of the objects. An indication of potential conflict is displayed on said representation when the trajectory of said one object is between the front and back limiting trajectories of said other object. The front and back limiting trajectories for each such other object are calculated by enclosing a preselected protected airspace about said one object in an imaginary parallelogram having one set of sides parallel to the trajectory of said one object and the other set of sides parallel to relative velocity of such other object with respect to said one object. The sides parallel to said relative velocity depict the times, respectively, during which said one object will be closest to the protected airspace just touching it from the front and closest to the back of said protected airspace without touching it. Conflict is resolved by diverting said one object by an appropriate maneuver to a conflict-free path in which the trajectory of said one object no longer lies between the front and back limiting trajectories of any other object.
Inventors
- 👤 Alfred Inselberg
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 19:26
CPC Classifications
G; G08; G08G; G08G5/00; G08G5/80; G08G5/70; G08G5/72; G08G5/727
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
189 words
A processor-implemented method of detecting and resolving conflict between a plurality of objects on trajectories in space, comprising the steps of preselecting an airspace of specified shape and size that contains one of said objects and is to be protected from penetration; calculating front and back limiting trajectories for another of said objects by enclosing said protected airspace in an imaginary parallelogram having one set of sides parallel to the trajectory of said one object and the other set of sides parallel to the relative velocity of said other object with respect to said one object; generating an output which indicates the trajectory of said one object and the times remaining until conflict of said cone object with the front and back limiting trajectories, respectively, of said other object; indicating potential conflict when the trajectory of said one object is between the front and back limiting trajectories of said other object; and resolving conflict by diverting said one object by an appropriate maneuver to a conflict-free path in which the trajectory of said one object no longer lies between the front and back limiting trajectories of said other object.
Claim 2
Dependent Claim
189 words
A processor-implemented method of detecting and resolving conflict between a plurality of objects on trajectories in space, comprising the steps of preselecting an airspace of specified shape and size that contains one of said objects and is to be protected from penetration; calculating front and back limiting trajectories for another of said objects by enclosing said protected airspace in an imaginary parallelogram having one set of sides parallel to the trajectory of said one object and the other set of sides parallel to the relative velocity of said other object with respect to said one object; generating an output which indicates the trajectory of said one object and the times remaining until conflict of said cone object with the front and back limiting trajectories, respectively, of said other object; indicating potential conflict when the trajectory of said one object is between the front and back limiting trajectories of said other object; and resolving conflict by diverting said one object by an appropriate maneuver to a conflict-free path in which the trajectory of said one object no longer lies between the front and back limiting trajectories of said other object.
Claim 3
Dependent Claim
47 words
The method of claim 1, wherein the sides parallel to said relative velocity depict, respectively, the times at which said one object will be closest to the protected airspace just touching it from the front and closest to the back of said protected airspace without touching it.
Claim 4
Dependent Claim
204 words
A processor-implemented method of resolving conflict between at least three objects on trajectories in space comprising the steps of considering one of the objects as disposed within an enveloping protected airspace of preselected dimension; calculating front and back limiting trajectories of each of the remaining objects by enclosing the protected airspace about said one object in imaginary parallelograms, each having one set of sides parallel to the trajectory of said one object and the other set of sides parallel to the relative velocity of a respective one of said remaining objects with respect to said one object; generating a two-dimensional representation which depicts the trajectory of said one object and the times remaining until conflict of said one object with front and back limiting trajectories, respectively, of each of said remaining objects; displaying on said representation an indication of potential conflict when the trajectory of said one object is between the front and back limiting trajectories of any of said remaining objects; and resolving conflict by diverting said one object by an appropriate maneuver to a conflict-free path in which the trajectory of said one object, as displayed, no longer lies between the front and back limiting trajectories of any of said remaining objects.
Claim 5
Dependent Claim
204 words
A processor-implemented method of resolving conflict between at least three objects on trajectories in space comprising the steps of considering one of the objects as disposed within an enveloping protected airspace of preselected dimension; calculating front and back limiting trajectories of each of the remaining objects by enclosing the protected airspace about said one object in imaginary parallelograms, each having one set of sides parallel to the trajectory of said one object and the other set of sides parallel to the relative velocity of a respective one of said remaining objects with respect to said one object; generating a two-dimensional representation which depicts the trajectory of said one object and the times remaining until conflict of said one object with front and back limiting trajectories, respectively, of each of said remaining objects; displaying on said representation an indication of potential conflict when the trajectory of said one object is between the front and back limiting trajectories of any of said remaining objects; and resolving conflict by diverting said one object by an appropriate maneuver to a conflict-free path in which the trajectory of said one object, as displayed, no longer lies between the front and back limiting trajectories of any of said remaining objects.
Claim 6
Dependent Claim
47 words
The method of claim 3, wherein the sides parallel to said relative velocity depict the times, respectively, during which said one object will be closest to the protected airspace just touching it from the front and closest to the back of said protected airspace without touching it.
Claim 7
Dependent Claim
255 words
A processor-implemented method of resolving conflict between a plurality of objects on trajectories in space, such conflict occurring when a preselected airspace of specified shape and size containing one of said objects is penetrated by another of such objects, said method comprising the steps of (a) generating an output which indicates the trajectory of said one object and the times remaining until conflict of said one object with front and back limiting trajectories, respectively, of each of a plurality of other objects calculated by enclosing said airspace in a set of imaginary parallelograms each having on set of sides parallel to the trajectory of said one object and the other set of sides parallel to the relative velocity of a respective one of said other objects with respect to said one object; (b) indicating potential conflict when the trajectory of said one object is between the front and back limiting trajectories of any one of said other objects; and (c) resolving conflict by diverting said one object by an appropriate maneuver to a conflict-free path in which the trajectory of said one object no longer lies between the front and back limiting trajectories of any of said other objects; and in event conflict cannot be resolved by step (c), (d) determining each such other object that prevents diversion of said one object from resolving the conflict; and (e) recursively repeating steps (a), (b) and (c) substituting, for said one object, each such other object determined by step (d) until conflict is resolved during step (c).
Claim 8
Dependent Claim
255 words
A processor-implemented method of resolving conflict between a plurality of objects on trajectories in space, such conflict occurring when a preselected airspace of specified shape and size containing one of said objects is penetrated by another of such objects, said method comprising the steps of (a) generating an output which indicates the trajectory of said one object and the times remaining until conflict of said one object with front and back limiting trajectories, respectively, of each of a plurality of other objects calculated by enclosing said airspace in a set of imaginary parallelograms each having on set of sides parallel to the trajectory of said one object and the other set of sides parallel to the relative velocity of a respective one of said other objects with respect to said one object; (b) indicating potential conflict when the trajectory of said one object is between the front and back limiting trajectories of any one of said other objects; and (c) resolving conflict by diverting said one object by an appropriate maneuver to a conflict-free path in which the trajectory of said one object no longer lies between the front and back limiting trajectories of any of said other objects; and in event conflict cannot be resolved by step (c), (d) determining each such other object that prevents diversion of said one object from resolving the conflict; and (e) recursively repeating steps (a), (b) and (c) substituting, for said one object, each such other object determined by step (d) until conflict is resolved during step (c).
Claim 9
Dependent Claim
33 words
The method of claim 5, wherein said conflict-free path is parallel to and substantially a minimal distance from the original heading of said one object necessary to avoid conflict with any other object.
Claim 10
Dependent Claim
35 words
The method of claim 5, wherein said conflict-free path is parallel to and not more than a preselected distance from the original heading of said one object necessary to avoid conflict with any other object.
Claim 11
Dependent Claim
55 words
The method according to claim 5, wherein the resolving step includes the step of selecting both the conflict-free path and necessary maneuver from a set of preselected conflict-avoidance routines stored in a memory and taking into account performance characteristics of the objects involved, and conditions and time required for such maneuver by said one object.
Claim 12
Dependent Claim
10 words
The method of claim 5, wherein said objects are aircraft.
Claim 13
Independent Claim
275 words
A method for representing, on a processor-controlled two-dimensional graphical display, position and motion information among objects moving potentially conflicting trajectories in space, comprising the steps, for one of said objects, of: calculating front and back limiting trajectories of each of the remaining objects with respect to said one object; plotting on the graphical display conflict resolution intervals representing the distances of said remaining objects from said one object and the times from start to end during which at lest some of said remaining objects will cross the path of said one object; said front and back limiting trajectories being calculated by enclosing said one object in respective parallelograms, each of which just encloses a preselected protected airspace by which said one object is to be separated from a corresponding one of the remaining objects, each parallelogram having one set of sides parallel to the trajectory of said one object and the other set of sides parallel to the relative velocity of a respective one of said remaining objects with respect to said one object, the sides of each parallelogram parallel to said relative velocity depicting the time during which said one object will be closest to the front and to the back limiting trajectories of said respective one of the remaining objects without substantial penetration thereof; denoting conflict by the trajectory of said one object as displayed lying between the front and back limiting trajectories of any of the remaining objects; and resolving conflict by diverting said one subject to a trajectory and heading in which, as displayed, it no longer lies between the front and back limiting trajectories of any of said remaining objects.
Claim 14
Independent Claim
275 words
A method for representing, on a processor-controlled two-dimensional graphical display, position and motion information among objects moving potentially conflicting trajectories in space, comprising the steps, for one of said objects, of: calculating front and back limiting trajectories of each of the remaining objects with respect to said one object; plotting on the graphical display conflict resolution intervals representing the distances of said remaining objects from said one object and the times from start to end during which at lest some of said remaining objects will cross the path of said one object; said front and back limiting trajectories being calculated by enclosing said one object in respective parallelograms, each of which just encloses a preselected protected airspace by which said one object is to be separated from a corresponding one of the remaining objects, each parallelogram having one set of sides parallel to the trajectory of said one object and the other set of sides parallel to the relative velocity of a respective one of said remaining objects with respect to said one object, the sides of each parallelogram parallel to said relative velocity depicting the time during which said one object will be closest to the front and to the back limiting trajectories of said respective one of the remaining objects without substantial penetration thereof; denoting conflict by the trajectory of said one object as displayed lying between the front and back limiting trajectories of any of the remaining objects; and resolving conflict by diverting said one subject to a trajectory and heading in which, as displayed, it no longer lies between the front and back limiting trajectories of any of said remaining objects.
Claim 15
Dependent Claim
39 words
The method of claim 10, including the step of: representing said distances on one scale; and plotting the trajectory of said one object and the front and back limiting trajectories of the remaining objects on a scale orthogonal thereto.
Claim 16
Dependent Claim
46 words
The method of claim 11, including the step of: denoting the absence of conflict with a particular one of said remaining objects by the trajectory of said one object being displayed at the same side of both front and back limiting trajectories of said particular object.
Claim 17
Independent Claim
245 words
A method for representing, on a processor-controlled display, position and motion information among objects on potentially conflicting trajectories in space, comprising the steps, for one of said objects, of: (a) calculating front and back limiting trajectories of each of the remaining objects with respect to said one object; (b) plotting on the display conflict resolution intervals representing the distances of said remaining objects from said one object and the times from start to end during which at least some of said remaining objects will cross the path of said one object; (c) representing said distances on one scale; (d) plotting the trajectory of said one object and the front and back limiting trajectories of the remaining objects on a scale orthogonal thereto; (e) upon denoting conflict by the trajectory of said one object as displayed lying between the front and back limiting trajectories of any of the remaining objects, diverting said one object by an appropriate maneuver to a conflict-free path in which the trajectory of said one object, as displayed, no longer lies between the front and back limiting trajectories of any of said remaining objects; and if conflict cannot be resolved by diverting said one object in a single maneuver, (f) determining which specific objects still prevent the maneuver of said one object from resolving the conflict; (g) performing steps (a), (b), (c), (d), and (e) recursively on each of said specific objects in turn as said one object until conflict is resolved.
Claim 18
Independent Claim
245 words
A method for representing, on a processor-controlled display, position and motion information among objects on potentially conflicting trajectories in space, comprising the steps, for one of said objects, of: (a) calculating front and back limiting trajectories of each of the remaining objects with respect to said one object; (b) plotting on the display conflict resolution intervals representing the distances of said remaining objects from said one object and the times from start to end during which at least some of said remaining objects will cross the path of said one object; (c) representing said distances on one scale; (d) plotting the trajectory of said one object and the front and back limiting trajectories of the remaining objects on a scale orthogonal thereto; (e) upon denoting conflict by the trajectory of said one object as displayed lying between the front and back limiting trajectories of any of the remaining objects, diverting said one object by an appropriate maneuver to a conflict-free path in which the trajectory of said one object, as displayed, no longer lies between the front and back limiting trajectories of any of said remaining objects; and if conflict cannot be resolved by diverting said one object in a single maneuver, (f) determining which specific objects still prevent the maneuver of said one object from resolving the conflict; (g) performing steps (a), (b), (c), (d), and (e) recursively on each of said specific objects in turn as said one object until conflict is resolved.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-10-14 | 1995-04-15 | 1995-10-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-10-14 | 1999-04-15 | 1999-10-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-10-14 | 2003-04-15 | 2003-10-15 | $7700.00 | Window Closed / Lapsed |