Alarm processing dynamic path half-quarter planning method for security system

Abstract

The invention discloses an alarm processing dynamic path half-quarter planning method for a security system, which comprises the steps that geographical location information and time information are obtained, all possible paths are determined, specific sections of each path are determined, the time tij of each section is determined, the time T1, T2,..., Tn of each path is determined, that is, thesum of the time of the sections of each path i is calculated, namely, Ti=ti1+ti2+...+tim; and a minimum value Ta of the time T1, T2,..., Tn is taken so as to obtain a target path a, the path a is selected to serve as a final driving path of a vehicle, and the corresponding speed is selected to serve as the driving speed. According to the invention, the previous traffic data is mined and utilized,different road passage speeds of different sections are provided, the corresponding fastest path and speed from a departure place to the destination are found, and the security vehicle is ensured to arrive at the destination in the shortest time.

Description

Technical field [0001] The invention relates to the technical field of police information processing in a security system, in particular to a dynamic planning method for the police information processing route of the security system. Background technique [0002] At present, people's requirements for the speed of police emergency response are getting higher and higher, and the congestion in the central areas of cities, especially large cities such as Shanghai and Beijing, is extremely serious. For the handling of police situations, most of the existing security systems set up multiple security office stations in certain areas of the city. When a police situation occurs, the nearest security workstation is basically to respond and go to the place where the police situation occurs. . However, when the security office station in the central city reaches the location where the police situation occurs, half of the road section is often congested. In the past, the traffic path from th...

AI Technical Summary

Problems solved by technology

When doing static planning, congestion is often not considered, just find the nearest security office station where the police situation occurs, and then find the shortest path between the nearest security office station and the police situation location, and set this shortest path as the final security vehicle driving route ; Even if congestion is considered, road conditions are simply divided by congestion or non-congestion, and a unified vehicle speed is given for congested road conditions. However, the speed of so many roads with different congested road conditions in the city is actually the same, which is obviously unreasonable and impossible. It is a good way to mine past traffic data. In the central urban areas of big cities where traffic congestion is normalized, this method of handling police situations needs to be improved urgently.