Dubins Orienteering Problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F17%3A00307255" target="_blank" >RIV/68407700:21230/17:00307255 - isvavai.cz</a>
Result on the web
<a href="http://ieeexplore.ieee.org/document/7847413/" target="_blank" >http://ieeexplore.ieee.org/document/7847413/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/LRA.2017.2666261" target="_blank" >10.1109/LRA.2017.2666261</a>
Alternative languages
Result language
angličtina
Original language name
Dubins Orienteering Problem
Original language description
In this paper, we address the Orienteering Problem (OP) for curvature constrained vehicle. For a given set of target locations, each with associated reward, the OP stands to find a tour from a prescribed starting location to a given ending location such that it maximizes collected rewards while the tour length is within a given travel budget constraint. The addressed generalization of the Euclidean OP is called the Dubins Orienteering Problem (DOP) in which the reward collecting tour has to satisfy the limited turning radius of the Dubins vehicle. The DOP consists not only of selecting the most valuable targets and determination of the optimal sequence to visit them, but it also involves the determination of the vehicle’s heading angle at each target location. The proposed solution is based on the Variable neighborhood search technique, and its feasibility is supported by an empirical evaluation in existing OP benchmarks. Moreover, an experimental verification in a real practical scenario further demonstrates the necessity of the proposed direct solution of the Dubins Orienteering Problem.
Czech name
—
Czech description
—
Classification
Type
J<sub>ost</sub> - Miscellaneous article in a specialist periodical
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
IEEE Robotics and Automation Letters
ISSN
2377-3766
e-ISSN
2377-3766
Volume of the periodical
2
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
8
Pages from-to
1210-1217
UT code for WoS article
000413736600109
EID of the result in the Scopus database
—