Research On Dynamic Containment Algorithm Of Target Vehicle

While motor vehicles bring great convenience to the public,they are often used by criminals as a means of escape after crime.The rapid mobility of motor vehicles has brought great difficulties to the police's arrest,and the cost of arrest is very high.Therefore,with the help of video,bayonet and other information in the context of intelligent transportation,it is a very important application scenario in the field of public security to quickly form a less expensive escape vehicle containment scheme.In this paper,the convex hull theory and graph matching theory are used to study the minimum cost dynamic containment problem of escaped vehicles,and the following three algorithms are designed and implemented: First,a fast convex hull blockade intersection generation algorithm is applied to the traditional convex hull algorithm.Improve the defects in the traffic jam problem,reduce the size of the block set,and form a block set with fewer nodes,saving the police resources;the second is the block intersection update algorithm,based on the road network topology characteristics and the initial escaped vehicles The location of the set of blocked intersections is checked for constraints to ensure that the set of blocked intersections can form an absolute enclosure;the third is the police scheduling algorithm,which transforms the police scheduling problem into a weighted bipartite graph matching problem,and uses the Kuhn-Munkre graph matching algorithm to give the minimum cost The vehicle confinement plan,and dynamically adjust the set of blocked intersections according to the vehicle's spacetime information.Given the topology of the road network,the distribution of police force,and the most recent spatiotemporal information of the escaped vehicle,it is possible to quickly obtain a less expensive containment plan and give specific police scheduling suggestions,while dynamically adjusting according to the passage of time Containment plan.On the basis of algorithm research,the WebGis platform based on the Gaode Map API was built to implement a visual decision support system that assists the police in quickly confining escaped vehicles.Through test experiments,the effectiveness of the algorithm is proved,and the performance of the existing containment algorithm is analyzed and compared.It is proved that the proposed target vehicle dynamic containment algorithm can give a less expensive deployment of police force in a relatively short time.,With high application value.