Alexey A Munishkin | Search NASA

NASA NTRS2023

Strategic Deconfliction of Small Unmanned Aircraft Using Operational Volume Blocks at Crossing Waypoints

In this research, first, analytical case studies are performed to understand the parameters on which the minimum temporal separation between unmanned aircraft at crossing waypoints is dependent for enabling strategic deconfliction. The analytical expressions show that the minimum temporal separation is a function of the length and width of operational volume blocks, the relative positions of the active operational volume blocks, groundspeed of unmanned aircraft, and the incoming crossing angle. Next, the parametric study shows that the impact of the incoming crossing angle on the minimum temporal separation at a crossing waypoint increases with an increase in the width of the operational volume blocks. Finally, simulation studies are performed to understand the impact of operational volume block sizing, on-demand departure rate, minimum departure time separation, and the incoming crossing angle on the average ground delay of unmanned aircraft traveling on two routes with a single crossing waypoint and identical on-demand departure rate. Each unmanned aircraft’s estimated time of arrival at a crossing waypoint is adjusted by introducing a ground delay in departure time; no other controls (e.g., speed adjustments) are applied for strategic deconfliction. Simulation studies show that the impact of the minimum temporal separation at a crossing waypoint on the average ground delay of flights is negligible if the minimum departure time separation is at least two times the minimum temporal separation. Therefore, with an increase in minimum departure time separation at a depot, the impact of increased length of operational volume blocks enclosing the crossing waypoint on the ground delay is offset to an extent.

Operational intent↗

NASA NTRS2023

Strategic Deconfliction of Small Unmanned Aircraft Using Operational Volume Blocks at Crossing Waypoints

In this research, first, analytical case studies are performed to understand the parameters on which the minimum temporal separation between unmanned aircraft at crossing waypoints is dependent for enabling strategic deconfliction. The analytical expressions show that the minimum temporal separation is a function of the length and width of operational volume blocks, the relative positions of the active operational volume blocks, groundspeed of unmanned aircraft, and the incoming crossing angle. Next, the parametric study shows that the impact of the incoming crossing angle on the minimum temporal separation at a crossing waypoint increases with an increase in the width of the operational volume blocks. Finally, simulation studies are performed to understand the impact of operational volume block sizing, on-demand departure rate, minimum departure time separation, and the incoming crossing angle on the average ground delay of unmanned aircraft traveling on two routes with a single crossing waypoint and identical on-demand departure rate. Each unmanned aircraft’s estimated time of arrival at a crossing waypoint is adjusted by introducing a ground delay in departure time; no other controls (e.g., speed adjustments) are applied for strategic deconfliction. Simulation studies show that the impact of the minimum temporal separation at a crossing waypoint on the average ground delay of flights is negligible if the minimum departure time separation is at least two times the minimum temporal separation. Therefore, with an increase in minimum departure time separation at a depot, the impact of increased length of operational volume blocks enclosing the crossing waypoint on the ground delay is offset to an extent.

Operational Intent↗

NASA NTRSDate not supplied

Aerial Vehicle Routing and Scheduling for UAS Traffic Management: A Hybrid Monte Carlo Tree Search Approach

We present the Multi-Route Weighted Package Delivery Problem (MRWPDP) and a scalable solution methodology as a major step towards enabling an airspace deconfliction service for drone delivery operations. The problem is motivated by Strategic deconfliction under the FAA’s “Unmanned Aircraft Systems Traffic Management” Concept of Operations. MRWPDP falls under a class of vehicle routing and scheduling problems, and as such is NP-Hard. In MRWPDP, a graph network is given which consists of depots, drop-off sites, and multiple routes connecting the two. In addition, routes are weighted by the associated ground risk and total travel distance for package delivery. The goal is to optimally schedule the departure time and assign routes to a known set of vehicles at the depot. We propose a heuristic solution to the problem by borrowing techniques from Mixed Integer Linear Programming (MILP), Constraint Programming, and Monte Carlo Tree Search (MCTS). The resulting hybrid framework is MCTS with Bound-and-Prune (BP) and rapid simulated updates (U), or MCTS-BP-U. This approach is able to quickly provide a feasible solution for MRWPDP, even for large problem instances up to 1000 vehicles. We provide a MILP formulation of MRWPDP and compare its performance against MCTS-BP-U in terms of solution quality. An agent-based model simulation is conducted as a final step to validate the efficacy of our approach.

air traffic scheduling↗

NASA NTRSDate not supplied

Traffic Flow Analysis for Package Delivery Drones using a Queueing Model

A key component of the small unmanned aircraft systems traffic management ecosystem is the design of scalable algorithms for strategic deconfliction of drones prior to takeoff. In this work, we focus on efficient flow management of drones on a network of intersecting edges subject to two kinds of spacing constraints: 1) between any two adjacent vehicles on an edge and 2) between any two vehicles on two different edges arriving one after the other at an intersection. The spacing is designed to enable non-intersection of operational volumes corresponding to two different vehicles thereby properly separating the vehicles inside each volume. For simplicity, we assume a constant ground speed for the drones and fixed dimensions for the operational volume blocks. The deconfliction is managed by adjusting the takeoff time of the drones, thereby regulating their arrival time at various crossing waypoints in the network. This framework allows us to study the maximum flow (throughput) of vehicles on a network of edges connecting depots to drop off sites subject to the temporal spacing constraints. The departure scheduling of individual drones results in a combinatorial optimization problem. To alleviate this, we solve a max-flow formulation and use queueing theory to simplify the analysis and provide upper bounds to the underlying optimization problem for individual drone departure scheduling. Our results indicate that throughput drops rapidly after the density of drones in the network passes the max-flow limits.

