论文标题
带有节点关闭的城市空气流动网络的安全时间表验证
Safe Schedule Verification for Urban Air Mobility Networks with Node Closures
论文作者
论文摘要
在城市空气流动性（UAM）网络中，起飞和着陆点，称为Vertiports，由于不利天气，可能会经历间歇性关闭。为了确保安全，UAM网络中的所有飞行中城市航空车辆（UAV）必须具有替代的着陆点，如果封闭Vertiport，则具有足够的着陆能力。在本文中，我们研究了面对Vertiport关闭的UAM时间表的安全验证问题。我们首先为给定的UAM时间表提供必要和足够的条件，以确保安全，因为如果发生Vertiport闭合，那么所有无人机都将能够安全地降落在备用着陆点。接下来，我们将这些条件转换为有效的算法，以通过使用完全单型矩阵的属性通过线性程序来验证UAM计划的安全性。我们的算法允许UAM Vertiports之间的旅行时间不确定，并且与计划的无人机数量二次尺度。我们在具有多达1,000个无人机的UAM网络上演示了我们的算法。
In Urban Air Mobility (UAM) networks, takeoff and landing sites, called vertiports, are likely to experience intermittent closures due to, e.g., adverse weather. To ensure safety, all in-flight Urban Air Vehicles (UAVs) in a UAM network must therefore have alternative landing sites with sufficient landing capacity in the event of a vertiport closure. In this paper, we study the problem of safety verification of UAM schedules in the face of vertiport closures. We first provide necessary and sufficient conditions for a given UAM schedule to be safe in the sense that, if a vertiport closure occurs, then all UAVs will be able to safely land at a backup landing site. Next, we convert these conditions to an efficient algorithm for verifying safety of a UAM schedule via a linear program by using properties of totally unimodular matrices. Our algorithm allows for uncertain travel time between UAM vertiports and scales quadratically with the number of scheduled UAVs. We demonstrate our algorithm on a UAM network with up to 1,000 UAVs.
