Emergency situation handling dynamic route monthly planning method for security system

Abstract

The invention discloses an emergency situation handling dynamic route monthly planning method for a security system. The method comprises the following steps: obtaining geographical location information and time information, determining all possible paths, determining the concrete roads of every path, determining the traffic time tij of every road, determining the traffic time T1, T2, ..., Tn of every path, and calculating the sum of all the traffic times of the roads of every path i according to the following formula: Ti = ti1 + ti2 + ... + tim; and taking the minimum value Ta from the T1, T2, ..., Tn, and determining the route a as the target route, that is a vehicle selects the path a as the final driving path, and selects a corresponding speed as a driving speed. Newest calculated traffic time data of the front road is especially timely used, so the time selection of the roads is dynamic; and a security service station having a shortest distance to emergency situation point and a corresponding route are found, so the uncertainty of the time of the security vehicle running to a fire scene is greatly reduced.

Description

technical field [0001] The invention relates to the technical field of alarm processing in a security system, in particular to a monthly planning method for a dynamic route of alarm processing in a security system. Background technique [0002] At present, people have higher and higher requirements for the emergency response speed of the police, and the congestion in the central urban areas of cities, especially mega-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, it is basically the nearest security workstation to respond and go to the place where the police situation occurred to deal with the situation. . However, when the security office station in the central urban area goes to the place where the police incident occurred, half of the roads are often congested. In the past, the traf...

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.