HAZARD DETECTION FOR A TRAVEL PLAN

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.