Search NASA⌕ Search

Engineering topics

Priyank Pradeep

Publications and source records attributed to Priyank Pradeep.

34 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Simulation Studies for an Urban Air Mobility Aircraft using Hardware-In-Loop Experiments

Urban Air Mobility seeks to transport passengers, deliver cargo, and provide emergency medical transportation in major metropolitan areas. This will be accomplished with distributed electric powered vertical takeoff and landing aircraft vehicles. The low specific energy of the current generation lithium-ion battery packs limit the operational range of the electric aircraft. Limited range impacts safety by reducing the amount of time available for analyzing the potential impact of errors and failures and responding to them, and for flying to an alternative landing area or returning to the base. It is therefore critical to understand the impact of flight and environmental conditions on the onboard lithium-ion battery pack’s health. With this as the motivation, the procedure for evaluating the performance of battery packs in a laboratory setting and the results obtained using this procedure on battery packs subject to power draw characteristics of a simulated flight of a NASA conceptual quadrotor aircraft model are described. The fully charged battery is allowed to discharge at specific C-rates based on the power draw profile during the experiment, and the current and voltages are recorded as a function of time. Observed results under different operating conditions and mission profiles are discussed.

UAM↗
NASA NTRSDate not supplied

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

Numerous unmanned aircraft systems operating at low altitudes to deliver goods and services may one day become ubiquitous in our cities. In the Unmanned Aircraft Systems (UAS) Traffic Management (UTM) framework, such a concept is envisioned, where aerial vehicles operate beyond visual line of sight (BVLOS) within specifically reserved and time stamped “corridors” in the airspace. For example, these corridors or operational intent volumes can connect an aerial vehicle’s origin site to its destination site for package delivery operations. There may also be more than one corridor available for an aerial vehicle to choose from and often different corridors may intersect with one another. Thus, it is imperative to ensure flight trajectories belonging to different aerial vehicles are not in conflict. Per the UTM CONOPs, we assume that a vehicle almost always stays inside its corridor or operational volume. This work provides a framework for strategic deconfliction of UTM or package delivery drones, where we schedule the departure time of all vehicles subject to various temporal constraints (including the corridor deconfliction at the intersections). We present the “multi-route weighted package delivery problem” which serves as an exemplifying model for strategic deconfliction in UTM. In the multi-route weighted package delivery problem, a graph network is given which consists of a set of depots (source) and drop-off (destination) nodes, with multiple routes (defined as a sequence of waypoints) connecting the depots to drop-off nodes. In addition, routes are weighted by the associated ground risk and total travel distance for package delivery. The goal is for a known set of aerial vehicles to depart from the depots, choose a route and take off time, while avoiding conflicts with other aerial vehicles, and minimizing both risk and distance traveled. We provide a mixed integer linear programming (MILP) formulation of the problem, as well as a heuristic solution based on Monte Carlo Tree Search (MCTS) – a method used in game theory and artificial intelligence – to overcome limitations inherent to optimal solvers. Computational results show the advantages of using MCTS over the MILP formulation; the former can provide a sub-optimal solution quickly, and may sometimes even reach an optimal solution, whereas the latter may not even produce a solution in reasonable time. Furthermore, results from both the MILP formulation and MCTS methods were validated using a preliminary agent-based simulator implementing the UTM concept of operations. Thus, the MCTS method can be seen as a scalable solution to the complex multi-route weighted package delivery problem and may possibly be extended to similar complex optimization problems.

Kenny Chour↗
NASA NTRSDate not supplied

Study of Pairwise Deconfliction Metrics to Analyze Air Traffic Complexity in Upper Class E Airspace

Upper Class E Traffic Management (ETM) is envisioned to cooperatively facilitate operations of a diverse set of aerial vehicles, such as high-altitude long-endurance fixed-wing unmanned aircraft (low-speed and high-speed), high-altitude platforms, airships, stratospheric balloons, supersonic unmanned and commercial aircraft, etc., with a wide variety of mission types, performance characteristics, communication, navigation and surveillance capabilities, maneuverability, and on-board avionics in the National Airspace System (NAS) ’above’ 60,000 feet above mean sea level, without an active and direct control from human air traffic controllers. A diverse mixture of aerial vehicle types creates significant challenges in understanding air traffic complexity, which may not correlate strongly with air traffic density. One key step for determining air traffic complexity in upper class E airspace is to first understand pairwise deconfliction metrics such as reachability, reserve area, and reserve flight time for each pair of unique aerial vehicle types under potential conflict. Therefore, pairwise deconfliction metrics are first defined, and analytical equations are derived for conflict resolution using the heading change maneuver. Next, case studies are performed to analyze deconfliction metrics to avoid secondary conflicts in upper class E airspace. The study shows that pairwise deconfliction metrics are functions of maneuverability, performance characteristics, uncertainty in position and velocity, heading angle change, and conflict angle of aerial vehicles. The next step for this research is to build a mathematical model for air traffic complexity using pairwise deconfliction metrics and validate it in an upper Class E simulation environment.

