The K King Problem, an Abstract Model for Computing Aircraft Landing Trajectories: On Modeling a Dynamic Hybrid System with Constraints

摘要

Motivated by the problem of computing trajectories of a set of aircraft in their final descent, we introduce the K king problem, a dramatic simplification of the initial problem in which time and space are discretized. A constraint-based model relying on several specific global constraints is introduced. Computational experiments are reported and show that small instances of this problem can be solved in reasonable time.