About: Approximate Solution of the Multiple Watchman Routes Problem With Restricted Visibility Range     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)

AttributesValues
rdf:type
Description
  • In this paper, a new self-organizing map (SOM) based adaptation procedure is proposed to address the Multiple Watchmen Route Problem with the restricted visibility range in the polygonal domain W. A watchman route is represented by a ring of connected neurons weights that evolves in W while obstacles are considered by approximation of the shortest path. The adaptation procedure considers a coverage of W by the ring in order to attract nodes towards uncovered parts of W. The proposed procedure is experimentally verified in a set of environments and several visibility ranges. Performance of the procedure is compared with the decoupled approach based on solutions of the Art Gallery Problem and the consecutive Traveling Salesman Problem. The experimental results show suitability of the proposed procedure based on relatively simple supporting geometrical structures enabling application of SOM principles to watchman route problems in W.
  • In this paper, a new self-organizing map (SOM) based adaptation procedure is proposed to address the Multiple Watchmen Route Problem with the restricted visibility range in the polygonal domain W. A watchman route is represented by a ring of connected neurons weights that evolves in W while obstacles are considered by approximation of the shortest path. The adaptation procedure considers a coverage of W by the ring in order to attract nodes towards uncovered parts of W. The proposed procedure is experimentally verified in a set of environments and several visibility ranges. Performance of the procedure is compared with the decoupled approach based on solutions of the Art Gallery Problem and the consecutive Traveling Salesman Problem. The experimental results show suitability of the proposed procedure based on relatively simple supporting geometrical structures enabling application of SOM principles to watchman route problems in W. (en)
Title
  • Approximate Solution of the Multiple Watchman Routes Problem With Restricted Visibility Range
  • Approximate Solution of the Multiple Watchman Routes Problem With Restricted Visibility Range (en)
skos:prefLabel
  • Approximate Solution of the Multiple Watchman Routes Problem With Restricted Visibility Range
  • Approximate Solution of the Multiple Watchman Routes Problem With Restricted Visibility Range (en)
skos:notation
  • RIV/68407700:21230/10:00171513!RIV11-MSM-21230___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(2C06005)
http://linked.open...iv/cisloPeriodika
  • 10
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 247579
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/10:00171513
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Watchman route problem, Self-organizing maps (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • US - Spojené státy americké
http://linked.open...ontrolniKodProRIV
  • [096735395466]
http://linked.open...i/riv/nazevZdroje
  • IEEE Transactions on Neural Networks
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 21
http://linked.open...iv/tvurceVysledku
  • Faigl, Jan
http://linked.open...ain/vavai/riv/wos
  • 000283369400012
issn
  • 1045-9227
number of pages
http://localhost/t...ganizacniJednotka
  • 21230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software