Dubins Orienteering Problem with Neighborhoods

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F17%3A00312670" target="_blank" >RIV/68407700:21230/17:00312670 - isvavai.cz</a>

Result on the web

<a href="http://ieeexplore.ieee.org/document/7991350/" target="_blank" >http://ieeexplore.ieee.org/document/7991350/</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/ICUAS.2017.7991350" target="_blank" >10.1109/ICUAS.2017.7991350</a>

Result language

angličtina

Original language name

Dubins Orienteering Problem with Neighborhoods

Original language description

In this paper, we address the Dubins Orienteering Problem with Neighborhoods (DOPN) a novel problem derived from the regular Orienteering Problem (OP). In the OP, one tries to find a maximal reward collecting path through a subset of given target locations, each with associated reward, such that the resulting path length does not exceed the specified travel budget. The Dubins Orienteering Problem (DOP) requires the reward collecting path to satisfy the curvature-constrained model of the Dubins vehicle while reaching precise positions of the target locations. In the newly introduced DOPN, the resulting path also respects the curvature constrained Dubins vehicle as in the DOP; however, the reward can be collected within a close distant neighborhood of the target locations. The studied problem is inspired by data collection scenarios for an Unmanned Aerial Vehicle (UAV), that can be modeled as the Dubins vehicle. Furthermore, the DOPN is a useful problem formulation of data collection scenarios for a UAV with the limited travel budget due to battery discharge and in scenarios where the sensoric data can be collected from a proximity of each target location. The proposed solution of the DOPN is based on the Variable Neighborhood Search method, and the presented computational results in the OP benchmarks support feasibility of the proposed approach.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

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

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)

Publication year

2017

Confidentiality

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

Article name in the collection

Proceedings of 2017 International Conference on Unmanned Aircraft Systems (ICUAS)

ISBN

978-1-5090-4494-8

ISSN

—

e-ISSN

—

Number of pages

8

Pages from-to

1555-1562

Publisher name

IEEE

Place of publication

—

Event location

Miami

Event date

Jun 13, 2017

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000425255200193