Noise Aware Path Planning and Power Management of Hybrid Fuel UAVs
Preprint
Abstract
Hybrid fuel Unmanned Aerial Vehicles (UAV), through their combination of multiple energy sources, offer several advantages over the standard single fuel source configuration, the primary one being increased range and efficiency. Multiple power or fuel sources also allow the distinct pitfalls of each source to be mitigated while exploiting the advantages within the mission or path planning. We consider here a UAV equipped with a combustion engine-generator and battery pack as energy sources. We consider the path planning and power-management of this platform in a noise-aware manner. To solve the path planning problem, we first present the Mixed Integer Linear Program (MILP) formulation of the problem. We then present and analyze a label-correcting algorithm, for which a pseudo-polynomial running time is proven. Results of extensive numerical testing are presented which analyze the performance and scalability of the labeling algorithm for various graph structures, problem parameters, and search heuristics. It is shown that the algorithm can solve instances on graphs as large as twenty thousand nodes in only a few seconds.Keywords
All Related Versions
This publication has 34 references indexed in Scilit:
- An exact bidirectional pulse algorithm for the constrained shortest pathNetworks, 2020
- Electric vehicle routing problem with time windows, recharging stations and battery swapping stationsEURO Journal on Transportation and Logistics, 2018
- A simulated annealing heuristic for the hybrid vehicle routing problemApplied Soft Computing, 2017
- The Hybrid Electric Vehicle – Traveling Salesman ProblemEuropean Journal of Operational Research, 2016
- Acceleration strategies for the weight constrained shortest path problem with replenishmentOptimization Letters, 2014
- A survey of resource constrained shortest path problems: Exact solution approachesNetworks, 2013
- On an exact method for the constrained shortest path problemComputers & Operations Research, 2013
- Solving shortest path problems with a weight constraint and replenishment arcsComputers & Operations Research, 2012
- An empirical investigation of some bicriterion shortest path algorithmsEuropean Journal of Operational Research, 1989
- A dual algorithm for the constrained shortest path problemNetworks, 1980