On the Dubins Traveling Salesman Problem with Neighborhoods

Abstract

In this paper, we address the problem of optimal path planning to visit a set of regions by Dubins vehicle, which is also known as the Dubins Traveling Salesman Problem with Neighborhoods (DTSPN). This problem can be tackled by a transformation to other variants of the TSP or evolutionary algorithms. We address the DTSPN as a problem to find Dubins path to… (More)
DOI: 10.1109/IROS.2015.7353945

8 Figures and Tables

Topics

Statistics

0204020162017
Citations per Year

Citation Velocity: 15

Averaging 15 citations per year over the last 2 years.

Learn more about how we calculate this metric in our FAQ.
  • Presentations referencing similar topics