• Je něco špatně v tomto záznamu ?

Approximate solution of the multiple watchman routes problem with restricted visibility range

J. Faigl

. 2010 ; 21 (10) : 1668-1679. [pub] 20100909

Jazyk angličtina Země Spojené státy americké

Typ dokumentu časopisecké články, práce podpořená grantem

Perzistentní odkaz   https://www.medvik.cz/link/bmc12027359

In this paper, a new self-organizing map (SOM) based adaptation procedure is proposed to address the multiple watchman route problem with the restricted visibility range in the polygonal domain W. A watchman route is represented by a ring of connected neuron 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 toward 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 the suitability of the proposed procedure based on relatively simple supporting geometrical structures, enabling application of the SOM principles to watchman route problems in W.

Citace poskytuje Crossref.org

000      
00000naa a2200000 a 4500
001      
bmc12027359
003      
CZ-PrNML
005      
20160301154805.0
007      
ta
008      
120816s2010 xxu f 000 0#eng||
009      
AR
024    7_
$a 10.1109/tnn.2010.2070518 $2 doi
035    __
$a (PubMed)20837446
040    __
$a ABA008 $b cze $d ABA008 $e AACR2
041    0_
$a eng
044    __
$a xxu
100    1_
$a Faigl, Jan $u Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, Prague 6, Czech Republic. xfaigl@labe.felk.cvut.cz
245    1_
$a Approximate solution of the multiple watchman routes problem with restricted visibility range / $c J. Faigl
520    3_
$a In this paper, a new self-organizing map (SOM) based adaptation procedure is proposed to address the multiple watchman route problem with the restricted visibility range in the polygonal domain W. A watchman route is represented by a ring of connected neuron 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 toward 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 the suitability of the proposed procedure based on relatively simple supporting geometrical structures, enabling application of the SOM principles to watchman route problems in W.
650    _2
$a algoritmy $7 D000465
650    _2
$a počítačová simulace $7 D003198
650    _2
$a mapy jako téma $7 D008377
650    _2
$a neuronové sítě $7 D016571
655    _2
$a časopisecké články $7 D016428
655    _2
$a práce podpořená grantem $7 D013485
773    0_
$w MED00002175 $t IEEE transactions on neural networks a publication of the IEEE Neural Networks Council $x 1941-0093 $g Roč. 21, č. 10 (2010), s. 1668-1679
856    41
$u https://pubmed.ncbi.nlm.nih.gov/20837446 $y Pubmed
910    __
$a ABA008 $b sig $c sign $y m $z 0
990    __
$a 20120816 $b ABA008
991    __
$a 20160301154522 $b ABA008
999    __
$a ok $b bmc $g 949401 $s 784705
BAS    __
$a 3
BAS    __
$a PreBMC
BMC    __
$a 2010 $b 21 $c 10 $d 1668-1679 $e 20100909 $i 1941-0093 $m IEEE transactions on neural networks $n IEEE Trans Neural Netw $x MED00002175
LZP    __
$b NLK112 $a Pubmed-20120816/11/02
Zpět

Najít záznam

Citační ukazatele

Možnosti archivace