This HTML5 document contains 46 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n15http://localhost/temp/predkladatel/
n11http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n5http://linked.opendata.cz/resource/domain/vavai/projekt/
n20http://linked.opendata.cz/resource/domain/vavai/subjekt/
n17http://linked.opendata.cz/ontology/domain/vavai/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
rdfshttp://www.w3.org/2000/01/rdf-schema#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n14http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
n21http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F11%3A00183663%21RIV12-MSM-21230___/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n16http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n4http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F11%3A00183663%21RIV12-MSM-21230___
rdf:type
skos:Concept n17:Vysledek
rdfs:seeAlso
http://www.sciencedirect.com/science/article/pii/S1568494611002158
dcterms:description
Inspection planning is a problem of finding a (closed) shortest path from which a robot %22sees%22 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. Inspection planning is a problem of finding a (closed) shortest path from which a robot %22sees%22 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.
dcterms:title
Inspection Planning in the Polygonal Domain by Self-Organizing Map Inspection Planning in the Polygonal Domain by Self-Organizing Map
skos:prefLabel
Inspection Planning in the Polygonal Domain by Self-Organizing Map Inspection Planning in the Polygonal Domain by Self-Organizing Map
skos:notation
RIV/68407700:21230/11:00183663!RIV12-MSM-21230___
n17:predkladatel
n20:orjk%3A21230
n3:aktivita
n16:P
n3:aktivity
P(1M0567), P(7E08006)
n3:cisloPeriodika
8
n3:dodaniDat
n4:2012
n3:domaciTvurceVysledku
n11:3276155 n11:7341520
n3:druhVysledku
n18:J
n3:duvernostUdaju
n19:S
n3:entitaPredkladatele
n21:predkladatel
n3:idSjednocenehoVysledku
205040
n3:idVysledku
RIV/68407700:21230/11:00183663
n3:jazykVysledku
n9:eng
n3:klicovaSlova
Inspection Planning; Self-Organizing Map (SOM); Traveling Salesman Problem (TSP); Watchman Route Problem (WRP); Multi-Goal Path Planning (MTP)
n3:klicoveSlovo
n7:Inspection%20Planning n7:Multi-Goal%20Path%20Planning%20%28MTP%29 n7:Watchman%20Route%20Problem%20%28WRP%29 n7:Traveling%20Salesman%20Problem%20%28TSP%29 n7:Self-Organizing%20Map%20%28SOM%29
n3:kodStatuVydavatele
NL - Nizozemsko
n3:kontrolniKodProRIV
[5BD5FB4B7875]
n3:nazevZdroje
Applied Soft Computing
n3:obor
n8:JC
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n5:7E08006 n5:1M0567
n3:rokUplatneniVysledku
n4:2011
n3:svazekPeriodika
11
n3:tvurceVysledku
Přeučil, Libor Faigl, Jan
n3:wos
000296539700057
s:issn
1568-4946
s:numberOfPages
14
n14:doi
10.1016/j.asoc.2011.05.055
n15:organizacniJednotka
21230