The Dubins Traveling Salesman Problem with Constrained Collecting Maneuvers

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F16%3A00307184" target="_blank" >RIV/68407700:21230/16:00307184 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.14311/APP.2016.6.0034" target="_blank" >http://dx.doi.org/10.14311/APP.2016.6.0034</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.14311/APP.2016.6.0034" target="_blank" >10.14311/APP.2016.6.0034</a>

Result language
angličtina
Original language name
The Dubins Traveling Salesman Problem with Constrained Collecting Maneuvers
Original language description
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.
Czech name
—
Czech description
—

Project
<a href="/en/project/GA16-24206S" target="_blank" >GA16-24206S: Efficient Information Gathering with Dubins Vehicles in Persistent Monitoring and Surveillance Missions</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)