Bidirectional Long Short-Term Memory Development for Aircraft Trajectory Prediction Applications to the UAS-S4 Ehécatl
Bibliographic record
Abstract
The rapid advancement of unmanned aerial systems in various civilian roles necessitates improved safety measures during their operation. A key aspect of enhancing safety is effective collision avoidance, which is based on conflict detection and is greatly aided by accurate trajectory prediction. This paper represents a novel data-driven trajectory prediction methodology based on applying the Long Short-Term Memory (LSTM) prediction algorithm to the UAS-S4 Ehécatl. An LSTM model was designed as the baseline and then developed into a Staked LSTM to better capture complex and hierarchical temporal trajectory patterns. Next, the Bidirectional LSTM was developed for a better understanding of the contextual trajectories from both its past and future data points, and to provide a more comprehensive temporal perspective that could enhance its accuracy. LSTM-based models were evaluated in terms of mean absolute percentage errors. The results reveal the superiority of the Bidirectional LSTM, as it could predict UAS-S4 trajectories more accurately than the Stacked LSTM. Moreover, the developed Bidirectional LSTM was compared with other state-of-the-art deep neural networks aimed at aircraft trajectory prediction. Promising results confirmed that Bidirectional LSTM exhibits the most stable MAPE across all prediction horizons.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".