Urban air mobility (UAM) using unmanned aerial vehicles (UAV) is an emerging way of air transportation within metropolitan areas. For the sake of the successful operations of UAM in dynamic and uncertain airspace environments, it is important to provide safe path planning for UAVs. To achieve the path planning with safety assurance, the first step is to detect collisions. Due to uncertainty, especially data-driven uncertainty, it’s impossible to decide deterministically whether a collision occurs between a pair of UAVs. Instead, we are going to evaluate the probability of collision online in this paper for any general data-driven distribution. A sampling method based on kernel density estimator (KDE) is introduced to approximate the data-driven distribution of the uncertainty, and then the probability of collision can be converted to the Riemann sum of KDE values over the domain of the combined safety range. Comprehensive numerical simulations demonstrate the feasibility and eciency of the online evaluation of probabilistic collision for UAM using the proposed algorithm of collision detection. 
                        more » 
                        « less   
                    
                            
                            Safe Schedule Verification for Urban Air Mobility Networks With Node Closures
                        
                    
    
            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. We then extend these results to the scenario of multiple vertiport closures. Next, we convert these conditions to an efficient algorithm for verifying the 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. 
        more » 
        « less   
        
    
                            - Award ID(s):
- 1749357
- PAR ID:
- 10480520
- Publisher / Repository:
- IEEE
- Date Published:
- Journal Name:
- IEEE Transactions on Control of Network Systems
- ISSN:
- 2372-2533
- Page Range / eLocation ID:
- 1 to 12
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
- 
            
- 
            As city populations continue to rise, urban air mobility (UAM) seeks to provide much needed relief from traffic congestion. UAM is enforced by electrical vertical takeoff and landing (eVTOL) vehicles, which operate out of a vertiport, akin to the relationship between planes and airports. The vertiport has an air traffic controller (ATC) tasked with managing each eVTOL, ensuring they reach their destinations on time and safely. This task allocation problem can be difficult due to inadvertent issues such as mechanical failure, inclement weather, collisions, among other uncertainties that may arise. This paper provides a novel solution to this Urban Air Mobility - Vertiport Schedule Management (UAM-VSM) problem through the utilization of graph convolutional networks (GCNs). GCNs allow us to add abstractions of the vertiport space and eVTOL space as graphs, and aggregate information for a centralized ATC agent to help generalize the environment. We use Unreal Engine combined with Airsim for high fidelity simulation. The proposed GRL agent will be trained in an environment without extra uncertainties and then tested with and without those uncertainties. The performance will be examined side by side with a random and first come first serve (FCFS) baseline.more » « less
- 
            Urban Air Mobility (UAM) applications, such as air taxis, will rely heavily on perception for situational awareness and safe operation. With recent advances in AI/ML, state-of-the-art perception systems can provide the high-fidelity information necessary for UAM systems. However, due to size, weight, power, and cost (SWaP-C) constraints, the available computing resources of the on-board computing platform in such UAM systems are limited. Therefore, real-time processing of sophisticated perception algorithms, along with guidance, navigation, and control (GNC) functions in a UAM system, is challenging and requires the careful allocation of computing resources. Furthermore, the optimal allocation of computing resources may change over time depending on the speed of the vehicle, environmental complexities, and other factors. For instance, a fast-moving air vehicle at low altitude would need a low-latency perception system, as a long delay in perception can negatively affect safety. Conversely, a slowly landing air vehicle in a complex urban environment would prefer a highly accurate perception system, even if it takes a little longer. However, most perception and control systems are not designed to support such dynamic reconfigurations necessary to maximize performance and safety. We advocate for developing “anytime” perception and control capabilities that can dynamically reconfigure the capabilities of perception and GNC algorithms at runtime to enable safe and intelligent UAM applications. The anytime approach will efficiently allocate the limited computing resources in ways that maximize mission success and ensure safety. The anytime capability is also valuable in the context of distributed sensing, enabling the efficient sharing of perception information across multiple sensor modalities between the nodes.more » « less
- 
            Urban air mobility (UAM) has become a potential candidate for civilization for serving smart citizens, such as through delivery, surveillance, and air taxis. However, safety concerns have grown since commercial UAM uses a publicly available communication infrastructure that enhances the risk of jamming and spoofing attacks to steal or crash crafts in UAM. To protect commercial UAM from cyberattacks and theft, this work proposes an artificial intelligence (AI)-enabled exploratory cyber-physical safety analyzer framework. The proposed framework devises supervised learning-based AI schemes such as decision tree, random forests, logistic regression, K-nearest neighbors (KNN), and long short-term memory (LSTM) for predicting and detecting cyber jamming and spoofing attacks. Then, the developed framework analyzes the conditional dependencies based on the Pearson’s correlation coefficient among the control messages for finding the cause of potential attacks based on the outcome of the AI algorithm. This work considers the UAM attitude control scenario for determining jam and spoofing attacks as a use case to validate the proposed framework with a state-of-the-art UAV attack dataset. The experiment results show the efficacy of the proposed framework in terms of around 99.9% accuracy for jamming and spoofing detection with a decision tree, random forests, and KNN while efficiently finding the root cause of the attack.more » « less
- 
            Abstract Urban air mobility (UAM) is an emerging air transportation mode to alleviate the ground traffic burden and achieve zero direct aviation emissions. Due to the potential economic scaling effects, the UAM traffic flow is expected to increase dramatically once implemented, and its market can be substantially large. To be prepared for the era of UAM, we study the fair and risk‐averse urban air mobility resource allocation model (FairUAM) under passenger demand and airspace capacity uncertainties for fair, safe, and efficient aircraft operations. FairUAM is a two‐stage model, where the first stage is the aircraft resource allocation, and the second stage is to fairly and efficiently assign the ground and airspace delays to each aircraft provided the realization of random airspace capacities and passenger demand. We show that FairUAM is NP‐hard even when there is no delay assignment decision or no aircraft allocation decision. Thus, we recast FairUAM as a mixed‐integer linear program (MILP) and explore model properties and strengthen the model formulation by developing multiple families of valid inequalities. The stronger formulation allows us to develop a customized exact decomposition algorithm with both benders and L‐shaped cuts, which significantly outperforms the off‐the‐shelf solvers. Finally, we numerically demonstrate the effectiveness of the proposed method and draw managerial insights when applying FairUAM to a real‐world network.more » « less
 An official website of the United States government
An official website of the United States government 
				
			 
					 
					
 
                                    