Complexity optimal air traffic assignment in multi-layer transport network for Urban Air Mobility operations

模拟退火 计算机科学 空中交通管制 分配问题 国家空域系统 流量网络 区间(图论) 数学优化 工程类 算法 数学 组合数学 航空航天工程
作者
Zhengyi Wang,Daniel Delahaye,Jean-Loup Farges,Sameer Alam
出处
期刊:Transportation Research Part C-emerging Technologies [Elsevier]
卷期号:142: 103776-103776 被引量:19
标识
DOI:10.1016/j.trc.2022.103776
摘要

Large numbers of Urban Air Mobility (UAM) vehicles are expected to operate in urban airspace in the near future, exceeding the capacities of current airspace and Air Traffic Management (ATM) systems. This paper presents an air traffic assignment framework for 3D air transport networks in urban airspace to enable UAM operations at future demand levels. The individual vehicle dynamics are aggregated to describe the overall flow feature in this macroscopic model. Firstly, UAM operations are modeled as flows and structured in a three-dimensional two-way air transport network. Then, a complexity optimal air traffic assignment in urban airspace is formulated as an optimization problem. Based upon the Linear Dynamical System (LDS), a novel complexity metric is defined as objective function, which takes into account dynamic flow structure, congestion, and operational efficiency. A two-phase approach combining Simulated Annealing (SA) and Dafermos’ Algorithm (DA) is introduced to efficiently solve this problem. To validate the proposed model, a case study of an air transport network in Singapore’s urban airspace with two different demands is conducted. Comparative studies are carried out between the proposed algorithm and other widely used traffic assignment algorithms. The results show that the proposed approach is capable of assigning flows in an efficient and effective manner, reducing the complexity of the air transport network significantly. The results also show that optimizing the flow pattern reduces total complexity by 90.44%±0.53% and 92.12%±0.35% with 95% confidence interval, respectively in two scenarios. The framework may be useful for Air Navigation Service Providers (ANSP) in strategic planning for UAM operations and urban airspace design.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
1秒前
无花果应助互助遵法尚德采纳,获得10
1秒前
温暖平文应助魔幻的剑心采纳,获得10
1秒前
阿橘完成签到,获得积分10
1秒前
LZY发布了新的文献求助50
3秒前
zetal完成签到,获得积分10
3秒前
3秒前
开朗的哈密瓜完成签到,获得积分10
4秒前
boook完成签到,获得积分10
4秒前
发财关注了科研通微信公众号
5秒前
5秒前
刘二宝发布了新的文献求助10
5秒前
xiuqing董完成签到,获得积分10
6秒前
00完成签到,获得积分10
8秒前
9秒前
从容猫咪完成签到,获得积分10
9秒前
10秒前
称心小兔子完成签到,获得积分10
10秒前
liang发布了新的文献求助10
11秒前
牧尔芙完成签到 ,获得积分10
11秒前
sow完成签到,获得积分10
12秒前
12秒前
兰蕙发布了新的文献求助10
12秒前
14秒前
14秒前
14秒前
14秒前
我是老大应助zxj采纳,获得10
15秒前
16秒前
16秒前
17秒前
17秒前
任性的老三完成签到,获得积分20
18秒前
积极慕梅应助大壳采纳,获得10
18秒前
18秒前
19秒前
19秒前
19秒前
sunxb10发布了新的文献求助10
20秒前
高分求助中
Sustainability in Tides Chemistry 2000
Microlepidoptera Palaearctica, Volumes 1 and 3 - 13 (12-Volume Set) [German] 1122
Дружба 友好报 (1957-1958) 1000
The Data Economy: Tools and Applications 1000
Mantiden - Faszinierende Lauerjäger – Buch gebraucht kaufen 700
PraxisRatgeber Mantiden., faszinierende Lauerjäger. – Buch gebraucht kaufe 700
A Dissection Guide & Atlas to the Rabbit 600
热门求助领域 (近24小时)
化学 医学 生物 材料科学 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 基因 遗传学 催化作用 物理化学 免疫学 量子力学 细胞生物学
热门帖子
关注 科研通微信公众号,转发送积分 3101308
求助须知:如何正确求助?哪些是违规求助? 2752714
关于积分的说明 7620589
捐赠科研通 2404990
什么是DOI,文献DOI怎么找? 1276041
科研通“疑难数据库(出版商)”最低求助积分说明 616692
版权声明 599058