CN108305491A - A kind of safety-protection system alert processing dynamic route planning system and method - Google Patents

A kind of safety-protection system alert processing dynamic route planning system and method Download PDF

Info

Publication number
CN108305491A
CN108305491A CN201711484965.2A CN201711484965A CN108305491A CN 108305491 A CN108305491 A CN 108305491A CN 201711484965 A CN201711484965 A CN 201711484965A CN 108305491 A CN108305491 A CN 108305491A
Authority
CN
China
Prior art keywords
section
route
time
alert
security protection
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201711484965.2A
Other languages
Chinese (zh)
Inventor
吴绮筠
其他发明人请求不公开姓名
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Dongguan Equity Exchange Center
Original Assignee
Dongguan Equity Exchange Center
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Dongguan Equity Exchange Center filed Critical Dongguan Equity Exchange Center
Priority to CN201711484965.2A priority Critical patent/CN108305491A/en
Publication of CN108305491A publication Critical patent/CN108305491A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G08SIGNALLING
    • G08GTRAFFIC CONTROL SYSTEMS
    • G08G1/00Traffic control systems for road vehicles
    • G08G1/09Arrangements for giving variable traffic instructions
    • G08G1/0962Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
    • G08G1/0968Systems involving transmission of navigation instructions to the vehicle
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34Route searching; Route guidance
    • G01C21/3453Special cost functions, i.e. other than distance or default speed limit of road segments
    • G01C21/3492Special cost functions, i.e. other than distance or default speed limit of road segments employing speed data or traffic data, e.g. real-time or historical
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047Optimisation of routes or paths, e.g. travelling salesman problem

