About: Inspection Planning in the Polygonal Domain by Self-Organizing Map

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Inspection Planning in the Polygonal Domain by Self-Organizing Map Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://www.sciencedirect.com/science/article/pii/S1568494611002158
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. (en)
Title	Inspection Planning in the Polygonal Domain by Self-Organizing Map Inspection Planning in the Polygonal Domain by Self-Organizing Map (en)
skos:prefLabel	Inspection Planning in the Polygonal Domain by Self-Organizing Map Inspection Planning in the Polygonal Domain by Self-Organizing Map (en)
skos:notation	RIV/68407700:21230/11:00183663!RIV12-MSM-21230___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(1M0567), P(7E08006)
http://linked.open...iv/cisloPeriodika	8
http://linked.open...vai/riv/dodaniDat	2012
http://linked.open...aciTvurceVysledku	Přeučil, Libor Faigl, Jan
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	205040
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/11:00183663
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Inspection Planning; Self-Organizing Map (SOM); Traveling Salesman Problem (TSP); Watchman Route Problem (WRP); Multi-Goal Path Planning (MTP) (en)
http://linked.open.../riv/klicoveSlovo	Inspection Planning Multi-Goal Path Planning (MTP) Self-Organizing Map (SOM) Traveling Salesman Problem (TSP) Watchman Route Problem (WRP)
http://linked.open...odStatuVydavatele	NL - Nizozemsko
http://linked.open...ontrolniKodProRIV	[5BD5FB4B7875]
http://linked.open...i/riv/nazevZdroje	Applied Soft Computing
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Centre for Applied Cybernetics Robotic Evolutionary Self-Programming and Self-Assembling Organisms
http://linked.open...UplatneniVysledku	2011
http://linked.open...v/svazekPeriodika	11
http://linked.open...iv/tvurceVysledku	Faigl, Jan Přeučil, Libor
http://linked.open...ain/vavai/riv/wos	000296539700057
issn	1568-4946
number of pages	14 (xsd:int)
http://bibframe.org/vocab/doi	10.1016/j.asoc.2011.05.055
http://localhost/t...ganizacniJednotka	21230

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 77 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software