MétaCan
Menu
Back to cohort
Record W2149778341 · doi:10.1002/atr.1293

Air holding problem solving with reinforcement learning to reduce airspace congestion

2014· article· en· W2149778341 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
venuePublished in a venue whose home country is Canada.

Bibliographic record

VenueJournal of Advanced Transportation · 2014
Typearticle
Languageen
FieldEngineering
TopicAir Traffic Management and Optimization
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsAir traffic controlReinforcement learningComputer scienceOperations researchTraffic flow (computer networking)Traffic congestionReinforcementSimulationTransport engineeringEngineeringArtificial intelligenceComputer networkAerospace engineering

Abstract

fetched live from OpenAlex

Summary The Air Holding Problem Module is proposed as a decision support system to help air traffic controllers in their daily air traffic flow management. This system is developed using an Artificial Intelligence technique known as multiagent systems to organize and optimize the solutions for controllers to handle traffic flow in Brazilian airspace. In this research, the air holding problem is modeled with reinforcement learning, and a solution is proposed and applied in two case studies of the Brazilian airspace. The system can suggest more precise and realistic actions based upon past situations and knowledge of the professionals and forecast the impact of restrictive measures at the local and/or overall level. The first case study shows performance improvements in traffic flows between 8 and 47% at the local level up to 49% at the overall level. In the second case study, performance improvements were between 15 and 57% at the local level and between 41 and 48% at the overall level. Copyright © 2014 John Wiley & Sons, Ltd.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.632
Threshold uncertainty score0.410

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.005
GPT teacher head0.201
Teacher spread0.197 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it