Visiting Convex Regions in a Polygonal Map

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F13%3A00205385" target="_blank" >RIV/68407700:21230/13:00205385 - isvavai.cz</a>

Výsledek na webu

<a href="http://www.sciencedirect.com/science/article/pii/S0921889012001455" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0921889012001455</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.robot.2012.08.013" target="_blank" >10.1016/j.robot.2012.08.013</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Visiting Convex Regions in a Polygonal Map

Popis výsledku v původním jazyce

This paper is concerned with a variant of the multi-goal path planning in which goals are represented as convex polygons. The problem is to find a closed shortest path in a polygonal map such that all goals are visited. The proposed solution is based ona self-organizing map (SOM) algorithm for the traveling salesman problem. Neurons? weights are considered as nodes inside the polygonal domain and connected nodes represent a path that evolves according to the proposed adaptation rules. In addition, a reference algorithm based on the solution of the traveling salesman problem and the consecutive touring polygons problem is provided to find high quality solutions of the created set of problems. The problems are designed to represent various inspection and patrolling tasks and can form a kind of benchmark set for multi-goal path planning algorithms. The performance of the algorithms is examined in this problem set, which includes an instance of the watchman route problem with restricted v

Název v anglickém jazyce

Visiting Convex Regions in a Polygonal Map

Popis výsledku anglicky

This paper is concerned with a variant of the multi-goal path planning in which goals are represented as convex polygons. The problem is to find a closed shortest path in a polygonal map such that all goals are visited. The proposed solution is based ona self-organizing map (SOM) algorithm for the traveling salesman problem. Neurons? weights are considered as nodes inside the polygonal domain and connected nodes represent a path that evolves according to the proposed adaptation rules. In addition, a reference algorithm based on the solution of the traveling salesman problem and the consecutive touring polygons problem is provided to find high quality solutions of the created set of problems. The problems are designed to represent various inspection and patrolling tasks and can form a kind of benchmark set for multi-goal path planning algorithms. The performance of the algorithms is examined in this problem set, which includes an instance of the watchman route problem with restricted v

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

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í

2013

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

Robotics and Autonomous Systems

ISSN

0921-8890

e-ISSN

—

Svazek periodika

61

Číslo periodika v rámci svazku

10

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

14

Strana od-do

1070-1083

Kód UT WoS článku

000325196600004

EID výsledku v databázi Scopus

—