Adescent method for the Dubins traveling salesman problem with neighborhoods

2020 ◽  
Author(s):  
Zheng Chen ◽  
Chen-hao Sun ◽  
Xue-ming Shao ◽  
Wen-jie Zhao
Keyword(s):  
Traveling Salesman Problem ◽  
Traveling Salesman ◽  
Dubins Traveling Salesman Problem

scholarly journals ON SAMPLING BASED METHODS FOR THE DUBINS TRAVELING SALESMAN PROBLEM WITH NEIGHBORHOODS

2015 ◽  
Vol 2 (2) ◽  
pp. 57-61
Author(s):  
Petr Váňa ◽  
Jan Faigl
Keyword(s):  
Path Planning ◽  
Traveling Salesman Problem ◽  
Traveling Salesman ◽  
Computational Time ◽  
Solution Quality ◽  
Goal Region ◽  
Dubins Vehicle ◽  
Proposed Modification ◽  
Dubins Traveling Salesman Problem

In this paper, we address the problem of path planning to visit a set of regions by Dubins vehicle, which is also known as the Dubins Traveling Salesman Problem Neighborhoods (DTSPN). We propose a modification of the existing sampling-based approach to determine increasing number of samples per goal region and thus improve the solution quality if a more computational time is available. The proposed modification of the sampling-based algorithm has been compared with performance of existing approaches for the DTSPN and results of the quality of the found solutions and the required computational time are presented in the paper.

scholarly journals THE DUBINS TRAVELING SALESMAN PROBLEM WITH CONSTRAINED COLLECTING MANEUVERS

2016 ◽  
Vol 6 ◽  
pp. 34
Author(s):  
Petr Váňa ◽  
Jan Faigl
Keyword(s):  
Data Collection ◽  
Unmanned Aerial Vehicles ◽  
Traveling Salesman Problem ◽  
Problem Formulation ◽  
Traveling Salesman ◽  
Line Segments ◽  
Aerial Vehicles ◽  
Straight Line ◽  
Dubins Traveling Salesman Problem

In this paper, we introduce a variant of the Dubins traveling salesman problem (DTSP) that is called the Dubins traveling salesman problem with constrained collecting maneuvers (DTSP-CM). In contrast to the ordinary formulation of the DTSP, in the proposed DTSP-CM, the vehicle is requested to visit each target by specified collecting maneuver to accomplish the mission. The proposed problem formulation is motivated by scenarios with unmanned aerial vehicles where particular maneuvers are necessary for accomplishing the mission, such as object dropping or data collection with sensor sensitive to changes in vehicle heading. We consider existing methods for the DTSP and propose its modifications to use these methods to address a variant of the introduced DTSP-CM, where the collecting maneuvers are constrained to straight line segments.

scholarly journals On Tightly Bounding the Dubins Traveling Salesman's Optimum

2018 ◽  
Vol 140 (7) ◽  
Author(s):  
Satyanarayana G. Manyam ◽  
Sivakumar Rathinam
Keyword(s):  
Lower Bound ◽  
Traveling Salesman Problem ◽  
Optimal Solution ◽  
Traveling Salesman ◽  
Motion Constraints ◽  
Euclidean Traveling Salesman Problem ◽  
Problem Instances ◽  
Feasible Solutions ◽  
The Cost ◽  
Dubins Traveling Salesman Problem

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 problem requires finding a curvature constrained shortest path for a vehicle visiting a set of target locations. Currently, there is no algorithm that can find an optimal solution to the DTSP. In addition, relaxing the motion constraints and solving the resulting Euclidean traveling salesman problem (ETSP) provide the only lower bound available for the DTSP. However, in many problem instances, the lower bound computed by solving the ETSP is far below the cost of the feasible solutions obtained by some well-known algorithms for the DTSP. This paper addresses this fundamental issue and presents the first systematic procedure for developing tight lower bounds for the DTSP.

Sign in / Sign up

Export Citation Format

Share Document