Search NASA⌕ Search

SEARCH · Search NASA

Results for “drone routing”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

Delivery drone route planning over a battery swapping network

Many enterprises invest on drone delivery research and development to drop off packages at consumers’ doorsteps in a matter of minutes. We study delivery drone route planning over a battery swapping network allowing farther reach by penetrating current battery capacity constraints. A mixed-integer nonlinear programming model is created to plan efficient drone routing over the swapping machines by minimizing the delivery lead time. We develop an exact solution method, evaluate its performance, and compare it with a straightforward nonlinear solver application. A case study highlights the applicability of the model. Data and source code to the solver are publicly shared.

drone battery swapping↗

A branch-and-price algorithm for a team orienteering problem with fixed-wing drones

This paper formulates a team orienteering problem with multiple fixed-wing drones and develops a branch-and-price algorithm to solve the problem to optimality. Fixed-wing drones, unlike rotary drones, have kinematic constraints associated with them, thereby preventing them to make on-the-spot turns and restricting them to a minimum turn radius. This paper presents the implications of these constraints on the drone routing problem formulation and proposes a systematic technique to address them in the context of the team orienteering problem. Furthermore, a novel branch-and-price algorithm with branching techniques specific to the constraints imposed due to fixed-wing drones are proposed. Extensive computational experiments on benchmark instances corroborating the effectiveness of the algorithms are also presented.

42 ENGINEERING↗

Aerial drone fleet deployment optimization with endogenous battery replacements for direct delivery of time-sensitive products

Aerial drones offer a distinct potential to reduce the delivery time and energy consumption for the delivery of time-sensitive and small products. However, there is still a need in the relevant industry to understand the performance of drone-based delivery under different business needs and drone operating conditions. We studied a drone deployment optimization problem for direct delivery of time-sensitive products with release dates to customers maintaining a specified time window. This paper presents a new mixed-integer programming model, new valid inequalities, a new greedy heuristic algorithm, and a Genetic algorithm to help business owners optimally schedule and route their drone fleet minimizing the required fleet size, the required number of additional batteries, and total energy consumption. A realistic feature of the optimization method is that instead of replacing the drone battery after each return to the depot, it keeps track of the remaining energy in the drone battery and decides on battery replacements accounting for the drone routing and the user-specified minimum required battery energy. Numerical results based on real data from drone flight tests and prepared food delivery industry provide insights into the effect of different practical drone operating parameters on the required fleet size, the required number of battery replacements, and energy consumption. Here, results demonstrate that the proposed heuristic algorithm substantially outperforms the accelerated CPLEX in runtime while sacrificing the solution quality by a small amount. Additionally, results show that using a mixed fleet of hexacopter and quadcopter drones reduces the total energy consumption by 48.52% compared to using a homogeneous fleet of only hexacopters.

Drone energy consumption↗

Droning on to Delivery: Examining the Energy Impacts of Using Drones for Moving Goods

The demand for fast, localized delivery has grown significantly in recent years. Whether for cheesy snacks, prepared food, medical solutions, or business deliveries, fast and efficient delivery is increasingly a demand and differentiator. Drone delivery in the freight sector offers to revolutionize last-mile logistics and improve services. This research analyzes the impacts of drone energy for delivery operations, aiming to compare various types of drones (large and small, rotary and VTOL) and various types of business methods. The project executes novel open-air and laboratory-based testing to look at the impacts of weights, operations, temperatures and weather conditions. The study combines this real-world experimental data with fleet optimization mathematical models to assess energy consumption of different scenarios as well as examine the minimum fleet size and additional battery requirements. These fleet optimization models compare energy between types of deployments with existing delivery methods. The model was also extended to look at mixed fleets of aerial drones and ground vehicles to accommodate different restrictions on drones or when weather prohibits their use. The analysis provided insights into factors such as drone design, payload weight, flight distance, weather conditions and operational parameters and impacts of each. It showed how to combine different types of vehicles to reduce energy and improve services. And it showed that drone speed, routing restrictions, and unfavorable weather significantly influence energy consumption. Our open experiment data and optimization models can assist stakeholders and industry in understanding drone package delivery and offers keys to improving deployment.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Optimization of battery swapping infrastructure for e-commerce drone delivery

