Details
| Originalsprache | Englisch |
|---|---|
| Titel des Sammelwerks | 2013 IEEE/AIAA 32nd Digital Avionics Systems Conference |
| Untertitel | DASC 2013 |
| Herausgeber (Verlag) | Institute of Electrical and Electronics Engineers Inc. |
| Seiten | 1E11-1E113 |
| Seitenumfang | 13 |
| ISBN (elektronisch) | 9781479915385 |
| ISBN (Print) | 978-1-4799-1536-1 |
| Publikationsstatus | Veröffentlicht - 2013 |
| Veranstaltung | 2013 IEEE/AIAA 32nd Digital Avionics Systems Conference, DASC 2013 - East Syracuse, USA / Vereinigte Staaten Dauer: 5 Okt. 2013 → 10 Okt. 2013 |
Publikationsreihe
| Name | AIAA/IEEE Digital Avionics Systems Conference - Proceedings |
|---|---|
| ISSN (Print) | 2155-7195 |
| ISSN (elektronisch) | 2155-7209 |
Abstract
Both future air traffic management programs SESAR and NextGen foresee trajectory based operations as one of the major enablers for more efficient handling of air traffic. Furthermore, both initiatives claim to support user preferred trajectories. However, using a common airspace it is unlikely to get a conflict-free scenario from independently optimized trajectories. This paper investigates if the concept of user-preferred trajectories is feasible, and what constraints are necessary to reach a conflict-free global scenario based on independently optimized trajectories. Based on a traffic scenario with ∼33k individually optimized trajectories yielding ∼29k conflicts, a strategic resolution is performed generating least possible penalties for involved aircraft. The main technique for solving conflicts is shifting whole flights in time by a few minutes. Direct and recursive algorithms are presented; a focus is put on solving airport-related conflicts first. More than 94% of all conflicts can be solved by shifting whole flights in time respecting a maximum offset of 10 minutes.
ASJC Scopus Sachgebiete
- Ingenieurwesen (insg.)
- Luft- und Raumfahrttechnik
- Ingenieurwesen (insg.)
- Elektrotechnik und Elektronik
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
2013 IEEE/AIAA 32nd Digital Avionics Systems Conference: DASC 2013. Institute of Electrical and Electronics Engineers Inc., 2013. S. 1E11-1E113 6712525 (AIAA/IEEE Digital Avionics Systems Conference - Proceedings).
Publikation: Beitrag in Buch/Bericht/Sammelwerk/Konferenzband › Aufsatz in Konferenzband › Forschung › Peer-Review
}
TY - GEN
T1 - Individualism in global airspace-user-preferred trajectories in future ATM
AU - Kuenz, Alexander
AU - Schwoch, Gunnar
AU - Wolter, Franz Erich
PY - 2013
Y1 - 2013
N2 - Both future air traffic management programs SESAR and NextGen foresee trajectory based operations as one of the major enablers for more efficient handling of air traffic. Furthermore, both initiatives claim to support user preferred trajectories. However, using a common airspace it is unlikely to get a conflict-free scenario from independently optimized trajectories. This paper investigates if the concept of user-preferred trajectories is feasible, and what constraints are necessary to reach a conflict-free global scenario based on independently optimized trajectories. Based on a traffic scenario with ∼33k individually optimized trajectories yielding ∼29k conflicts, a strategic resolution is performed generating least possible penalties for involved aircraft. The main technique for solving conflicts is shifting whole flights in time by a few minutes. Direct and recursive algorithms are presented; a focus is put on solving airport-related conflicts first. More than 94% of all conflicts can be solved by shifting whole flights in time respecting a maximum offset of 10 minutes.
AB - Both future air traffic management programs SESAR and NextGen foresee trajectory based operations as one of the major enablers for more efficient handling of air traffic. Furthermore, both initiatives claim to support user preferred trajectories. However, using a common airspace it is unlikely to get a conflict-free scenario from independently optimized trajectories. This paper investigates if the concept of user-preferred trajectories is feasible, and what constraints are necessary to reach a conflict-free global scenario based on independently optimized trajectories. Based on a traffic scenario with ∼33k individually optimized trajectories yielding ∼29k conflicts, a strategic resolution is performed generating least possible penalties for involved aircraft. The main technique for solving conflicts is shifting whole flights in time by a few minutes. Direct and recursive algorithms are presented; a focus is put on solving airport-related conflicts first. More than 94% of all conflicts can be solved by shifting whole flights in time respecting a maximum offset of 10 minutes.
UR - http://www.scopus.com/inward/record.url?scp=84894469951&partnerID=8YFLogxK
U2 - 10.1109/DASC.2013.6712525
DO - 10.1109/DASC.2013.6712525
M3 - Conference contribution
AN - SCOPUS:84894469951
SN - 978-1-4799-1536-1
T3 - AIAA/IEEE Digital Avionics Systems Conference - Proceedings
SP - 1E11-1E113
BT - 2013 IEEE/AIAA 32nd Digital Avionics Systems Conference
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2013 IEEE/AIAA 32nd Digital Avionics Systems Conference, DASC 2013
Y2 - 5 October 2013 through 10 October 2013
ER -