Attack and Defense on Aircraft Trajectory Prediction Algorithms
Pourquoi ce travail est dans la base
Une base qui oublie comment elle a trouvé un travail ne peut pas être vérifiée. Voici les voies qui ont admis celui-ci.
Notice bibliographique
Résumé
View Video Presentation: https://doi.org/10.2514/6.2022-4027.vid The aviation industry needs lead to an increase in the number of aircraft and their flights. When the number of flights within an airspace increases, the chance of a mid-air collision (or collision) increases. Collision Avoidance Systems such as the Traffic Alert and Collision Avoidance System (TCAS) and Airborne Collision Avoidance System (ACAS) are currently used to alert pilots for potential mid-air collisions. The TCAS and the ACAS use algorithms to perform Aircraft Trajectory Predictions (ATPs) to detect potential conflicts between aircrafts. In this paper, three different aircraft trajectory prediction algorithms are discussed by using existing aircraft trajectory data containing multiple different aircraft types with different flight patterns. With this dataset, the future aircraft heading is predicted using the latitude, longitude, altitude, velocity and time. The three algorithms’ performances were evaluated in terms of their accuracy and robustness. These trajectory prediction algorithms were as well evaluated in the case of adversarial samples. Although algorithms can find reliable ATPs, earlier research has shown that they are also vulnerable against adversarial attacks that produce adversarial samples. Adversarial samples are similar to original samples from the dataset. These perturbations can cause trained algorithms to predict unreliable trajectories, which cause a security threat for learning-based trajectory algorithms, as adversarial attacks can result in intentional collisions. Adversarial training is applied as defense method in order to increase the robustness ATPs algorithms against the adversarial samples. The adversarial samples are included in the training data in order to make the algorithm more robust in the case of an adversarial attack. The findings in this research show that, comparing the three algorithm’s performance, the extreme gradient boosting algorithm is most robust against adversarial samples and adversarial training will benefit the robustness of the algorithms against lower intense adversarial samples. The contributions of this paper concern the evaluation of different aircraft trajectory prediction algorithms, the exploration of the effects of adversarial attacks, and mainly the effect of the defense against adversarial samples with low perturbation compared to no defense mechanism.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,001 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle