摘要
文章研究了如何在街区安装摄像头的问题,在得出结点和街道的观测矩阵,根据每条街道都必须被观测到这个要求,将观测到与否分别设为0、1,运用0-1规划,依据摄像头最少的原则建立数学模型。最后通过L ingo9.0编程得以求解。
This article is a study of how to block the installation of cameras, in this paper can make a calculation of how to block the camera at least the optimal method of installation. First of all, come to the streets of the nodes and observation matrix, and then based on each street must be observed that this request will be observed were set to 0, 1 or not, so 0 - 1 will be able to use planning, at least based on the camera The establishment of the principle of mathematical models. Finally, Lingo9.0 to solve the programming.
出处
《徐州教育学院学报》
2008年第3期195-198,共4页
Journal of Xuzhou Education College
基金
徐州工程学院教研项目(YDJ0756)
徐州工程学院校科研项目(XKY200620)
2008年大学生实践创新训练计划项目(校级)
关键词
0-1规划
摄像头
观测矩阵
Planning 0 - 1
Camera
The observation matrix