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 Occlusion-Aware UAV Path Planning for Reconnaissance and Surveillance

Drones ◽  
2021 ◽  
Vol 5 (3) ◽  
pp. 98
Author(s):  
Jian Zhang ◽  
Hailong Huang
Keyword(s):  
Path Planning ◽  
Unmanned Aerial Vehicles ◽  
Real Time ◽  
Traveling Salesman Problem ◽  
Search And Rescue ◽  
Traveling Salesman ◽  
Complex Environments ◽  
Aerial Vehicles ◽  
Wide Range ◽  
The Traveling Salesman Problem

Unmanned Aerial Vehicles (UAVs) have become necessary tools for a wide range of activities including but not limited to real-time monitoring, surveillance, reconnaissance, border patrol, search and rescue, civilian, scientific and military missions, etc. Their advantage is unprecedented and irreplaceable, especially in environments dangerous to humans, for example, in radiation or pollution-exposed areas. Two path-planning algorithms for reconnaissance and surveillance are proposed in this paper, which ensures every point on the target ground area can be seen at least once in a complete surveillance circle. Moreover, the geometrically complex environments with occlusions are considered in our research. Compared with many existing methods, we decompose this problem into a waypoint-determination problem and an instance of the traveling-salesman problem.

ASIF Approach to Solve the Green Traveling Salesman Problem

2018 ◽  
Vol 9 (1) ◽  
pp. 81-95 ◽  
Author(s):  
Ahmed Haroun Sabry ◽  
Jamal Benhra ◽  
Abdelkabir Bacha
Keyword(s):  
Objective Function ◽  
Ant Colony Optimization ◽  
Present Article ◽  
Traveling Salesman Problem ◽  
Real World ◽  
Transportation Problem ◽  
Problem Formulation ◽  
Traveling Salesman ◽  
Web Based ◽  
The City

The present article describes a contribution to solve transportation problems with green constraints. The aim is to solve an urban traveling salesman problem where the objective function is the total emitted CO2. We start by adapting ASIF approach for calculating CO2 emissions to the urban logistics problem. Then, we solve it using ant colony optimization metaheuristic. The problem formulation and solving will both work under a web-based mapping platform. The selected problem is a real-world NP-hard transportation problem in the city of Casablanca.

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 UNMANNED AERIAL VEHICLE USE FOR WOOD CHIPS PILE VOLUME ESTIMATION

2016 ◽  
Vol XLI-B1 ◽  
pp. 953-956
Author(s):  
M. Mokroš ◽  
M. Tabačák ◽  
M. Lieskovský ◽  
M. Fabrika
Keyword(s):  
Data Collection ◽  
Unmanned Aerial Vehicles ◽  
Unmanned Aerial Vehicle ◽  
Applied Research ◽  
Rapid Development ◽  
Volume Estimation ◽  
Wood Chips ◽  
Aerial Vehicles ◽  
Aerial Vehicle ◽  
Gnss Data

The rapid development of unmanned aerial vehicles is a challenge for applied research. Many technologies are developed and then researcher are looking up for their application in different sectors. Therefore, we decided to verify the use of the unmanned aerial vehicle for wood chips pile monitoring. <br><br> We compared the use of GNSS device and unmanned aerial vehicle for volume estimation of four wood chips piles. We used DJI Phantom 3 Professional with the built-in camera and GNSS device (geoexplorer 6000). We used Agisoft photoscan for processing photos and ArcGIS for processing points. <br><br> Volumes calculated from pictures were not statistically significantly different from amounts calculated from GNSS data and high correlation between them was found (p = 0.9993). We conclude that the use of unmanned aerial vehicle instead of the GNSS device does not lead to significantly different results. Tthe data collection consumed from almost 12 to 20 times less time with the use of UAV. Additionally, UAV provides documentation trough orthomosaic.

scholarly journals On the Traveling Salesman Problem in Nautical Environments: an Evolutionary Computing Approach to Optimization of Tourist Route Paths in Medulin, Croatia

2019 ◽  
Vol 57 (1) ◽  
pp. 71-87 ◽  
Author(s):  
Sandi Baressi Šegota ◽  
Ivan Lorencin ◽  
Kazuhiro Ohkura ◽  
Zlatan Car
Keyword(s):  
Traveling Salesman Problem ◽  
Optimal Path ◽  
Solution Space ◽  
Evolutionary Computing ◽  
Problem Formulation ◽  
Computing Methods ◽  
Traveling Salesman ◽  
Planning Problem ◽  
Extensive Search ◽  
The Traveling Salesman Problem

The Traveling salesman problem (TSP) defines the problem of finding the optimal path between multiple points, connected by paths of a certain cost. This paper applies that problem formulation in the maritime environment, specifically a path planning problem for a tour boat visiting popular tourist locations in Medulin, Croatia. The problem is solved using two evolutionary computing methods – the genetic algorithm (GA) and the simulated annealing (SA) - and comparing the results (are compared) by an extensive search of the solution space. The results show that evolutionary computing algorithms provide comparable results to an extensive search in a shorter amount of time, with SA providing better results of the two.

Sign in / Sign up

Export Citation Format

Share Document