| 摘要 |
<p>A flight plan (811) is modelled by a trajectory (100) with a set of segments (140) having finite lateral and altitude extents between nominal waypoints. A terrain database stores hierarchical patches (400, 411) with maximum and minimum altitudes and pointers or altitudes for subpatches (602, 603). Linear-programming inequality constraints match segments with patches. A search finds any terrain locations that impinge upon the trajectory (100, 700) tube, indicating an error condition for the plan. Moving hazards (700) are modelled with segmented (710, 720) trajectories. Conflict with a moving hazard (700) occurs when moving bubbles (701, 703) within both of the trajectories overlap in both space and time.</p> |