Drone delivery is widely-researched to alter the current e-commerce delivery convention for providing short delivery lead times. Yet, flight range of drones, constrained by the available battery technology, sets a milestone toward realizing the sole-drone delivery. To tackle with the flight range limitation, locating automated battery swapping machines (ABSM) have been proposed and a few studies modeled the problem. Using the ABSMs, drones can be loaded with fully-charged batteries along the route to a demand location. Here, we introduce a mixed-integer nonlinear program to model the problem. The objective of the program is to optimally select ABSM locations, determine the delivery-mode choices (drone-only, truck-only, and mixed delivery) of demand locations, find drone delivery routes, and approximate the baseline requirements for the number of drones and batteries needed. The program minimizes the overall delivery system costs including: ABSM, delivery, drone ownership, battery inventory, and service congestion. A cutting-plane method is developed to find exact solutions in finite iterations. Computational experiments showed that the method quickly yields the optimal solution to instances with less than 60 ABSM candidates and 20 demand locations. A case study shows that the optimal drone delivery infrastructure can save almost 20% cost compared to the conventional truck-only delivery. Sensitivity analyses were conducted to reveal the impact of key parameters in the decision-making and found that a decrease in the ABSM and drone costs highly affect the system cost.

25 ENERGY STORAGE↗

In-flight positional and energy use data set of a DJI Matrice 100 quadcopter for small package delivery

Abstract We autonomously directed a small quadcopter package delivery Uncrewed Aerial Vehicle (UAV) or “drone” to take off, fly a specified route, and land for a total of 209 flights while varying a set of operational parameters. The vehicle was equipped with onboard sensors, including GPS, IMU, voltage and current sensors, and an ultrasonic anemometer, to collect high-resolution data on the inertial states, wind speed, and power consumption. Operational parameters, such as commanded ground speed, payload, and cruise altitude, were varied for each flight. This large data set has a total flight time of 10 hours and 45 minutes and was collected from April to October of 2019 covering a total distance of approximately 65 kilometers. The data collected were validated by comparing flights with similar operational parameters. We believe these data will be of great interest to the research and industrial communities, who can use the data to improve UAV designs, safety, and energy efficiency, as well as advance the physical understanding of in-flight operations for package delivery drones.

42 ENGINEERING↗

A Strategic Approach for Dense, Integrated, Vehicle Navigation

Drone usage has been on the rise in recent years with applications that include parcel delivery, wildlife protection, precision farming, law enforcement, and industrial inspection, just to name a few. Once regulations and safety policies are put in place to allow for the widespread use of unmanned drones, the number of aircraft in the National Airspace System (NAS) is expected to skyrocket to millions, potentially congesting the airspace which increases the likelihood of separation violations and possibly incidents. Currently, flight infrastructure can only support a few thousand aircraft flying over the United States National Airspace System (NAS) at any given time. A delay at one airport can send ripple effects throughout the system, causing more delays and missed connections. In air traffic control, separation is the concept of keeping an “ownship” aircraft outside a minimum distance from “intruder” aircraft to reduce the risk of the aircraft colliding, as well as preventing accidents due to secondary factors, such as wake turbulence. Maintaining proper separation is often a safety critical property for fixed-wing drones in the airspace. This paper addresses drone separation in time and distance for high volume corridors (en route) and lanes (on ground), merging as well as crossing intersections of multiple corridors/lanes. In this paper, the term drone is applied to both Unmanned Aerial Vehicle (UAV) and small Unmanned Aircraft System (UAS) vehicles operating autonomously. There exists a gamut of approaches to the merging and crossing problems. At one end of the extreme are the conservative yet low cost and verifiable solutions of today that deal with two drones at a time. At the other end are complex Machine Learning-based solutions with high computing requirements for fully autonomous drones of the future that are expected to handle all contentions. This paper presents a feasible and verifiable strategic approach to these problems that is based on distributed cooperation between the drones and the infrastructure. Three phases of the strategic approach (Prepare, Adjust, Commit) are presented. Simulation results are presented that show the proposed approach is stable and resilient to induced perturbations and guarantees a set of fixed-wing drones to merge and cross intersections by adjusting their speed based on their distance to the aircraft in front of them while remaining in the equilibrium state. The equilibrium state is defined as the state when a set of n aircraft move at a relatively constant speed and uniform spacing from each other in a congested system. A congested system is defined as the state when at least one aircraft cannot move at its maximum allowed speed. Unlike existing centralized and pre-planned approaches, the proposed solution is fully distributed and enables autonomous aircraft to decide to adjust their speed and distance with respect to the preceding aircraft, dynamically. Simulation results are presented that assess the feasibility of the approach.

Distributed↗

A Strategic Approach for Dense, Integrated, Vehicle Navigation

Drone usage has been on the rise in recent years with applications that include parcel delivery, wildlife protection, precision farming, law enforcement, and industrial inspection, just to name a few. Once regulations and safety policies are put in place to allow for the widespread use of unmanned drones, the number of aircraft in the National Airspace System (NAS) is expected to skyrocket to millions, potentially congesting the airspace which increases the likelihood of separation violations and possibly incidents. Currently, flight infrastructure can only support a few thousand aircraft flying over the United States National Airspace System (NAS) at any given time. A delay at one airport can send ripple effects throughout the system, causing more delays and missed connections. In air traffic control, separation is the concept of keeping an “ownship” aircraft outside a minimum distance from “intruder” aircraft to reduce the risk of the aircraft colliding, as well as preventing accidents due to secondary factors, such as wake turbulence. Maintaining proper separation is often a safety critical property for fixed-wing drones in the airspace. This paper addresses drone separation in time and distance for high volume corridors (en route) and lanes (on ground), merging as well as crossing intersections of multiple corridors/lanes. In this paper, the term drone is applied to both Unmanned Aerial Vehicle (UAV) and small Unmanned Aircraft System (UAS) vehicles operating autonomously. There exists a gamut of approaches to the merging and crossing problems. At one end of the extreme are the conservative yet low cost and verifiable solutions of today that deal with two drones at a time. At the other end are complex Machine Learning-based solutions with high computing requirements for fully autonomous drones of the future that are expected to handle all contentions. This paper presents a feasible and verifiable strategic approach to these problems that is based on distributed cooperation between the drones and the infrastructure. Three phases of the strategic approach (Prepare, Adjust, Commit) are presented. Simulation results are presented that show the proposed approach is stable and resilient to induced perturbations and guarantees a set of fixed-wing drones to merge and cross intersections by adjusting their speed based on their distance to the aircraft in front of them while remaining in the equilibrium state. The equilibrium state is defined as the state when a set of n aircraft move at a relatively constant speed and uniform spacing from each other in a congested system. A congested system is defined as the state when at least one aircraft cannot move at its maximum allowed speed. Unlike existing centralized and pre-planned approaches, the proposed solution is fully distributed and enables autonomous aircraft to decide to adjust their speed and distance with respect to the preceding aircraft, dynamically. Simulation results are presented that assess the feasibility of the approach.

Distributed↗

Using Mobile Charging Drones to Mitigate Battery Disruptions of Electric Vehicles on Highways

Our research explores innovative solutions to address the challenge of battery disruptions in electric vehicles (EVs) on highways. We propose a centralized fleet ownership model where a company manages a fleet of Mobile Charging Drones (MCDs) guided by a k-VRP (Vehicle Routing Problem) framework. This model is designed to tackle a multi-objective optimization issue with three primary goals: reduction of the overall operating costs, decrease in the cumulative waiting time, and minimization of the combined operating costs and waiting times. This approach extends beyond the usual VRP constraints, encompassing specific limitations for both MCDs and disrupted EVs (DEVs). Additionally, our study delves into the concept of decentralized fleet ownership through the lens of crowdsourcing. Preliminary numerical analyses indicate that the capital cost of MCDs is a significant factor on the charging service, and the system performance is sensitive to DEV owner's value of time (VOT) when VOTs are relatively low.

