Dubins Orienteering Problem

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Dubins Orienteering Problem

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Dubins Orienteering Problem

Popis výsledku anglicky

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.

Druh

J_ost - Ostatní články v recenzovaných periodicích

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2017

Kód důvěrnosti údajů

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

Název periodika

IEEE Robotics and Automation Letters

ISSN

2377-3766

e-ISSN

2377-3766

Svazek periodika

2

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

8

Strana od-do

1210-1217

Kód UT WoS článku

000413736600109

EID výsledku v databázi Scopus

—