초록 ▼

A flight plan is modeled by a trajectory with a set of segments having finite lateral and altitude extents between nominal way points. A terrain database stores hierarchical patches with maximum and minimum altitudes and pointers or altitudes for subpatches. Linear-programming inequality constraints

A flight plan is modeled by a trajectory with a set of segments having finite lateral and altitude extents between nominal way points. A terrain database stores hierarchical patches with maximum and minimum altitudes and pointers or altitudes for subpatches. Linear-programming inequality constraints match segments with patches. A search finds any terrain locations that impinge upon the trajectory tube, indicating an error condition for the plan. Moving hazards are modeled with segmented trajectories. Conflict with a moving hazard occurs when moving bubbles within both of the trajectories overlap in both space and time.

대표청구항 ▼

1. A method of evaluating a predicted plan for conflict with a hazard, comprising:defining the predicted plan as a trajectory including a set of segments having parameters denoting finite spatial extents, the parameters for all segments being specifiable arbitrarily and independently of those for an

1. A method of evaluating a predicted plan for conflict with a hazard, comprising:defining the predicted plan as a trajectory including a set of segments having parameters denoting finite spatial extents, the parameters for all segments being specifiable arbitrarily and independently of those for any others of the segments; representing a hazard as a collection of features having finite spatial extents; determining whether at least a portion of at least one of the segments conflicts with any of the features of the hazard; if so, signaling a conflict.