ON SAMPLING BASED METHODS FOR THE DUBINS TRAVELING SALESMAN PROBLEM WITH NEIGHBORHOODS
DOI:
https://doi.org/10.14311/APP.2015.1.0057Abstract
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.Downloads
Download data is not yet available.
Downloads
Published
2015-12-31
Issue
Section
Articles
How to Cite
ON SAMPLING BASED METHODS FOR THE DUBINS TRAVELING SALESMAN PROBLEM WITH NEIGHBORHOODS. (2015). Acta Polytechnica CTU Proceedings, 2(2), 57-61. https://doi.org/10.14311/APP.2015.1.0057