Self-organizing map for orienteering problem with dubins vehicle

Kód výsledku v IS VaVaI

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

Výsledek na webu

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

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Self-organizing map for orienteering problem with dubins vehicle

Popis výsledku v původním jazyce

This paper reports on the application of the self-organizing map (SOM) to solve a novel generalization of the Orienteering Problem (OP) for curvature-constrained vehicles that is called the Dubins Orienteering Problem (DOP). Having a set of target locations, each with associated reward, and a given travel budget, the problem is to find the most valuable curvature-constrained path connecting the target locations such that the path does not exceed the travel budget. The proposed approach is based on two existing SOM-based approaches to solving the OP and Dubins Traveling Salesman Problem (Dubins TSP) that are further generalized to provide a solution of the more computational challenging DOP. DOP combines challenges of the combinatorial optimization of the OP and TSP to determine a subset of the most valuable targets and the optimal sequence of the waypoints to collect rewards of the targets together with the continuous optimization of determining headings of Dubins vehicle at the waypoints such that the total length of the curvature-constrained path is shorter than the given travel budget and the total sum of the collected rewards is maximized.

Název v anglickém jazyce

Self-organizing map for orienteering problem with dubins vehicle

Popis výsledku anglicky

This paper reports on the application of the self-organizing map (SOM) to solve a novel generalization of the Orienteering Problem (OP) for curvature-constrained vehicles that is called the Dubins Orienteering Problem (DOP). Having a set of target locations, each with associated reward, and a given travel budget, the problem is to find the most valuable curvature-constrained path connecting the target locations such that the path does not exceed the travel budget. The proposed approach is based on two existing SOM-based approaches to solving the OP and Dubins Traveling Salesman Problem (Dubins TSP) that are further generalized to provide a solution of the more computational challenging DOP. DOP combines challenges of the combinatorial optimization of the OP and TSP to determine a subset of the most valuable targets and the optimal sequence of the waypoints to collect rewards of the targets together with the continuous optimization of determining headings of Dubins vehicle at the waypoints such that the total length of the curvature-constrained path is shorter than the given travel budget and the total sum of the collected rewards is maximized.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

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

Projekt

<a href="/cs/project/GA16-24206S" target="_blank" >GA16-24206S: Metody informatického plánování cest pro neholonomní mobilní roboty v úlohách monitorování a dohledu</a><br>

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 statě ve sborníku

2017 12th International Workshop on Self-Organizing Maps and Learning Vector Quantization, Clustering and Data Visualization (WSOM)

ISBN

978-1-5090-6638-4

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

125-132

Název nakladatele

IEEE

Místo vydání

Marseille

Místo konání akce

Nancy

Datum konání akce

28. 6. 2017

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000426979300018