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 …

This paper investigates the problem where a fixed-winged unmanned aerial vehicle is
required to find the shortest flyable path to traverse over multiple targets. The unmanned …

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 …

A new class of discretization-based look-ahead algorithms (DLAAs) for the Dubins traveling
salesperson problem (DTSP) is presented that compares favorably with the existing …

In this paper we deal with the DTSP, which is the optimization problem where a path that
goes through a set of two-dimensional points must be calculated considering the use of …

The curvature-constrained traveling salesman problem with obstacles deals with finding a
minimum length tour which includes a set of landmarks and avoids obstacles, for a …

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 …

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 …

We describe an edge based ejection chain method to generate compound neighborhood
structures for the Traveling Salesman Problem (TSP). These neighborhood structures …