The Dubins traveling salesman problem (DTSP) has generated significant interest over the
last decade due to its occurrence in several civil and military surveillance applications. This …

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 …

In this study, we focus mainly on the problem of finding the minimum-length path through a
set of circular regions by a fixed-wing unmanned aerial vehicle. Such a problem is referred …

We introduce an extension of the Dubins Traveling Salesman Problem with Neighborhoods
into the 3D space in which a fixed-wing aerial vehicle is requested to visit a set of target …

Abstract The 3-Point Dubins Problem (3PDP) consists of steering a Dubins vehicle through
three consecutive points with prescribed heading orientations at initial and final points so …

The problem of finding a shortest curvature-constrained closed path through a set of targets
in the plane is known as Dubins traveling salesman problem (DTSP). Applications of the …

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 …

We study the traveling salesman problem for a Dubins vehicle. We prove that this problem is
NP-hard, and provide lower bounds on the approximation ratio achievable by some recently …

The Dubins traveling salesman problem (DTSP) combines the combinatorial optimization of
the optimal sequence of waypoints to visit the required target locations with the continuous …

In this paper we study the length of optimal paths for Dubins' vehicle, ie, a vehicle
constrained to move forward along paths of bounded curvature. First, we obtain an upper …