Urban air mobility: from complex tactical conflict resolution to network design and fairness insights

Mercedes Pelegrín, C. D’Ambrosio, R. Delmas, Youssef Hamadi
{"title":"Urban air mobility: from complex tactical conflict resolution to network design and fairness insights","authors":"Mercedes Pelegrín, C. D’Ambrosio, R. Delmas, Youssef Hamadi","doi":"10.1080/10556788.2023.2241148","DOIUrl":null,"url":null,"abstract":"Urban Air Mobility (UAM) has the potential to revolutionize transportation. It will exploit the third dimension to help smooth ground traffic in densely populated areas. This new paradigm in mobility will require methods to ensure safety and maximize efficiency. We propose to use mathematical optimization to address tactical deconfliction in UAM. Our approach is envisioned as a way of modelling and solving tactical conflicts, but also as means for assessing future infrastructures with potential utility in the design phase. We leverage envisioned UAM corridors to provide a mathematical definition of vehicle separation. A mathematical formulation is then proposed, which minimizes the total deviation from flight schedules needed to avoid loss of pairwise separation. The deconfliction is based on both airborne adjustments (through speed changes) and ground delays (holds relative to the scheduled take-off). Our experimental setup includes three use cases standing for different sources of conflicts and three synthetic UAM network topologies, which represent heterogeneous realistic scenarios. Vehicle and network capabilities are represented through model parameters, which allows us to analyse their impact on the quality of the deconfliction. Finally, insightful comparisons between our approach and both a local deconfliction and a fairness-oriented version are provided.","PeriodicalId":124811,"journal":{"name":"Optimization Methods and Software","volume":"47 75","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Optimization Methods and Software","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/10556788.2023.2241148","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Urban Air Mobility (UAM) has the potential to revolutionize transportation. It will exploit the third dimension to help smooth ground traffic in densely populated areas. This new paradigm in mobility will require methods to ensure safety and maximize efficiency. We propose to use mathematical optimization to address tactical deconfliction in UAM. Our approach is envisioned as a way of modelling and solving tactical conflicts, but also as means for assessing future infrastructures with potential utility in the design phase. We leverage envisioned UAM corridors to provide a mathematical definition of vehicle separation. A mathematical formulation is then proposed, which minimizes the total deviation from flight schedules needed to avoid loss of pairwise separation. The deconfliction is based on both airborne adjustments (through speed changes) and ground delays (holds relative to the scheduled take-off). Our experimental setup includes three use cases standing for different sources of conflicts and three synthetic UAM network topologies, which represent heterogeneous realistic scenarios. Vehicle and network capabilities are represented through model parameters, which allows us to analyse their impact on the quality of the deconfliction. Finally, insightful comparisons between our approach and both a local deconfliction and a fairness-oriented version are provided.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
城市空中机动:从复杂的战术冲突解决到网络设计和公平见解
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Maximizing the number of rides served for time-limited Dial-a-Ride* A family of limited memory three term conjugate gradient methods A semismooth conjugate gradients method – theoretical analysis A mixed-integer programming formulation for optimizing the double row layout problem Robust reverse 1-center problems on trees with interval costs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1