基于巡逻历史与道路优先级的武警巡逻策略

针对武警巡逻车辆配置问题，引入了Dijkstra最短路径算法、K—means聚类算法以及计算几何的相关理论，建立了一套警车巡逻模型，并提出了评价巡逻效果的量化评价标准。采用Dijkstra与K—means算法解决了静态警车配置问题；针对警车动态巡逻方案的设计，提出了基于巡逻历史与道路优先级的道路概率选择算法，并给出了不同情况下的警车配置以及巡逻方案。通过MATLAB仿真实验，证明了算法及模型的先进性和实用性。

Armed Police Patrol Strategy Based on the Patrol Historical and the Road Priority

Considering the issue of the armed police patrol vehicles,we introduce the Dijkstra shortest path algorithm, K-means clustering algorithm as well as the theory of computation- al geometry, and we establish a set of police patrol model,we also propose the quantitative evaluation criteria for the evaluation of patrolling effect. Adopting Dijkstra and K-means al- gorithm we solve the problem of allocating the static police vehicles;In view of the design of dynamic patrol program for the police vehicles,we introduc the road probability selection al- gorithm which is based on the patrol historical and the road priority, and also give the differ- ent police vehicles configuring and patrolling programs according to different circumstances. The MATLAB simulation experiment proves the progressiveness and practicality of the al- gorithm and model.