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 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 …

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 …

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 …

Dubins tours represent a solution of the Dubins traveling salesman problem (DTSP) that is a
variant of the optimization routing problem to determine a curvature-constrained shortest …

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 …

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 …

In this paper, we introduce the k-Dubins Traveling Salesman Problem with Neighborhoods
(k-DTSPN), the problem of planning efficient paths among target regions for multiple robots …

In this work we propose an efficient and simple three-stage evolutionary algorithm to tackle
the difficult problem of planning shorter paths through regions of an environment which are …

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 …