Airspace Complexity↗
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

A Method of Compliance for Achieving Target Collision Risk in UTM Operations

This work proposes a method of compliance to ensure that the collision risks among small unmanned aircraft systems meet the target level of safety. This method presents what is needed for a strategic conflict detection service to achieve the target level of safety when conflict between operational intents are not permitted in nominal situations. A volume-based collision risk model is first developed to calculate the UA-to-UA collision risk given any two operational intent volumes. With this collision risk model, a test strategy is then proposed to assess if a strategic conflict detection service can reduce the collision risk and meet the target level of safety. The method also specifies operational data that are required to be collected to verify if requirements on conformance are being met. Additionally, two new requirements are identified and proposed by this method beyond the current standard for strategic conflict detection. In the sensitivity analysis, three main factors contributing to the collision risk are investigated. The analysis shows that buffers should be considered in a strategic conflict detection service when deconflicting operational intents. The results also reveal that the selection of test cases plays an important role in evaluating the strategic conflict detection service, and they should be representative and sufficiently complex in evaluation tests.

UTM, Method of Compliance, collision risk↗
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

Safe, Efficient, and Fair UTM Airspace Management

Unmanned Aircraft Systems (UAS) are increasingly used to perform crucial commercial activities such as various types of inspections (crops, railroads, and bridges), surveillance, and package delivery. Regulators have become interested in developing UAS Traffic Management (UTM) systems. One promising framework for UTM allocates airspace to UAS operators via an auction. To succeed, an airspace auction must be economically efficient, fair, scalable, incentive-aligned, simple, and capable of continuously modeling airspace and sharing bid status and pricing information. This paper introduces the first airspace auction mechanism that meets these criteria. In the process, we introduce new spatial-temporal fairness constraints and a new abstraction for communicating airspace pricing information, the airspace price field. We evaluate our mechanism on UAS delivery scenarios taken from a Japan Aerospace Exploration Agency(JAXA) study and show that it scales to 1000s of bids.

Strategic deconfliction↗
NASA NTRSDate not supplied

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

This research focuses on the strategic deconfliction of unmanned aircraft systems (UAS) in an urban package delivery environment with two depots and multiple drop-off locations. Since the formulated mixed-integer nonlinear programming (MINLP) problem is non-deterministic polynomial-time (NP) hard, a heuristic algorithm called "rolling horizon with k-position search (KPS)" is used to compute the departure sequence and scheduled time of departure (STD) of each UAS at a depot, considering temporal constraints at en-route crossing waypoints and depots for strategic deconfliction. The simulation studies show that an increase in the value of k (local neighborhood search) in the KPS reduces the average ground delay at the cost of an increase in the computation time for a given number of UAS, size of the rolling horizon window, and number of depots involved in the local neighborhood search. The studies also show that for a given rolling horizon window, the computation time increases exponentially with an increase in the total number of UAS flights when serial processing the local neighborhood search of KPS (with k > 1) and drops by an order of magnitude upon performing the local neighborhood search of KPS using parallel processing instead of serial processing. The computation time drops with the reduction in air traffic complexity of a scenario for a given number of flights, k (local neighborhood search), and rolling horizon window.

UTM↗
NASA NTRSDate not supplied

A Method of Compliance for Achieving Target Collision Risk in UTM Operations

This work proposes a method of compliance to ensure that the collision risks among small unmanned aircraft systems meet the target level of safety. This method presents what is needed for a strategic conflict detection service to achieve the target level of safety when conflict between operational intents are not permitted in nominal situations. A volume-based collision risk model is first developed to calculate the UA-to-UA collision risk given any two operational intent volumes. With this collision risk model, a test strategy is then proposed to assess if a strategic conflict detection service can reduce the collision risk and meet the target level of safety. The method also specifies operational data that are required to be collected to verify if requirements on conformance are being met. Additionally, two new requirements are identified and proposed by this method beyond the current standard for strategic conflict detection. In the sensitivity analysis, three main factors contributing to the collision risk are investigated. The analysis shows that buffers should be considered in a strategic conflict detection service when deconflicting operational intents. The results also reveal that the selection of test cases plays an important role in evaluating the strategic conflict detection service, and they should be representative and sufficiently complex in evaluation tests.

UTM↗
NASA NTRSDate not supplied

Confidence-Based Buffer for Strategic Deconfliction with Probabilistic Operational Intent

