About: Visiting Convex Regions in a Polygonal Map

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

About: Visiting Convex Regions in a Polygonal 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/S0921889012001455
Description	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 on a 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 visibility range. The proposed SOM based algorithms provide a unified approach to solve various visibility based routing problems in polygonal maps while they provide a competitive quality of solutions to the reference algorithm with significantly lower computational requirements. 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 on a 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 visibility range. The proposed SOM based algorithms provide a unified approach to solve various visibility based routing problems in polygonal maps while they provide a competitive quality of solutions to the reference algorithm with significantly lower computational requirements. (en)
Title	Visiting Convex Regions in a Polygonal Map Visiting Convex Regions in a Polygonal Map (en)
skos:prefLabel	Visiting Convex Regions in a Polygonal Map Visiting Convex Regions in a Polygonal Map (en)
skos:notation	RIV/68407700:21230/13:00205385!RIV14-MSM-21230___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(7E08006), P(7E11017), P(LH11053)
http://linked.open...iv/cisloPeriodika	10
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Vonásek, Vojtěch 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	114178
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/13:00205385
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Inspection planning; Multi-goal path planning; Self-organizing map; Safari route problem; Traveling salesman problem; Watchman route problem; Touring polygons problem; Polygonal domain (en)
http://linked.open.../riv/klicoveSlovo	Traveling salesman problem Inspection planning Polygonal domain Safari route problem Touring polygons problem Watchman route problem Multi-goal path planning Self-organizing map
http://linked.open...odStatuVydavatele	NL - Nizozemsko
http://linked.open...ontrolniKodProRIV	[6B325011B2E7]
http://linked.open...i/riv/nazevZdroje	Robotics and Autonomous Systems
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Symbiotic Evolutionary Robot Organisms Robotic Evolutionary Self-Programming and Self-Assembling Organisms Control and Localization for Swarms of Low-cost Autonomous Robots
http://linked.open...UplatneniVysledku	2013
http://linked.open...v/svazekPeriodika	61
http://linked.open...iv/tvurceVysledku	Faigl, Jan Přeučil, Libor Vonásek, Vojtěch
http://linked.open...ain/vavai/riv/wos	000325196600004
issn	0921-8890
number of pages	14 (xsd:int)
http://bibframe.org/vocab/doi	10.1016/j.robot.2012.08.013
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