×
First, we prove that finding near-optimal distinct paths to generate multiple area configuration advisories is nondeterministic polynomial-time (NP) hard.
First, we prove that finding near-optimal distinct paths to generate multiple area configuration advisories is NP-hard. Second, we propose and prove some ...
It is proposed to assist supervisors with this process by presenting them with a set of near-optimal and meaningfully different configuration advisories by ...
Nov 29, 2024 · To find such a set of advisories, a problem is defined that is equivalent to finding optimal and other near-optimal and distinct paths in a time ...
Air Traffic Control Area Configuration Advisories from Near-Optimal Distinct Paths · Michael Bloem and; Nicholas Bambos. Journal of Aerospace Information ...
People also ask
To find such a set of advisories, a problem is defined that is equivalent to finding optimal and other near-optimal and distinct paths in a time-expanded graph.
Oct 13, 2016 · Bloem, M, and Bambos, N., "Air Traffic Control Area Configuration Advisories from Near-Optimal Distinct Paths," AIAA Journal of Aerospace ...
Bambos, “Air Traffic Control Area Configuration Advisories from Near-Optimal Distinct Paths,” Journal of Aerospace Information Systems, vol. 11, no. 11, pp ...
Area of specialization supervisors dynamically configure a set of air traffic control resources so that air traffic in the area can operate safely and ...
Air traffic control area configuration advisories from near-optimal distinct paths. Journal of Aerospace Information. Systems, 11(11):764–784, November 2014 ...