This paper presents a methodology to expand the 95% confidence level of the elliptical geometry given by Unmanned Aircraft System (UAS) operators planning to fly Beyond Visual Line of Sight (BVLOS) to any confidence level before being fed to the strategic deconfliction (SD) module, effectively increasing the separation buffer between Operational Intents (OIs). To assess the performance of this approach, it is integrated within an adaptation of the Rolling Horizon with K-Position Search volume-based strategic deconfliction approach, previously developed at NASA Ames, preventing the 4D overlapping of OIs shaped by ellipses instead of traditional blocks. Safety and efficiency metrics are evaluated through the deconfliction of four simulated package delivery route network structures across the San Francisco Metropolitan Area with increasing numbers of crossing waypoints (network complexity). Safety assessment entails the in-house creation of a metric to quantify collision occurrences per flight hour based on the frequency at which the probabilistic operational volume segments are sampled, whereas efficiency is measured using ground delay. Results indicate that the largest buffer growth occurs when increasing the confidence level beyond 99.9% and demonstrate the negative impact of network complexity on both metrics, regardless of the OI geometry. Further, the ellipse-based SD adaptation more accurately estimates temporal separation at crossings, allowing deconflicted vehicles to be closer together. It is concluded that the proposed methodology enables the desired confidence level to serve as an effective controller of buffer size.

strategic deconfliction↗
NASA NTRSDate not supplied

Safety Benefit Analysis of Conformance Monitoring for Situation Awareness in UTM

This work presents an analytical approach to address situations in drone operations when strategic coordination alone cannot ensure safety, requiring support from the Conformance Monitoring for Situation Awareness service and potentially other deconfliction services. This study focuses on evaluating the impact of off-nominal operations on both UA-to-UA collision risk and ground injury risk. It first establishes a relationship between the likelihood of off-nominal flights and the effectiveness of strategic coordination. The analysis then derives operational conditions where strategic coordination alone is insufficient to meet target safety requirements, particularly when the likelihood of off-nominal operations exceeds a certain threshold. The results indicate that higher operational tempo or density requires a lower likelihood of offnominal operations for strategic coordination to remain effective and meet safety targets. These findings provide quantitative operational thresholds for when CMSA services are necessary. This work contributes to the safety case for both strategic coordination and CMSA services, offering analysis on when CMSA should be employed to support strategic coordination in achieving the desired safety levels. It also establishes a framework for incorporating other deconfliction services in future safety case analyses.

Strategic deconfliction↗
NASA NTRSDate not supplied

Confidence-Based Buffer for Strategic Deconfliction with Probabilistic Operational Intent

This paper presents a methodology to expand the 95% confidence level of the elliptical geometry given by Unmanned Aircraft System (UAS) operators planning to fly Beyond Visual Line of Sight (BVLOS) to any confidence level before being fed to the strategic deconfliction (SD) module, effectively increasing the separation buffer between Operational Intents (OIs). To assess the performance of this approach, it is integrated within an adaptation of the Rolling Horizon with K-Position Search volume-based strategic deconfliction approach, previously developed at NASA Ames, preventing the 4D overlapping of OIs shaped by ellipses instead of traditional blocks. Safety and efficiency metrics are evaluated through the deconfliction of four simulated package delivery route network structures across the San Francisco Metropolitan Area with increasing numbers of crossing waypoints (network complexity). Safety assessment entails the in-house creation of a metric to quantify collision occurrences per flight hour based on the frequency at which the probabilistic operational volume segments are sampled, whereas efficiency is measured using ground delay. Results indicate that the largest buffer growth occurs when increasing the confidence level beyond 99.9% and demonstrate the negative impact of network complexity on both metrics, regardless of the OI geometry. Further, the ellipse-based SD adaptation more accurately estimates temporal separation at crossings, allowing deconflicted vehicles to be closer together. It is concluded that the proposed methodology enables the desired confidence level to serve as an effective controller of buffer size.

safety↗
NASA NTRSDate not supplied

Safety Benefit Analysis of Conformance Monitoring for Situation Awareness in UTM

This work presents an analytical approach to address situations in drone operations when strategic coordination alone cannot ensure safety, requiring support from the Conformance Monitoring for Situation Awareness service and potentially other deconfliction services. This study focuses on evaluating the impact of off-nominal operations on both UA-to-UA collision risk and ground injury risk. It first establishes a relationship between the likelihood of off-nominal flights and the effectiveness of strategic coordination. The analysis then derives operational conditions where strategic coordination alone is insufficient to meet target safety requirements, particularly when the likelihood of off-nominal operations exceeds a certain threshold. The results indicate that higher operational tempo or density requires a lower likelihood of offnominal operations for strategic coordination to remain effective and meet safety targets. These findings provide quantitative operational thresholds for when CMSA services are necessary. This work contributes to the safety case for both strategic coordination and CMSA services, offering analysis on when CMSA should be employed to support strategic coordination in achieving the desired safety levels. It also establishes a framework for incorporating other deconfliction services in future safety case analyses.

Strategic deconfliction↗