Alexey A Munishkin↗

NASA NTRSDate not supplied

Aerial Vehicle Routing and Scheduling for UAS Traffic Management: A Hybrid Monte Carlo Tree Search Approach

We present the Multi-Route Weighted Package Delivery Problem (MRWPDP) and a scalable solution methodology as a major step towards enabling an airspace deconfliction service for drone delivery operations. The problem is motivated by Strategic deconfliction under the FAA’s “Unmanned Aircraft Systems Traffic Management” Concept of Operations. MRWPDP falls under a class of vehicle routing and scheduling problems, and as such is NP-Hard. In MRWPDP, a graph network is given which consists of depots, drop-off sites, and multiple routes connecting the two. In addition, routes are weighted by the associated ground risk and total travel distance for package delivery. The goal is to optimally schedule the departure time and assign routes to a known set of vehicles at the depot. We propose a heuristic solution to the problem by borrowing techniques from Mixed Integer Linear Programming (MILP), Constraint Programming, and Monte Carlo Tree Search (MCTS). The resulting hybrid framework is MCTS with Bound-and-Prune (BP) and rapid simulated updates (U), or MCTS-BP-U. This approach is able to quickly provide a feasible solution for MRWPDP, even for large problem instances up to 1000 vehicles. We provide a MILP formulation of MRWPDP and compare its performance against MCTS-BP-U in terms of solution quality. An agent-based model simulation is conducted as a final step to validate the efficacy of our approach.

air traffic scheduling↗

NASA NTRSDate not supplied

Rolling Horizon with K-Position Search Method for Strategic Deconfliction of Package Delivery UAS

In this research, the strategic deconfliction of unmanned aircraft systems for an urban package delivery environment with two depots and multiple drop-off locations is studied. This research aims to formulate a mathematical model to compute both the departure sequence and scheduled time of departure for each unmanned aircraft system at a depot, considering temporal constraints at en-route crossing waypoints and depots for strategic deconfliction. However, the problem formulation results in an NP-hard mixed-integer nonlinear programming problem for the global optimal solution, so instead, a "rolling horizon with𝑘-position search"heuristic method is developed. The simulation studies show that an increase in the value of𝑘(the parameter used to determine the size of the local neighborhood) reduces the average ground delay at the cost of an increase in the computation time for a given problem size. The study also shows an order of magnitude increase in the maximum number of flights scheduled with the integration of rolling horizon (time decomposition) compared to those without the integration of rolling horizon in the heuristic algorithm for a given computation time cut off.

UTM↗

NASA NTRSDate not supplied

Analysis of Traffic Flow in Structured Urban Airspace Networks with MFD-based Feedback Control

This research delves into applying the Macroscopic Fundamental Diagram (MFD) concept to structured airspace networks for comprehensive aggregate modeling and introduces a feedback-based departure function aimed at optimizing traffic flow. Previous studies have rarely examined structured airspace networks featuring non-stationary vehicles through the MFD perspective. We devised a scenario grounded in practical applications, featuring a multi-lane network with explicit lane-changing behavior. The MFD effectively captured the open-loop response, displaying a low-scatter, unimodal curve on the flow versus occupancy plot. Drawing inspiration from the ground transportation ramp-metering strategies, a proportional-integral-based controller was developed. Extensive simulation outcomes suggest that feedback control, informed by MFD, holds significant potential for managing traffic flow in Urban Air Mobility (UAM) environments; a reduction of 80% in the peak number of vehicles in a holding pattern was observed for a slight reduction in throughput in this study.

MFD↗

NASA NTRSDate not supplied

Analysis of Traffic Flow in Structured Urban Airspace Networks with MFD-based Feedback Control

This research delves into applying the Macroscopic Fundamental Diagram (MFD) concept to structured airspace networks for comprehensive aggregate modeling and introduces a feedback-based departure function aimed at optimizing traffic flow. Previous studies have rarely examined structured airspace networks featuring non-stationary vehicles through the MFD perspective. We devised a scenario grounded in practical applications, featuring a multi-lane network with explicit lane-changing behavior. The MFD effectively captured the open-loop response, displaying a low-scatter, unimodal curve on the flow versus occupancy plot. Drawing inspiration from the ground transportation ramp-metering strategies, a proportional-integral-based controller was developed. Extensive simulation outcomes suggest that feedback control, informed by MFD, holds significant potential for managing traffic flow in Urban Air Mobility (UAM) environments; a reduction of 80% in the peak number of vehicles in a holding pattern was observed for a slight reduction in throughput in this study.

MFD↗