| 基于快速凸包的目标车辆动态围堵算法 |
| |
| 引用本文： | 赵弘杨,王靖亚.基于快速凸包的目标车辆动态围堵算法[J].科学技术与工程,2020,20(2):687-693. |
| |
| 作者姓名： | 赵弘杨 王靖亚 |
| |
| 作者单位： | 中国人民公安大学信息技术与网络安全与学院,北京100038;中国人民公安大学信息技术与网络安全与学院,北京100038 |
| |
| 基金项目： | 基于PGIS的三维场景快速构建及应急处突应用技术研究 |
| |
| 摘 要： | 为了以最小代价快速抓捕逃逸的目标车辆,利用凸包和图论的方法研究了目标车辆的动态围堵问题。对传统凸包算法进行改进,基于快速凸包算法形成了节点数最少的完全包围圈;将警力调度问题转化为加权二分图匹配问题,并求出耗时最少的警力调度结果,最后形成具体的围堵方案。改进后的快速凸包算法结合警力调度算法能在相对较短时间内对逃逸车辆完成围堵。
|
| 关 键 词： | 快速凸包算法 图匹配 最小闭环 动态围堵 |
| 收稿时间： | 2019/5/28 0:00:00 |
| 修稿时间： | 2019/7/30 0:00:00 |
Research on Dynamic Containment of Target Vehicle based on Convex Hull Algorithm |
| |
| Zhao HongYang,Wang Jingya.Research on Dynamic Containment of Target Vehicle based on Convex Hull Algorithm[J].Science Technology and Engineering,2020,20(2):687-693. |
| |
| Authors: | Zhao HongYang Wang Jingya |
| |
| Abstract: | In order to catch the escaping vehicle quickly with minimum cost, the dynamic containment problem of the target vehicle is studied by using convex hull and graph theory. The police scheduling problem is transformed into a weighted bipartite graph matching problem, and the result of police scheduling with the least time is obtained. Finally, a specific containment scheme is formed, and the improved fast convex hull algorithm combined with the police scheduling algorithm can complete the containment of the escaping vehicles in a relatively short time |
| |
| Keywords: | quick hull Algorithm graph matching the minimum closed loop dynamic containment |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《科学技术与工程》浏览原始摘要信息 |
| 点击此处可从《科学技术与工程》下载免费的PDF全文 |
