Coordinated Complexity-Aware 4D Trajectory Planning
We consider a coordinated complexity-aware 4D trajectory planning problem in this paper. A case study of multiple aircraft traversing through a sector that contains a network of airways and waypoints is utilized to illustrate the model and solution method. En-route aircraft fly into a sector via cer...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2016-03 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Qian, Xiongwen Mao, Jianfeng Diao, Xudong Yang, Changpeng |
| description | We consider a coordinated complexity-aware 4D trajectory planning problem in this paper. A case study of multiple aircraft traversing through a sector that contains a network of airways and waypoints is utilized to illustrate the model and solution method. En-route aircraft fly into a sector via certain entering waypoints, visit intermediate waypoints in sequence along airways and finally exit the sector via some exiting waypoints. An integer programming model is proposed as to solve the problem, minimizing the total cost of fuel, delay and air traffic complexity. Different from most existing literature, this optimization model explicitly takes air traffic complexity into account in the 4D trajectory planning and can ensure conflict-free at any given time (not only at discrete time instances). The first-come-first-served (FCFS) heuristics, commonly adopted in current practice, is also investigated and compared. Numerical results are included to demonstrate the effectiveness of the model. |
| format | Article |
| fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2078535969</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2078535969</sourcerecordid><originalsourceid>FETCH-proquest_journals_20785359693</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mQwds7PL0rJzEssSU1RcM7PLchJrcgsqdR1LE8sSlUwcVEIKUrMSk0uyS-qVAjISczLy8xL52FgTUvMKU7lhdLcDMpuriHOHroFRfmFpanFJfFZ-aVFeUCpeCMDcwtTY1NLM0tj4lQBABAxNDE</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2078535969</pqid></control><display><type>article</type><title>Coordinated Complexity-Aware 4D Trajectory Planning</title><source>Free E- Journals</source><creator>Qian, Xiongwen ; Mao, Jianfeng ; Diao, Xudong ; Yang, Changpeng</creator><creatorcontrib>Qian, Xiongwen ; Mao, Jianfeng ; Diao, Xudong ; Yang, Changpeng</creatorcontrib><description>We consider a coordinated complexity-aware 4D trajectory planning problem in this paper. A case study of multiple aircraft traversing through a sector that contains a network of airways and waypoints is utilized to illustrate the model and solution method. En-route aircraft fly into a sector via certain entering waypoints, visit intermediate waypoints in sequence along airways and finally exit the sector via some exiting waypoints. An integer programming model is proposed as to solve the problem, minimizing the total cost of fuel, delay and air traffic complexity. Different from most existing literature, this optimization model explicitly takes air traffic complexity into account in the 4D trajectory planning and can ensure conflict-free at any given time (not only at discrete time instances). The first-come-first-served (FCFS) heuristics, commonly adopted in current practice, is also investigated and compared. Numerical results are included to demonstrate the effectiveness of the model.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Air traffic ; Aircraft ; Aircraft industry ; Complexity ; Integer programming ; Optimization ; Traffic delay ; Traffic models ; Traffic planning ; Trajectory planning ; Waypoints</subject><ispartof>arXiv.org, 2016-03</ispartof><rights>2016. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>782,786</link.rule.ids></links><search><creatorcontrib>Qian, Xiongwen</creatorcontrib><creatorcontrib>Mao, Jianfeng</creatorcontrib><creatorcontrib>Diao, Xudong</creatorcontrib><creatorcontrib>Yang, Changpeng</creatorcontrib><title>Coordinated Complexity-Aware 4D Trajectory Planning</title><title>arXiv.org</title><description>We consider a coordinated complexity-aware 4D trajectory planning problem in this paper. A case study of multiple aircraft traversing through a sector that contains a network of airways and waypoints is utilized to illustrate the model and solution method. En-route aircraft fly into a sector via certain entering waypoints, visit intermediate waypoints in sequence along airways and finally exit the sector via some exiting waypoints. An integer programming model is proposed as to solve the problem, minimizing the total cost of fuel, delay and air traffic complexity. Different from most existing literature, this optimization model explicitly takes air traffic complexity into account in the 4D trajectory planning and can ensure conflict-free at any given time (not only at discrete time instances). The first-come-first-served (FCFS) heuristics, commonly adopted in current practice, is also investigated and compared. Numerical results are included to demonstrate the effectiveness of the model.</description><subject>Air traffic</subject><subject>Aircraft</subject><subject>Aircraft industry</subject><subject>Complexity</subject><subject>Integer programming</subject><subject>Optimization</subject><subject>Traffic delay</subject><subject>Traffic models</subject><subject>Traffic planning</subject><subject>Trajectory planning</subject><subject>Waypoints</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mQwds7PL0rJzEssSU1RcM7PLchJrcgsqdR1LE8sSlUwcVEIKUrMSk0uyS-qVAjISczLy8xL52FgTUvMKU7lhdLcDMpuriHOHroFRfmFpanFJfFZ-aVFeUCpeCMDcwtTY1NLM0tj4lQBABAxNDE</recordid><startdate>20160302</startdate><enddate>20160302</enddate><creator>Qian, Xiongwen</creator><creator>Mao, Jianfeng</creator><creator>Diao, Xudong</creator><creator>Yang, Changpeng</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20160302</creationdate><title>Coordinated Complexity-Aware 4D Trajectory Planning</title><author>Qian, Xiongwen ; Mao, Jianfeng ; Diao, Xudong ; Yang, Changpeng</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20785359693</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Air traffic</topic><topic>Aircraft</topic><topic>Aircraft industry</topic><topic>Complexity</topic><topic>Integer programming</topic><topic>Optimization</topic><topic>Traffic delay</topic><topic>Traffic models</topic><topic>Traffic planning</topic><topic>Trajectory planning</topic><topic>Waypoints</topic><toplevel>online_resources</toplevel><creatorcontrib>Qian, Xiongwen</creatorcontrib><creatorcontrib>Mao, Jianfeng</creatorcontrib><creatorcontrib>Diao, Xudong</creatorcontrib><creatorcontrib>Yang, Changpeng</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Qian, Xiongwen</au><au>Mao, Jianfeng</au><au>Diao, Xudong</au><au>Yang, Changpeng</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Coordinated Complexity-Aware 4D Trajectory Planning</atitle><jtitle>arXiv.org</jtitle><date>2016-03-02</date><risdate>2016</risdate><eissn>2331-8422</eissn><abstract>We consider a coordinated complexity-aware 4D trajectory planning problem in this paper. A case study of multiple aircraft traversing through a sector that contains a network of airways and waypoints is utilized to illustrate the model and solution method. En-route aircraft fly into a sector via certain entering waypoints, visit intermediate waypoints in sequence along airways and finally exit the sector via some exiting waypoints. An integer programming model is proposed as to solve the problem, minimizing the total cost of fuel, delay and air traffic complexity. Different from most existing literature, this optimization model explicitly takes air traffic complexity into account in the 4D trajectory planning and can ensure conflict-free at any given time (not only at discrete time instances). The first-come-first-served (FCFS) heuristics, commonly adopted in current practice, is also investigated and compared. Numerical results are included to demonstrate the effectiveness of the model.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2016-03 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_proquest_journals_2078535969 |
| source | Free E- Journals |
| subjects | Air traffic Aircraft Aircraft industry Complexity Integer programming Optimization Traffic delay Traffic models Traffic planning Trajectory planning Waypoints |
| title | Coordinated Complexity-Aware 4D Trajectory Planning |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-04T08%3A02%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Coordinated%20Complexity-Aware%204D%20Trajectory%20Planning&rft.jtitle=arXiv.org&rft.au=Qian,%20Xiongwen&rft.date=2016-03-02&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2078535969%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2078535969&rft_id=info:pmid/&rfr_iscdi=true |