Faigl Jan
Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, Prague 6, Czech Republic.
IEEE Trans Neural Netw. 2010 Oct;21(10):1668-79. doi: 10.1109/TNN.2010.2070518. Epub 2010 Sep 9.
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.
本文提出了一种基于新的自组织映射（SOM）的自适应程序，以解决多边形区域W中具有受限可视范围的多警卫路线问题。警卫路线由在W中演化的连接神经元权重环表示，而障碍物则通过最短路径近似来考虑。自适应程序考虑环对W的覆盖，以便将节点吸引到W的未覆盖部分。所提出的程序在一组环境和几个可视范围内进行了实验验证。该程序的性能与基于美术馆问题和连续旅行商问题解决方案的解耦方法进行了比较。实验结果表明，基于相对简单的支持几何结构，所提出的程序是适用的，这使得SOM原理能够应用于W中的警卫路线问题。
