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.