skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Algorithms for Heterogeneous, Multiple Depot, Multiple Unmanned Vehicle Path Planning Problems

Journal Article · · Journal of Intelligent & Robotic Systems
ORCiD logo [1];  [2]
  1. Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
  2. Texas A & M Univ., College Station, TX (United States)

Unmanned vehicles, both aerial and ground, are being used in several monitoring applications to collect data from a set of targets. This article addresses a problem where a group of heterogeneous aerial or ground vehicles with different motion constraints located at distinct depots visit a set of targets. The vehicles also may be equipped with different sensors, and therefore, a target may not be visited by any vehicle. The objective is to find an optimal path for each vehicle starting and ending at its respective depot such that each target is visited at least once by some vehicle, the vehicle–target constraints are satisfied, and the sum of the length of the paths for all the vehicles is minimized. Two variants of this problem are formulated (one for ground vehicles and another for aerial vehicles) as mixed-integer linear programs and a branchand- cut algorithm is developed to compute an optimal solution to each of the variants. Computational results show that optimal solutions for problems involving 100 targets and 5 vehicles can be obtained within 300 seconds on average, further corroborating the effectiveness of the proposed approach.

Research Organization:
Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
Sponsoring Organization:
USDOE
Grant/Contract Number:
AC52-06NA25396
OSTI ID:
1345942
Report Number(s):
LA-UR-16-26700
Journal Information:
Journal of Intelligent & Robotic Systems, Vol. 88, Issue 2-4; ISSN 0921-0296
Publisher:
SpringerCopyright Statement
Country of Publication:
United States
Language:
English
Citation Metrics:
Cited by: 27 works
Citation information provided by
Web of Science

References (29)

An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems journal October 1986
Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems journal August 1988
A heuristic column generation method for the heterogeneous fleet VRP journal January 1999
A unified exact method for solving different classes of vehicle routing problems journal April 2008
Multi-depot Multiple TSP: a polyhedral study and computational results journal November 2011
Generalized multiple depot traveling salesmen problem—Polyhedral study and exact algorithm journal June 2016
Integer linear programming formulations of multiple salesman problems and its variations journal November 2006
Motion planning for multitarget surveillance with mobile sensor agents journal October 2005
Branching rules revisited journal January 2005
Formulations and algorithms for the multiple depot, fuel-constrained, multiple vehicle routing problem conference July 2016
Applications of Aerosondes in the Arctic journal December 2004
Traveling Salesperson Problems for the Dubins Vehicle journal July 2008
An exact algorithm for a heterogeneous, multiple depot, multiple traveling salesman problem conference June 2015
On the Dubins Traveling Salesman Problem journal January 2012
Networking Issues for Small Unmanned Aircraft Systems journal July 2008
The multiple traveling salesman problem: an overview of formulations and solution procedures journal June 2006
On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents journal July 1957
The Ring Star Problem: Polyhedral analysis and exact algorithm journal March 2004
A Resource Allocation Algorithm for Multivehicle Systems With Nonholonomic Constraints journal January 2007
TSPLIB—A Traveling Salesman Problem Library journal November 1991
A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem journal June 1997
Computation of Lower Bounds for a Multiple Depot, Multiple Vehicle Routing Problem With Motion Constraints
  • Manyam, Satyanarayana G.; Rathinam, Sivakumar; Darbha, Swaroop
  • Journal of Dynamic Systems, Measurement, and Control, Vol. 137, Issue 9 https://doi.org/10.1115/1.4030354
journal September 2015
Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem journal February 2011
Odd Minimum Cut-Sets and b -Matchings journal February 1982
Optimal paths for a car that goes both forwards and backwards journal January 1990
The vehicle routing problem journal January 1976
Heuristics for Routing Heterogeneous Unmanned Vehicles with Fuel Constraints journal January 2014
Computation of lower bounds for a multiple depot, multiple vehicle routing problem with motion constraints
  • Manyam, Satyanarayana G.; Rathinam, Sivakumar; Darbha, Swaroop
  • 2013 IEEE 52nd Annual Conference on Decision and Control (CDC), 52nd IEEE Conference on Decision and Control https://doi.org/10.1109/cdc.2013.6760236
conference December 2013
Formulations and algorithms for the multiple depot, fuel-constrained, multiple vehicle routing problem preprint January 2015

Cited By (2)