Alarm processing dynamic path planning method for security system

Abstract

The invention discloses an alarm processing dynamic path planning method for a security system, which comprises the steps that geographical location information and time information are obtained, allpossible 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, the sum of the time of the sections of each path i is calculated, namely, Ti=ti1+ti2+...+tim; 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 asa final driving path of a vehicle, and the corresponding speed is selected to serve as the driving speed. According to the invention, the calculated latest passage time data of the previous section istimely utilized in particular, and dynamic time selection is achieved for the sections; and a security service station capable of arriving at an alarm occurrence point in the shortest time and the corresponding path can be found, and the time uncertainty of a security vehicle for arriving at the scene of a fire can be greatly reduced.

Description

technical field [0001] The invention relates to the technical field of alarm processing in a security system, in particular to a dynamic planning method for an alarm processing route 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 traffic path f...

AI Technical Summary

Problems solved by technology

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 traffic path from the security office station to the police incident place was quickly determined by the security personnel based on personal experience. The security personnel have different experience and different levels of judgment and decision-making, so the efficiency of alarm processing will be greatly affected by the personal factors of the security personnel

It often happens that fire trucks are blocked on the road for more than a quarter of an hour, and the time for dispatching police is greatly increased several times or even dozens of times, causing great hidden dangers to the safety of people's lives and property

[0003] Although some road planning methods and systems have emerged recently, they are all static planning, or do not consider congestion, 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 , set this shortest path as the final security vehicle driving route; even if congestion is considered, the road conditions are simply divided by congestion or non-congestion, and the congested road conditions are simplified, and a uniform vehicle speed is given, while there are so many different congested road conditions in the city The speed of the roads is the same, which is obviously unreasonable. The past traffic data has not been well discovered. In the central urban area of ​​a big city where traffic congestion is normalized, this method of handling police situations needs to be improved urgently.