Next Article in Journal / Special Issue
Computing the Eccentricity Distribution of Large Graphs
Previous Article in Journal / Special Issue
Tractabilities and Intractabilities on Geometric Intersection Graphs
Algorithms 2013, 6(1), 84-99; doi:10.3390/a6010084

Dubins Traveling Salesman Problem with Neighborhoods: A Graph-Based Approach

*  and
Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA 93106-9560, USA
* Author to whom correspondence should be addressed.
Received: 31 October 2012 / Revised: 17 January 2013 / Accepted: 18 January 2013 / Published: 4 February 2013
(This article belongs to the Special Issue Graph Algorithms)
View Full-Text   |   Download PDF [3056 KB, uploaded 4 February 2013]   |  


We study the problem of finding the minimum-length curvature constrained closed path through a set of regions in the plane. This problem is referred to as the Dubins Traveling Salesperson Problem with Neighborhoods (DTSPN). An algorithm is presented that uses sampling to cast this infinite dimensional combinatorial optimization problem as a Generalized Traveling Salesperson Problem (GTSP) with intersecting node sets. The GTSP is then converted to an Asymmetric Traveling Salesperson Problem (ATSP) through a series of graph transformations, thus allowing the use of existing approximation algorithms. This algorithm is shown to perform no worse than the best existing DTSPN algorithm and is shown to perform significantly better when the regions overlap. We report on the application of this algorithm to route an Unmanned Aerial Vehicle (UAV) equipped with a radio to collect data from sparsely deployed ground sensors in a field demonstration of autonomous detection, localization, and verification of multiple acoustic events.
Keywords: traveling salesman problem; graph transformation; nonholonomic vehicles traveling salesman problem; graph transformation; nonholonomic vehicles
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Share & Cite This Article

Further Mendeley | CiteULike
Export to BibTeX |
EndNote |
MDPI and ACS Style

Isaacs, J.T.; Hespanha, J.P. Dubins Traveling Salesman Problem with Neighborhoods: A Graph-Based Approach. Algorithms 2013, 6, 84-99.

View more citation formats

Related Articles

Article Metrics

For more information on the journal, click here


[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert