Skip to main content
Geometric Programming and Mechanism Design for Air Traffic Conflict Resolution
Departmental Papers (ESE)
  • Jerome Le Ny, University of Pennsylvania
  • George J Pappas, University of Pennsylvania
We develop certain extensions of optimization based conflict resolution methods in air traffic control. The problem considered concerns the scheduling of the crossing times of a set of aircraft through a metering fix, while maintaining aircraft separation. First, we show how to solve this combined path planning and scheduling problem using mixed integer geometric programming. Second, the objective function used to determine the aircraft ordering at the fix is not given a priori but needs to be obtained from the airlines, which are strategic profit maximizing agents and could lie about their true cost. In order to realign individual and global objectives, we study the use of the Clarke-Groves mechanism in this context, which aims at extracting the true utility functions from the airlines using side-payments to the FAA.
Document Type
Conference Paper
Date of this Version
Suggested Citation:
Le Ny, J. and G.J. Pappas. (2010). "Geometric Programming and Mechanism Design for Air Traffic Conflict Resolution." Proceedings of the 2010 American Control Conference. Baltimore, MD. June 30-July 2, 2010.

©2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Citation Information
Jerome Le Ny and George J Pappas. "Geometric Programming and Mechanism Design for Air Traffic Conflict Resolution" (2010)
Available at: