CAJ | 학술논문

规划了摄像头的移动路径，快速轮询所需要监控区域的热点，从而提高监控的有效性和安全性。定义一个最短轮询监控点的问题，证明该问题是 NP？难的。设计了基于“视距蚂蚁”的蚁群算法，通过大量模拟实验证明：设计的算法是有效的，可以在近似最短距离的路径轮询到所有监控点。
규화료섭상두적이동로경，쾌속륜순소수요감공구역적열점，종이제고감공적유효성화안전성。정의일개최단륜순감공점적문제，증명해문제시 NP？난적。설계료기우“시거마의”적의군산법，통과대량모의실험증명：설계적산법시유효적，가이재근사최단거리적로경륜순도소유감공점。
Mobile cameras can raise the visual field to a great extent.This paper focuses on how to plan the movement path of the cameras so as to quickly visit the hot spots of the area to be monitored.The shortest route for the cameras is designed in order to improve the effectiveness and security.This paper defines a shortest polling monitoring point prob-lem,which is proved to be NP?Hard.Finally,an ant colony optimization algorithm based on the stadia of ant is designed. Extensive simulation results validate the efficiency of the algorithm proposed.All of the monitoring point can be visited in almost the shortest distance.