battery disruption↗

A Strategic Approach for Dense, Integrated, Vehicle Navigation

Drone usage has been on the rise in recent years with applications that include parcel delivery, wildlife protection, precision farming, law enforcement, and industrial inspection, just to name a few. This paper addresses drone separation in time and distance for high volume corridors (en route) and lanes (on ground), merging as well as crossing intersections of multiple corridors/lanes. There exists a gamut of approaches to solving merging and intersection crossing problems. At one end of the extreme are the conservative yet low cost and verifiable solutions of today that deal with two drones at a time. At the other end are complex Machine Learning-based solutions with high computing requirements for fully autonomous drones of the future that are expected to handle all contentions. This paper presents a feasible and verifiable strategic approach to solving these problems that is based on distributed cooperation between the UAVs/UASs and the infrastructure. Unlike existing centralized and pre-planned approaches, the proposed solution is fully distributed and enables autonomous aircraft to decide to adjust their speed and distance with respect to the preceding aircraft, dynamically. Three phases of the strategic approach (Prepare, Adjust, Commit) are presented. Simulation results are presented that show the proposed approach is stable and resilient to induced perturbations and guarantees a set of fixed-wing UAVs/UASs to merge and cross intersections by adjusting their speed based on their distance to the aircraft in front of them.

Distributed↗

Comparing Regional Energy Consumption for Direct Drone and Truck Deliveries

Drone delivery, once thought of as fictitious, is becoming a reality with the efforts of both forward-looking enterprises and supportive government policies. This emerging mode of e-commerce delivery raises many concerns. One important concern is the energy efficiency of direct delivery drones compared with conventional delivery trucks at a regional systems level. Here, in this study, we develop and apply methods to quantify the regional energy impacts of drone delivery, then we assess these impacts and compare them with the impacts of truck delivery. To study this problem, we develop an optimization model that determines an optimal set of fulfillment centers (FCs) with variable service capacities that allow drones to make direct e-commerce deliveries. We adopt two drone delivery energy estimation models from the literature and use them as inputs to demonstrate the potential range of energy needs. We also develop another optimization model to account for the energy consumption of diesel trucks (DTs) and battery electric vehicles (BEVs). We test the models using validated simulation data for the Chicago metropolitan area in the U.S. to quantify the energy implications of these three delivery modes. For drone delivery, we further extend our analyses by considering the impact of wind speed and flight patterns. Our results show that direct delivery drones require 15.8% more energy than BEVs on an average windy day, and they need 15% more energy than DTs on a very windy day. We provide essential parameter values for reproducibility and list relevant open problems.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

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↗

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↗

Achieving Equilibrium for Dense, Integrated, Vehicle Navigation

Drone usage has proliferated in recent years with many applications that have market-changing potential. Applications that include parcel delivery, wildlife protection, precision farming, law enforcement, and industrial inspection, just to name a few. In this paper, the term drone is used to mean both Unmanned Aerial Vehicle and small Unmanned Aircraft System vehicles. Flight infrastructure can currently only support a few thousand aircraft flying over the United States National Airspace System (NAS) at any given time. A delay atone airport sends ripple effects through the system, causing more delays and missed connections. Once regulations and safety policies are put in place to allow for the widespread use of unmanned drones, the number of aircraft in the NAS is expected to skyrocket to millions, potentially congesting the airspace resulting in possible separation violations. In air traffic control, separation is the concept of keeping an “ownship” aircraft outside a minimum distance from “intruder” aircraft to reduce the risk of the aircraft colliding, as well as preventing accidents due to secondary factors, such as wake turbulence. Maintaining proper separation is a safety critical property for drones in the airspace. This paper addresses separation in time and in distance for high volume corridors (en-route) and lanes(on ground). The requirements and necessary conditions for maintaining proper separation and reaching maximum throughput for a given corridor/lane are addressed assuming unidirectional corridors/lanes where an aircraft arrives from one side and departs from the opposite side. Simulation results are presented that show the presented solution guarantees a set of drones to reach the equilibrium state by adjusting their speed based on their distance to the aircraft in front of them. The equilibrium state is defined as a state when a set of n aircraft moving at a relatively constant speed and uniform spacing from each other in a congested system. A congested system is defined as a state when the aircraft cannot move at their maximum allowed speed. Unlike existing centralized and pre-planned approaches, the proposed solution is fully distributed and enables autonomous aircraft to decide to adjust their speed and distance with respect to the preceding aircraft, dynamically. Simulation results are presented that assess the feasibility of the approach using a large number of drones and evaluate the scalability of the proposed solution.

