Solving the Air Conflict Resolution Problem Under Uncertainty Using an Iterative Biobjective Mixed Integer Programming Approach
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this paper, we tackle the aircraft conflict resolution problem under uncertainties. We consider errors due to the wind effect, the imprecision of aircraft speed prediction, and the delay in the execution of maneuvers. Using a geometrical approach, we derive an analytical expression for the minimum distance between aircraft, along with the corresponding probability of conflict. These expressions are incorporated into an existing deterministic model for conflict resolution. This model solves the problem as a maximum clique of minimum weight in a graph whose vertices represent possible maneuvers and where edges link conflict-free maneuvers of different aircraft. We then present a solution procedure focusing on two criteria, namely, fuel efficiency and the probability of reissuing maneuvers in the future: we iteratively generate Pareto front solutions to provide the controller with a set of possible solutions where she can choose the one corresponding the most to her preferences. Intensive Monte Carlo simulations validate the expressions derived for the minimum distance and the probability of conflict. Computational results highlight that up to 10 different solutions for instances involving up to 35 aircraft are generated within 3 minutes.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.002 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it