Routing Problem for Unmanned Aerial Vehicle Patrolling Missions - A Progressive Hedging Algorithm
- Texas A & M Univ., College Station, TX (United States)
- Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
This paper presents a two-stage stochastic program to model a routing problem involving an Unmanned Aerial Vehicle (UAV) in the context of patrolling missions. In particular, given a set of targets and a set of supplemental targets corresponding to each target, the first stage decisions involve finding the sequence in which the vehicle has to visit the set of targets. Upon reaching each target, the UAV collects information and if the operator of the UAV deems that the information collected is not of sufficient fidelity, then the UAV has to visit all the supplemental targets corresponding to that target to collect additional information before proceeding to visit the next target. The problem is solved using a progressive hedging algorithm and extensive computational results corroborating the effectiveness of the proposed model and the solution methodology is presented.
- Research Organization:
- Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
- Sponsoring Organization:
- USDOE Laboratory Directed Research and Development (LDRD) Program
- Grant/Contract Number:
- 89233218CNA000001; AC52-06NA25396
- OSTI ID:
- 1845258
- Report Number(s):
- LA-UR-21-24769
- Journal Information:
- Computers and Operations Research, Vol. 142; ISSN 0305-0548
- Publisher:
- ElsevierCopyright Statement
- Country of Publication:
- United States
- Language:
- English
Similar Records
Cooperative Routing for an Air–Ground Vehicle Team—Exact Algorithm, Transformation Method, and Heuristics
Algorithms for Heterogeneous, Multiple Depot, Multiple Unmanned Vehicle Path Planning Problems