Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Efficient and fair traffic flow management for on-demand air mobility

Efficient and fair traffic flow management for on-demand air mobility

Thumbnail Image
Download
Name

13272_2021_553_ReferencePDF.pdf

Size

2.64 MB

Format

Adobe PDF

Checksum (MD5)

f970d6e24a7151d278fc0a65735cf5ac

Download all files submitted through automated deposit
art_5218472872682480658.zip (2.29 MB)
Author(s)
Chin, Christopher
•
Gopalakrishnan, Karthik
•
Balakrishnan, Hamsa
•
Egorov, Maxim
•
Evans, Antony
Date Issued
October 23, 2021
Publisher
Springer Vienna
Citation
Chin, Christopher, Gopalakrishnan, Karthik, Balakrishnan, Hamsa, Egorov, Maxim and Evans, Antony. 2021. "Efficient and fair traffic flow management for on-demand air mobility."
Version
Author's final manuscript
Abstract
Abstract The increased use of drones and air-taxis is expected to make airspace resources more congested, necessitating the use of unmanned aircraft systems traffic management (UTM) initiatives to ensure safe and efficient operations. Typically, strategic UTM involves solving an optimization problem that ensures that proposed flight schedules do not exceed airspace and vertiport capacities. However, the dynamic nature and low lead-time of applications such as on-demand delivery and urban air mobility traffic may reduce the efficiency and fairness of strategic UTM. We first discuss the adaptation of three fairness metrics into a traffic flow management problem (TFMP). Then, with computational simulations of a drone package delivery scenario in Toulouse, we evaluate trade-offs in the TFMP between efficiency and fairness, as well as between different fairness metrics. We show that system fairness can be improved with little loss in efficiency. We also consider two approaches to the integrated scheduling of both high lead-time flights (i.e., flights with a schedule known in advance) and low lead-time flights in a rolling horizon optimization framework. We compare the performance of both approaches for different horizon lengths and under varying proportions of high and low lead-time flights.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Attribution-NonCommercial-ShareAlike 4.0 International
https://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/142600
DOI of Published Version
https://doi.org/10.1007/s13272-021-00553-3
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.