Landscapes

  • Engineering & Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Human Resources & Organizations (AREA)
  • Automation & Control Theory (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Game Theory and Decision Science (AREA)
  • Development Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Traffic Control Systems (AREA)

Abstract

The invention discloses a kind of safety-protection system alert processing dynamic route planning system and method, the wherein normal distribution model of section congestion, to specific section, time information is determined, road section length s, preceding 60 days average speed, the time takes μ=(t1+t2+t3+…+t60)/60;σ2=(t1 2 +t2 2+t3 2+…+t60 2)/60‑μ2, remember that the time X by section, X Normal Distributions are denoted as:X∼N(μ,σ2), obtain specific the formula of probability density function;Find out t0So that P(x<=t0)=0.7, t0As in c d points, the time required to the complete section of motor line;+ 3 σ of μ are the maximum duration needed for the complete section of motor line.The present invention finds alert and point time shortest security protection service station and respective routes occurs, can greatly reduce security protection vehicle to the time of fire scene uncertainty, it can determine the maximum duration needed for the complete section of motor line, ensure that security protection vehicle can reach alert scene, timely processing alert.

Description

A kind of safety-protection system alert processing dynamic route planning system and method
Technical field
The present invention relates to the technical fields handled alert in safety-protection system, at a kind of safety-protection system alert Manage dynamic route planning system and method.
Background technology
Currently, requirement of the people to alert emergency reaction speed is higher and higher, and city especially megapolis is as above Sea, the congestion of Pekinese inner city are extremely serious.Especially in rush hour, the running time of security protection vehicle is because most probably Serious and extensive congestion and be unable to control.Processing for alert, existing safety-protection system are some regions in city mostly Interior setting multiple security protection offices station, away from its nearest security protection work station response, goes to alert spot to dispose when alert occurs Alert.The previous pass by security protection office station to alert spot, it is all fast according to personal experience by security personnel individual Speed show that, since the experience of security personnel is different and judges that level of decision-making differs, the treatment effeciency of alert can be by security protection The individual factor of personnel substantially influences.It occur frequently that fire fighting truck gets lodged in road, the responding time greatly improves several times or even dozens of times The case where, cause great hidden danger to the security of the lives and property of the common people.
Although also there is the method and system of some roadings recently, all it is static programming or does not consider to gather around It is stifled, simply look up alert and point nearest security protection office station occur, then find out nearest security protection office station to alert point occurs between most This shortest path is set to final security protection vehicle traffic route by short path;Even if considering congestion, also simply drawn with congestion or not Branch condition, and congestion road conditions are simplified, provide unified vehicle pass-through speed.Obviously not reasonable.
Many chance phenomena can be described with normal distribution or approximate description, when observation is enough, great Liang Sui Machine phenomenon with normal distribution come describe can it is extraordinary embody phenomenon itself pests occurrence rule, make accurate prediction.
Normal distribution(Normal distribution)Also known as Gaussian Profile(Gaussian distribution), it is one It is a in all very important probability distribution in the fields such as mathematics, physics and engineering, have great shadow at statistical many aspects Ring power.If stochastic variable X one mathematic expectaion of obedience is μ, the Gaussian Profile that variance is σ ^2, it is denoted as
X∼N(μ,σ2),
Its probability density function is
The desired value μ of normal distribution determines that its position, standard deviation sigma determine the amplitude of distribution.Because its curve is bell-like, because This people is often referred to as bell curve again.
The a bit fabulous statistical property of normal distribution
(1)Its density function is symmetrical about mean value,
(2)Its data high concentration is near mean value, P(-σ<x-μ<σ)=68%, namely nearly 70% data distribution is in section(μ- σ, μ+σ),
(3)P(-3σ<x-μ<3σ)=99.7%, namely 99.7% data distribution is in section(+ 3 σ of μ -3 σ, μ), then P(x>μ+3σ) +P((x<μ-3σ)=30/00, therefore(+ 3 σ of μ -3 σ, μ)The practical value range of stochastic variable X can be regarded as.This is write in management 3 σ rules of name.
Invention content
The object of the present invention is to provide a kind of safety-protection system alert processing dynamic route planning system and methods, discover and use Previous traffic data, it is serious mainly for congestion, and security protection center is more, thus the situation that security protection vehicle roadway is less, it fills Divide the different road speed for providing different congested links using the characteristics of normal distribution, finds alert and the point time occurs most Short security protection service station and respective routes can greatly reduce security protection vehicle to the uncertainty of the time of fire scene, energy Enough ensure security protection vehicle each sections of road with not less than 0.7 probability the scheduled time can reach alert scene, and When handle alert.
To achieve the above object, the present invention uses following technical scheme:
A kind of safety-protection system alert processing dynamic route planing method, including step:Obtain geographical location information and time letter Breath, finds out the be possible to transit route of security protection service station location to alert spot:Determine the section of each transit route, Determine the time used in every a road section,Determine that time used in each route, the route for finding out wherein minimum value are final roadway Line, corresponding security protection service station are the security protection service station for providing rescue;Specially:
(1)Obtain the geographical location information and temporal information of the alert spot corresponding to alarm signal;
(2)According to the geographical location information of the alert spot, the security protection service station in predeterminable area is searched for, acquisition closes on peace The geographical location information in anti-service station;
(3)According to geographical data bank and the geographical location information of alert spot and security protection service station, security protection service is found out It stands the be possible to transit route of location to alert spot:Route 1, route 2 ..., route n;
(4)Determine the section of each transit route:Determine the specific section of route 1, the specific section ... of route 2, route n's Specific section;
(5)Determine time t used in every a road sectionij:Using the normal distribution model of section congestion, calculating is possible to current road Time used in every a road section of line, tijIndicate that time used in the jth section of route i, i value ranges are 1 ..., n, j value ranges It is 1 ..., m;
(6)Determine time T used in each route1, T2..., Tn:The sum of time used in each section of each route i is calculated and is: Ti=ti1+ti2+…+tim
(7)Take T1, T2..., TnMinimum value Ta, then a routes are target route, namely it is final traffic route to choose a routes, right The security protection service station answered is the security protection service station for providing rescue.
The determination is per the method for building up of the normal distribution model of the section congestion of time used in a road section:
S01 determines time information:D points, a, b, c, d when e a month b day c, e is determined;
S02 obtains the road section length s by geographical data bank;
The motor vehicle average speed in the d points of sections, obtains one group of 60 number of speed when S03 obtains c during alert occurs first 60 days According to;
The time required to S04 is obtained the complete section of motor line by t=s/v;
S05 takes μ=(t1+t2+t3+…+t60 )/60;σ2=(t1 2 +t2 2+t3 2+…+t60 2) /60-μ2, remember the time for passing through section X, X obey a mathematic expectaion be μ, standard variance σ2Normal distribution, be denoted as:
X∼N(μ,σ2),
μ, σ are substituted into the formula of probability density function by S06;
S07 determines t, specially:T is found out by normal distribution database or normal distribution computing module0So that P(x<=t0)= 0.7;t0As in c d points, the required time that the complete section of motor line is estimated.
The geographical location information can be obtained from geographical data bank, and geographical data bank includes road latitude and longitude coordinates Information, road name, link length, building latitude and longitude coordinates, building title etc., the geographical data bank is according to existing geography Information is established.
The geographical location information according to the alert spot searches for the security protection service station in predeterminable area, specifically Including:Centered on the latitude and longitude coordinates of the alert spot, the security protection service station in pre-set radius is searched for;According to searching Security protection service station, determine the corresponding latitude and longitude coordinates in the security protection service station.
The determination in each section of the transit route, the road name per a road section is single, and includes starting point, does not include Terminal, the last item section include starting and terminal point.
The initial time of the time information, subsequent section is that the initial time of preceding a road section adds the passage of preceding a road section Time.
The highway traffic data library includes:Link length, road direction, being averaged per a road section motor vehicle of each moment Speed.
60 speed datas, respectively alert occur preceding 1 day, 2 days first, above-mentioned c on the preceding 3rd, 4,5 ... 60 when d divide Motor vehicle average overall travel speed v in the section1, v2..., v60
The motor vehicle average speed in the section can be obtained by the speed camera in the section described in the section Moment several vehicle running speeds, then take its average value.
A kind of safety-protection system alert processing dynamic route planning system, including safety protection command system, highway traffic data library, Geographical data bank, normal distribution computing module, normal distribution database, security protection service station;Wherein normal distribution database can be with By above-mentioned probability density function and parameter μ, σ2, Probability p provide above-mentioned t0
The alert handles dynamic route planing method, the maximum value the time required to the complete section of motor line be μ+
3σ。
Occurs for above-mentioned alert with minute the moment as minimum time of day, is to divide 21 seconds 2 pm 01 as the moment occurs for fire behavior Then it is rounded at 2 points 01 minute.
Advantages of the present invention:
The present invention is based on the normal distribution model of each section congestion, the previous 60 days traffic datas of digging utilization, specific to spy Timing is carved, and specific road section estimates the transit time in each section with statistical method according to six months previous traffic datas, And then security personnel are obtained by taken route to the time driven to alert spot, in the case of extreme congestion, single road The responding time rate of accuracy reached of section is to 70%.
The present invention especially pays attention to selecting at the time of section using the newest transit time data of the preceding a road section calculated in time Taking realizes Dynamic Programming, therefore the obtained responding time is very accurate and reliable, responding route science.
The security protection service station that this algorithm determines be by the most short determination of responding time, rather than it is previous simply with passive distance most Short leading determination ensure that the responding time is most short, improve the efficiency of entire safety-protection system.
In addition, data processing method of the present invention is simple and efficient, a common computer can carry out whole fortune of above-mentioned algorithm Calculation process, cost is extremely low, easy to spread.
Specific implementation mode
Embodiment 1:
For example safety protection command system is in September in 2017 is connected to the alert report Room 801 of Yan'an road 7 for 23 seconds 6 minutes at 5 points in afternoon on the 4th Fire needs to rescue.
So safety protection command system will be done as follows:
(1)The entitled the Yellow River mansion of building on Yan'an road 7 is transferred according to geographical data bank, latitude and longitude coordinates are(8 ° of east longitude, north 9 ° of latitude), obtain the geographical location information of alert spot;
(2)With the Yellow River mansion(8 ° of east longitude, 9 ° of north latitude)Centered on, it is assumed that with 5 kilometers for predetermined search radius, in 5 kilometers of search Security protection service station, obtain the geographical location information and title that close on security protection service station, obtain peace 1 security protection station(10 ° of east longitude, 11 ° of north latitude), pacify 2 security protection stations(12 ° of east longitude, 13 ° of north latitude), pacify 3 security protection stations(14 ° of east longitude, 15 ° of north latitude);
(3)1 security protection station of peace is easy to get by geographical data bank(10 ° of east longitude, 11 ° of north latitude)To the Yellow River mansion(8 ° of east longitude, north latitude 9°)5 different routes, specially route 1, route 2, route 3, route 4, route 5;
(4)Similar finds out 2 security protection stations of peace(12 ° of east longitude, 13 ° of north latitude)To the Yellow River mansion(8 ° of east longitude, 9 ° of north latitude)4 differences Route, specially route 6, route 7, route 8, route 9;And pacify 3 security protection stations(14 ° of east longitude, 15 ° of north latitude)To the Yellow River mansion(East Through 8 °, 9 ° of north latitude)3 different routes, specially route 10, route 11, route 12;
(5) we illustrate how to determine the section of route by taking route 1 as an example:Route 1 is made of 3 sections:Yan'an 1 Road, 2 tunnel of Yan'an, 3 tunnel of Yan'an;1 section of Yan'an, 2 section of Yan'an include starting point crossing, and 3 section of Yan'an includes starting point crossing and end Point crossing, crossings all so all by calculation to and only let it pass primary;
Using the normal distribution model of section congestion, time t used in every a road section of route 1 is calculated1,1, t1,2, t1,3;
(6) with the changed time t in 1 tunnel of the 1st section Yan'an1,1For illustrate how to establish the normal distribution mould of certain a road section congestion Type, specific method are:
S01 determines alert time of origin at 5 points in the afternoon on the 4th of 23 seconds 6 minutes determining time informations 2017 on the September 4,17 of September in 2017 When 6 divide;
S02 obtains 1 tunnel length s=2 kilometer of section Yan'an by geographical data bank;
S03 is according to highway traffic data library, 66 machine for being segmented 1 tunnels of Yan'an when dividing i.e. September in 2017 3 days 17 when obtaining preceding 1 day 17 Motor-car average speed:6 divide four kinds of vehicle running speeds when obtaining September in 2017 3 days 17 by the speed camera on 1 tunnel of Yan'an, Respectively:50,42,48,40, take its average value(50+42+48+40)/ 4=45, so v1=45 kilometers/hour;It obtains first 2 days The motor vehicle average overall travel speed V on 66 pavement branch sections Yan'an, 1 tunnels when dividing i.e. September in 2017 2 days 17 when 172=44 kilometers/hour ... The motor vehicle average overall travel speed V on 6 pavement branch sections Yan'an, 1 tunnel when obtaining the preceding same day 17 on the 60th60=46 kilometers/hour
The first n days(1=<n<=180)6 divide v kilometers/hour of average overall travel speed when motor vehicle 17
Preceding V on the 1st1=45
Preceding V on the 2nd2=44
. .
. .
Preceding V on the 60th60=46
S04 obtains t by t=s/v1The driving of 6 extension set motor-cars has been gone 1 road of Yan'an and has been taken at=2/45 hour=2.7 minutes, i.e., first 1 day 17 Between, 6 divide t the time required to the complete 1 tunnel section of Yan'an of motor line at first 2 days 172=2.8 minutes, in this way, show that alert occurs preceding 3, 6 divide t the time required to complete 1 tunnel of Yan'an of motor line at 4,5 ..., 60 days 173,t4,…,t60;
ti t1, t2, t3, t4, t5, … ,t30, …, t 60
Time/minute 2.7,2.8,2.9,2.2,2.1 ..., 2 ..., 2.8
S05 is by μ=(t1+t2+t3+…+t60 )/60=(2.7+2.8+2.9+ ...+2.8)/60=2.5,
σ2=(t1 2 +t2 2+t3 2+…+t60 2) /60-μ2=(2.72+2.82 +2.92+ …+2.82)/60-2.52=8.41,
It is X the time required to remembering complete 1 tunnel of Yan'an of motor line, it is μ=2.5, variance σ that X, which obeys a mathematic expectaion,2=8.41 just State is distributed, i.e. X~N (2.5,8.41);
S06 substitutes into μ=2.5, σ=2.9
=Obtain specific the formula of probability density function;
S07 is by P(x<= t0)=0.7 seeks t0, specially
Make P(x<= t0)=0.7=
T is calculated by the computing module that this system carries0=4 minutes, t0As 1 tunnel of Yan'an 6 divides motor line is complete to prolong at 17 Pacify the required time that 1 road is estimated, t1,1=4 minutes, the accuracy rate of the estimated time was 70%, that is, motor vehicle was in 4 minutes experts The probability on 1 tunnel of complete Yan'an is 70%, or says that certainty is 70%.
This example is by probability density function f(x), u, σ, by corresponding computing module calculates probability because this is known, because This is not stated carefully.
t1,2,t1,3The same t of algorithm1,1, do not exist together and be only that the moment:
t1,1 6 divide when September in 2017 4 days 17,
T again1,1=4 minutes, so:
t1,2 10 divide when September in 2017 4 days 17,
T is calculated using the normal distribution model of above-mentioned section congestion1,2When, 11 divide when time information takes September in 2017 4 days 17, And then calculate t1,2=1 minute, then similar
t1,3 11 divide when September in 2017 4 days 17
T is calculated using the normal distribution model of above-mentioned section congestion1,3When, 11 divide when time information takes September in 2017 4 days 17, And then calculate t1,3=2 minutes;
(7) by the changed time t in 1 tunnel of the 1st section Yan'an1,1=4 minutes, the changed time t in 2 tunnel of the 2nd section of Yan'an1,2=1 minute, the 3rd section The changed time t in 3 tunnel of Yan'an1,3=2 minutes;
So transit time T of route 11=t1,1+t1,2+t1,3=4+1+2=7 minute are about 7 minutes, i.e. T1=7 minutes.
Because route 1 is made of 3 sections, and the used time that the probability per a road section is 0.7 is respectively 1 point within 4 minutes Within clock, within 2 minutes, so probability of the used time of whole route no more than 7 minutes is 0.7*0.7*0.7;
Similar, we can calculate route 2 ..., the transit time of route 12, T1, T2..., T12, it is assumed that we obtain one Group transit time
Ti T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12
Unit/minute 7,15,16,20,37,44,14,15,19,18,14,16
(8) T7=7 is minimum, therefore it is target route to take 1 route, namely it is final traffic route to choose 1 route, corresponding security protection clothes Business station 1 station of security protection is the security protection service station for providing rescue.
Safety protection command system sends out instruction to 1 station of security protection, provides traffic route 1 to 1 station of security protection and provides suggestion speed Degree, it is proposed that speed is to calculate the corresponding values of gained time μ, such as 1 road μ=2.5 of this example Yan'an, μ=2/2.5 kilometer v=s//minute=48 Kilometer/hour, so obtain 2 tunnel of Yan'an, 40 kilometers/hour of the suggestion speed on 3 tunnel of Yan'an, 47 kilometers/hour, 1 station of security protection is held Row instruction, along 1 tunnel of Yan'an with 48 kilometers/hour travel, 2 tunnel of Yan'an with 40 kilometers/hour, 3 tunnel of Yan'an with 47 kilometers/it is small Shi Sudu is travelled, and fire fighting truck can reach alarm place the Yellow River mansion and sue and labour being connected in alert 7 minutes;In its 7 minutes The probability of arrival is 0.73The certainty that security protection vehicle reaches in 7 minutes in other words is 0.73;Its used time is more than that 21 minutes probability are 30/00, in other words, it is bound to reach in 21 minutes.It is extremely serious in megalopolis such as Shanghai, Central district's congestion In the case of, present invention can ensure that the time that security protection vehicle reaches scene in the case of more congestion is still controllable.
If it is desired to adjustment route running time certainty, can accordingly adjust the certainty of the time in each section.

Claims (10)

1. a kind of safety-protection system alert handles dynamic route planing method, including step:Obtain geographical location information and time Information finds out the be possible to transit route of security protection service station location to alert spot:Determine the road of each transit route Section determines the time used in every a road section,Determine the time used in each route, the route for finding out wherein minimum value is final driving Route, corresponding security protection service station are the security protection service station for providing rescue;Specifically ,':
(1)Obtain the geographical location information and temporal information of the alert spot corresponding to alarm signal;
(2)According to the geographical location information of the alert spot, the security protection service station in predeterminable area is searched for, acquisition closes on peace The geographical location information in anti-service station;
(3)According to geographical data bank and the geographical location information of alert spot and security protection service station, security protection service is found out It stands the be possible to transit route of location to alert spot:Route 1, route 2 ..., route n;
(4)Determine the section of each transit route:Determine the specific section of route 1, the specific section ... of route 2, route n's Specific section;
(5)Determine time t used in every a road sectionij:Using the normal distribution model of section congestion, be possible to transit route is calculated Every a road section used in the time, tijTime used in the jth section of expression route i, i value ranges are 1 ..., n, and j value ranges are 1,…,m;
(6)Determine time T used in each route1, T2..., Tn:The sum of time used in each section of each route i is calculated and is:Ti =ti1+ti2+…+tim
(7)Take T1, T2..., TnMinimum value Ta, then a routes are target route, namely it is final traffic route to choose a routes, corresponding Security protection service station be the security protection service station that rescue is provided;
It is characterized in that, determine the method for building up of the normal distribution model of the section congestion of time used in every a road section,
To specific section, method is:
S01 determines time information:D points, a, b, c, d when e a month b day c, e is determined;
S02 obtains the road section length s by geographical data bank;
The motor vehicle average speed in the d points of sections, obtains one group of 60 speed data when S03 obtains c during alert occurs first 60 days;
The time required to S04 is obtained the complete section of motor line by t=s/v;
S05 takes μ=(t1+t2+t3+…+t60 )/60;σ2=(t1 2 +t2 2+t3 2+…+t60 2)/ 60-μ2, remember the time X by section, X obey a mathematic expectaion be μ, standard variance σ2Normal distribution, be denoted as:
X∼N(μ,σ2),
μ, σ are substituted into the formula of probability density function by S06;
S07 determines t, specially:T is found out by normal distribution database or normal distribution computing module0So that P(x<=t0)= 0.7;t0As in c d points, the required time that the complete section of motor line is estimated.
2. alert according to claim 1 handles dynamic route planing method, which is characterized in that the geographical location information Can be obtained from geographical data bank, geographical data bank include road latitude and longitude coordinates information, road name, link length, Latitude and longitude coordinates, building title etc. are built, the geographical data bank is established according to existing geography information.
3. alert according to claim 1 handles dynamic route planing method, which is characterized in that occurred according to the alert The geographical location information on ground is searched for the security protection service station in predeterminable area, is specifically included:With the longitude and latitude of the alert spot Centered on coordinate, the security protection service station in pre-set radius is searched for;According to the security protection service station searched, the security protection service is determined It stands corresponding latitude and longitude coordinates.
4. the determination in each section of transit route according to claim 1, which is characterized in that the road name per a road section It is single, and include starting point, do not include terminal, the last item section includes starting and terminal point.
5. time information according to claim 1, which is characterized in that the initial time of subsequent section is rising for preceding a road section Moment beginning adds the transit time of preceding a road section.
6. highway traffic data library according to claim 1, which is characterized in that including:Link length, road direction, often The speed of the various vehicles in one moment road.
7. 60 speed datas according to claim 1, which is characterized in that 60 speed datas are respectively before alert occurs 1 day, 2 days first, above-mentioned c on the preceding 3rd, 4,5 ... 60 when the d points of motor vehicle average overall travel speed v in the section1, v2..., v60
8. the motor vehicle average speed in the section according to claim 1, which is characterized in that can be by the speed in the section Camera obtains the moment several vehicle running speeds in the section, then takes its average value.
9. a kind of safety-protection system alert handles dynamic route planning system, which is characterized in that including safety protection command system, road is handed over Logical database, geographical data bank, normal distribution computing module, normal distribution database, security protection service station;Wherein normal distribution number It can be by above-mentioned probability density function and parameter μ, σ according to library2, Probability p provide above-mentioned t0
10. alert according to claim 1 handles dynamic route planing method, which is characterized in that motor line is complete described Maximum value the time required to section is+3 σ of μ.
CN201711484965.2A 2017-12-29 2017-12-29 A kind of safety-protection system alert processing dynamic route planning system and method Pending CN108305491A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711484965.2A CN108305491A (en) 2017-12-29 2017-12-29 A kind of safety-protection system alert processing dynamic route planning system and method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711484965.2A CN108305491A (en) 2017-12-29 2017-12-29 A kind of safety-protection system alert processing dynamic route planning system and method

Publications (1)

Publication Number Publication Date
CN108305491A true CN108305491A (en) 2018-07-20

Family

ID=62868161

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711484965.2A Pending CN108305491A (en) 2017-12-29 2017-12-29 A kind of safety-protection system alert processing dynamic route planning system and method

Country Status (1)

Country Link
CN (1) CN108305491A (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20040023902A (en) * 2002-09-12 2004-03-20 에스케이 주식회사 Apparatus for producing traffic information and method thereof, and traffic information providing system
CN102353381A (en) * 2011-07-06 2012-02-15 广东威创视讯科技股份有限公司 Method and device for obtaining optimal path to hurry to scene of traffic accident
CN102393206A (en) * 2011-10-19 2012-03-28 北京世纪高通科技有限公司 Path planning method and device
CN103077610A (en) * 2012-12-31 2013-05-01 清华大学 Road trip time estimating method and system
CN103134505A (en) * 2011-11-25 2013-06-05 天眼卫星科技有限公司 Route planning system and method thereof

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20040023902A (en) * 2002-09-12 2004-03-20 에스케이 주식회사 Apparatus for producing traffic information and method thereof, and traffic information providing system
CN102353381A (en) * 2011-07-06 2012-02-15 广东威创视讯科技股份有限公司 Method and device for obtaining optimal path to hurry to scene of traffic accident
CN102393206A (en) * 2011-10-19 2012-03-28 北京世纪高通科技有限公司 Path planning method and device
CN103134505A (en) * 2011-11-25 2013-06-05 天眼卫星科技有限公司 Route planning system and method thereof
CN103077610A (en) * 2012-12-31 2013-05-01 清华大学 Road trip time estimating method and system

Similar Documents

Publication Publication Date Title
Chowdhury Priority based and secured traffic management system for emergency vehicle using IoT
CN109087506B (en) Vehicle monitoring method and device
Kattan et al. A probe-based variable speed limit system
CN108303109A (en) A kind of safety-protection system alert processing route planning system and normal state method
CN107045794A (en) Road conditions processing method and processing device
Costanzo et al. Implementing Cyber Physical social Systems for smart cities: A semantic web perspective
Elleuch et al. Cooperative intersection collision avoidance persistent system based on V2V communication and real-time databases
CN108303978A (en) A kind of dynamic route and method for determining speed of Vehicular automatic driving
CN108460981A (en) A kind of safety-protection system alert processing dynamic route planning system and normal state method
CN108303110A (en) A kind of vehicle control syetem and path velocity determine method
CN108304955A (en) A kind of dynamic route planing method of first-aid system
CN108305486A (en) A kind of state of an illness processing path planing method of first-aid system
CN108305490A (en) A kind of safety-protection system alert processing dynamic route planning normal state method
CN108305480A (en) A kind of safety-protection system alert processing dynamic route 180 normal state system and method for planning
CN108305491A (en) A kind of safety-protection system alert processing dynamic route planning system and method
CN108305489A (en) A kind of vehicle control syetem and dynamic route speed planning method
CN108305496A (en) Safety-protection system alert handles dynamic route planning system and method
CN108305488A (en) A kind of alert processing dynamic route planning normal distribution method of safety-protection system
CN108305481A (en) A kind of safety-protection system alert processing route planning system and method
Toulni et al. Preventing urban traffic congestion using VANET technology in urban area
CN108305495A (en) A kind of alert processing dynamic route 60 normal distribution methods of planning of safety-protection system
CN108305485A (en) A kind of safety-protection system alert processing dynamic route 60 normal distribution methods of planning
CN108305497A (en) A kind of safety-protection system alert processing dynamic route 50 normal distribution methods of planning
CN108320555A (en) A kind of state of an illness processing path planning of first-aid system
CN108305482A (en) A kind of safety-protection system alert processing half a year dynamic route planning system and method

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
WD01 Invention patent application deemed withdrawn after publication
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20180720