Mahyar R. Malekpour↗

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↗

Cybersecurity for Distance Relay Protection

This project is a DOE follow-up effort on the CREDC workshop held on September 13, 2018 in Cambridge, MA to discuss cybersecurity of distance relays, which considered the benefits, vulnerabilities and risk mitigations for the use of communication systems in power system protection. The objectives of this project are to define the taxonomy of relay protection and associated communications; define use cases describing approaches to reduce the cyber-attack surface on those protective relays; and evaluate the loss of operational functional capability from changes to communication coverage. Mitigating controls will also be evaluated to understand if there are other approaches to reduce attack surfaces while maintaining communications or partial communications. Distance relays are used to protect transmission lines of approximately 10 to 300 miles in length, by detecting short circuits (i.e., faults) on the lines and then tripping circuit breakers in the substation. Such protection systems are a subset of the power system and they incorporate sensing, logic and communication functions. Protection system exposure to cyberattack could be drastically limited by disconnecting relays from all vulnerable communication systems, but this may adversely impact overall power system performance in the absence of cyberattack. This project began with a use case analysis of protection systems with communications, as summarized in this report. It continued with modeling, testing and evaluation in a miniature power system (MPS), located in the Western Area Power Administration (WAPA) Electric Power Training Center (EPTC). The project also incorporated feedback from two industry meetings held in February and September 2019. The suggested next steps account for and complement the work already underway with DOE/CESER funding: 1. Study the performance of LCD and PC vs. PUTT, which is less reliant on communication system performance and GPS timing references. The PUTT scheme could prove to be more resilient to cyberattack or communications-related disruption. It could also be more tolerant of message re-routing with SDN/SDR communication systems. On the other hand, it will be more vulnerable to false tripping during dynamic events or to loss of the voltage signal. The optimum choice of scheme may depend on the specific power system and risk assessment. This study could provide a new template for evaluation based on business functions. 2. Research and develop new methods to detect and monitor distributed physical attacks, possibly using drones, video sensors, thermal sensors, machine learning and other advanced techniques. This will help mitigate the impact of cyberattack on the protection system, and will also help mitigate the impact of wild fires. 3. Implement a scalable PKI for use in electric utility protection systems. This will encourage widespread adoption of secure authentication methods that are already available, but not widely used at present. This will help secure engineering access to the relays. 4. Investigate the use of SDN in combination with SDR to achieve better cybersecurity and electromagnetic security of the network, incorporating path variability. This would help secure both engineering access and peer-to-peer GOOSE messaging. 5. Perform additional testing, with operator evaluation of “red button” scenarios, PUTT vs. LCD, relay mis-operations, and other cyberattacks in the EPTC. This is an important advantage of testing in the EPTC rather than by computer simulation or even hardware-in-the-loop simulation; the EPTC is already dedicated to managing the situational awareness, operator response times and other human impacts. One of the project objectives was to settle on a common nomenclature for this problem space. We have concluded that the OSI layer model, supplemented by ANSI device numbers and other IEEE standards, is already well-accepted by the industry. The IEEE PSRC knowledge base provides a great deal of public information

24 POWER TRANSMISSION AND DISTRIBUTION↗