Inspection Planning in the Polygonal Domain by Self-Organizing Map
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F11%3A00183663" target="_blank" >RIV/68407700:21230/11:00183663 - isvavai.cz</a>
Result on the web
<a href="http://www.sciencedirect.com/science/article/pii/S1568494611002158" target="_blank" >http://www.sciencedirect.com/science/article/pii/S1568494611002158</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.asoc.2011.05.055" target="_blank" >10.1016/j.asoc.2011.05.055</a>
Alternative languages
Result language
angličtina
Original language name
Inspection Planning in the Polygonal Domain by Self-Organizing Map
Original language description
Inspection planning is a problem of finding a (closed) shortest path from which a robot "sees" the whole workspace. The problem is closely related to the Traveling Salesman Problem (TSP) if the discrete sensing is performed only at the finite number of sensing locations. For the continuous sensing, the problem can be formulated as the Watchman Route Problem (WRP), which is known to be NP-hard for the polygonal representation of the robot workspace. Although several Self-Organizing Map (SOM) approaches have been proposed for the TSP, they are strictly focused to the Euclidean TSP, which is not the case of the inspection path planning in the polygonal domain. In this paper, a novel SOM adaptation schema is proposed to address both variants of the inspection planning with discrete and continuous sensing in the polygonal domain. The schema is compared with the state of the art SOM schema for the TSP in a set of multi-goal path planning problems and WRPs.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
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
2011
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
Applied Soft Computing
ISSN
1568-4946
e-ISSN
—
Volume of the periodical
11
Issue of the periodical within the volume
8
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
14
Pages from-to
5028-5041
UT code for WoS article
000296539700057
EID of the result in the Scopus database
—