Particle Swarm Optimization with Required Time of Arrival Constraint for Aircraft Trajectory
Bibliographic record
Abstract
Global warming has motivated the aeronautical industry to develop new technologies that will reduce polluting emissions. A direct way to achieve this goal is to reduce fuel consumption. Reference trajectory optimization contributes to this goal by guiding aircraft to zones where meteorological conditions are favorable to execute their required missions and thereby to reduce flight costs. In this article, the reference trajectory was optimized in terms of geographical position, altitude, and speed, by taking into account a Required Time of Arrival (RTA) constraint and weather conditions. The algorithm assumes that there is no traffic and that the aircraft can fly anywhere in the search space. The search space was modeled in the form of a unidirectional weighted graph, fuel burn was computed using a numerical model, and the weather forecast was taken into account. The methodology utilized in this article to determine the most economical combinations of parameters that delivered the optimal trajectory was inspired by the Particle Swarm Optimization (PSO) algorithm. Results showed that the algorithm provided acceptable solutions under traffic management constraints. It was observed that the developed algorithm was able to save up to 9.1% (6,800 kg) of fuel burn when there was no RTA constraint for flight trajectories and up to 1.8% (600 kg) of fuel against real, as-flown trajectories with an RTA constraint of ±30 seconds. Because of the nature of the PSO Algorithm, the local best trajectories are extracted and provided as a Trajectory Option Set (TOS), which is similar in cost as the optimal trajectory.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".