Nothing Special   »   [go: up one dir, main page]

CN108303104A - A kind of alert processing monthly planing method of dynamic route of safety-protection system - Google Patents

A kind of alert processing monthly planing method of dynamic route of safety-protection system Download PDF

Info

Publication number
CN108303104A
CN108303104A CN201711151734.XA CN201711151734A CN108303104A CN 108303104 A CN108303104 A CN 108303104A CN 201711151734 A CN201711151734 A CN 201711151734A CN 108303104 A CN108303104 A CN 108303104A
Authority
CN
China
Prior art keywords
section
route
time
alert
road
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
CN201711151734.XA
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 CN201711151734.XA priority Critical patent/CN108303104A/en
Publication of CN108303104A publication Critical patent/CN108303104A/en
Pending legal-status Critical Current

Links

Classifications

    • 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

Landscapes

  • Engineering & Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Automation & Control Theory (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Traffic Control Systems (AREA)

Abstract

The invention discloses a kind of alerts of safety-protection system to handle dynamic route planing method, including step:Geographical location information and temporal information are obtained, all possible paths is determined, determines the specific section in each path, determine each time on road tij, determine each path used time T1, T2..., Tn, i.e., it is by the sum of time calculating used in each section of each path i:Ti=ti1+ti2+…+tim;Take T1, T2..., TnMinimum value TaIt is final planning driving path to choose the paths a to get the paths destination path a namely vehicle, and it is running speed to choose corresponding speed.The present invention especially pays attention in time using the newest transit time data of the preceding a road section calculated, is chosen at the time of section and accomplishes mobilism;Alert can be found, point time shortest security protection service station and respective routes occur, can greatly reduce security protection vehicle to the time of fire scene uncertainty.

Description

A kind of alert processing monthly planing method of dynamic route of safety-protection system
Technical field
The present invention relates to the technical fields handled alert in safety-protection system, more particularly to a kind of alert of safety-protection system Handle the monthly planing method of dynamic route.
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.Processing for alert, existing safety-protection system are some districts in city mostly Multiple security protection offices station is set in domain, when alert occurs, is substantially apart from nearest security protection work station response, goes to alert Dispose alert in spot.And when the security protection of inner city office station is to alert spot, often half section is congestion, with The past pass by security protection office station to alert spot, is all quickly obtained by security personnel individual according to personal experience, Since the experience of security personnel is different and judges that level of decision-making differs, the treatment effeciency of alert can be by of security personnel People's factor substantially influences.It occur frequently that fire fighting truck gets lodged in road situation more than a quarter of an hour, the responding time greatly improves several times very The case where to decades of times, causes great hidden danger to the security of the lives and property of the common people.
All it is static programming although also there is the method and system of some roadings recently.Doing static programming When, often do not consider congestion, simply looks up alert and point nearest security protection office station occurs, then find out nearest security protection office station and arrive Shortest path between point occurs for alert, this shortest path is set to final security protection vehicle traffic route;Even if consider congestion, also simply with Whether congestion or not divide road conditions, and simplifies to congestion road conditions, provides unified vehicle pass-through speed, and the whole city is so much not It is unexpectedly identical with the road speed of congestion road conditions, it is clear that it is not reasonable, it not can be good at excavating previous traffic data, This processing alert mode is urgently improved in the metropolitan inner city of traffic congestion normalization.
If traffic accident occurs for certain days for a road section day, the traffic of a period of time is certain after accident occurs It is greatly affected, motor line must greatly prolong the time required to the complete section, then being had clearly a need at this time to the corresponding time Data are further to be handled.
Invention content
The object of the present invention is to provide a kind of alerts of safety-protection system to handle the monthly planing method of dynamic route, discovers and uses Previous traffic data provides the different road speed of different congested links, finds alert and point time shortest peace occurs Anti- service station and respective routes can greatly reduce security protection vehicle to the uncertainty of the time of fire scene, avoid vehicle The dozens of minutes that is blocked even several hours can ensure that security protection vehicle can reach alert scene in the scheduled time substantially, and When handle alert.
Special consideration should be given to sections to be once abnormal situation such as traffic accident by the present invention, and the complete section of motor line is whole to be taken Between when being significantly increased namely time data deviates situation than more serious, the processing of abnormal time data is to provide accurate rule The scheme of drawing.
To achieve the above object, the present invention uses following technical scheme:
A kind of alert processing monthly planing method of dynamic route of safety-protection system, including step:
(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 mathematical model of section congestion, be possible to transit route is calculated Time used in per a road section, 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, right The security protection service station answered is the security protection service station for providing rescue;
Command system sends out instruction to corresponding security protection service station, and provides it out traffic route a, corresponding security protection service Station executes instruction, and fire fighting truck can be in about T along route a tripsaAlarm place the Yellow River mansion is reached in minute to sue and labour.
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.
According to the geographical location information of the alert spot, the security protection service station in predeterminable area is searched for, is specifically included: 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 the peace searched Anti- service station determines the corresponding latitude and longitude coordinates in the security protection service station.
Each section of the transit route is established rules really, is:Road name per a road section is single, and includes starting Point does not include terminal, and the last item section includes starting and terminal point.
The mathematical model of the section congestion, the mathematical model establishing method to certain a road section congestion are:
(1)Determine time information:D points, a, b, c, d when e a month b day c, e is determined, occurs for alert with minute the moment as most subtotal Shi Danwei;
(2)The data stored by geographical data bank or control of traffic and road system, obtain the road section length s;
(3)Obtain the motor vehicle average overall travel speed v that the first 1 day above-mentioned alert generation moment section occurs for alert:According to road The data of traffic control system storage, the average overall travel speed v of d points of section motor vehicles when obtaining e a month b-1 day c,
(4)D extension set motor-car motor lines complete institute when obtaining alert generation preceding above-mentioned moment on the 1st, that is, e a month b-1 day c by t=s/v State section required time t1
(5)Divide motor line the complete section institute in this way, calculating d when the preceding e a of particular moment on the 2nd month b-2 day c occurs for alert Take time t2
(6)Analogize, calculates alert and occur preceding 3,4,5 ... t the time required to the complete section of the particular moment motor line on the 30th3, t4,…,t30;
(7)By t1,t2,t3,…,t30 According to the t ' that sorts successively from small to large1,t’2,t’3,…,t’30;
(8)If (t '8-t’1)>3(t’24–t’8)/2 or (t '30-t’24)>3(t’24–t’8)/2, then take(t’15+t’16)/ 2 are The section is the time required to passing through at the moment;
(9)Otherwise it takes(t’9+t’10+…+t’23)/ 15 for the section the time required to passing through at the moment.
Advantages of the present invention:
The present invention is based on the mathematical model of each section congestion, the previous 30 days traffic datas of digging utilization, specific to it is specific when It carves, specific road section estimates the transit time in each section with statistical method, in turn according to one month previous traffic data Security personnel are obtained by taken route to the time driven to alert spot, in the case of extreme congestion, the responding time is still It is so controllable, and be optimal.
Special consideration should be given to sections to be once abnormal situation such as traffic accident by the present invention, and the complete section of motor line is whole to be taken Between when being significantly increased, the processing of abnormal time data is with being optimal result.
The present invention fully considers the congestion in each section, is excavated to the traffic data in each section, especially pays attention to profit in time With the newest transit time data of preceding a road section of calculating, being chosen at the time of section realizes Dynamic Programming, therefore obtains The responding time it is accurate and reliable, responding route very science is optimal effect.
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, the data that the present invention takes are few, so the acquisition communication and all very fast, the data processing of processing of data Mode is simple and efficient, and a customary personal computer can carry out whole calculating processes of above-mentioned algorithm, and cost is extremely low, be easy to push away Extensively.
The present invention is instantaneous because of the reaction time, it is possible to used in requiring reaction speed extremely fast, than if any hidden peril of explosion Security protection processing Deng in the case of.
Specific implementation mode
Embodiment 1:
Such as safety protection command system is connected to the alert report Room 801 of Yan'an road 7 for 23 seconds 6 minutes at 5 points in afternoon on March 4th, 2017 Fire inside has battery of electric vehicle and other explosives, may the explosion of detonation at any time, it is dangerous greatly, urgent need will 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:Pacify 1 security protection station(10 ° of east longitude, north latitude 11°), 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 section 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 mathematical 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 mathematical model of certain a road section congestion, have Body method is:
1) 6 when determining alert time of origin 5 points of 23 seconds 6 minutes determining time information 4 days 17 March in 2017 of afternoon on March 4th, 2017 Point;
2)1 tunnel length s=2 kilometer of section Yan'an are obtained by geographical data bank;
3) data stored according to control of traffic and road system, 6 branches when obtaining first 1 day corresponding moment i.e. 2017 on March 3,17 Motor vehicle average overall travel speed v=24 kilometer/hour on 1 tunnels Duan Yanan;
4)T is obtained by t=s/v1=2/24 hour=5 minutes, i.e., corresponding moment motor vehicle driving in preceding 1 day has been gone the 1st section and has been taken Between;
5)In this way, obtaining alert occurs t the time required to the complete section of the first 2 days particular moment motor lines2=4.8 minutes;
6) t the time required to the complete section of the particular moment motor line on the 30th in this way, showing that alert occurs preceding 3,4,5 ...3, t4,…,t30;
ti t1, t2, t3, …, t14, t15 , t16,…, t28, t29, t 30
Time/minute 5,4. 8,15 ..., 6,4,4.9 ..., 6,7,5
7)By t1,t2,t3,…,t30 According to the t ' that sorts successively from small to large1,t’2,t’3,…,t’30 ;
t’i t’1, t’2, t’3 , … t’8, t’9 ,… ,t’15,t’16,…t’24..., t '30
Time/minute 4,4.8,4.9 ... 5,5 ..., 6,7 ... 7 ..., 15
8)3(t’24–t’8)/2=( 7-5)*3/2=3
t’30-t’24=15-7=8>3
That is (t '30-t’24)>3(t’24–t’8)/2
9)Inequality meets, then takes t1,1=(t’15+t’16)/2=(6+7)/ 2=6.5 minutes,
It it is 6.5 minutes the time required to the particular moment 1 tunnel passage of Yan'an.
t1,2,t1,3The same t of algorithm1,1, do not exist together and be only that the moment:
t1,16 divide when 4 days 17 March in 2017,
T again1,1=6.5 minutes, so:
t1,212.5 divide when 4 days 17 March in 2017, and time information minute value rounds up
t1,213 divide when 4 days 17 March in 2017
T is calculated using the mathematical model of above-mentioned section congestion1,2When, 13 divide when time information takes 4 days 17 March in 2017, in turn Calculate t1,2=3 minutes, then similar
t1,316 divide when 4 days 17 March in 2017
T is calculated using the mathematical model of above-mentioned section congestion1,3When, 16 divide when time information takes 4 days 17 March in 2017, in turn Calculate t1,3=4 minutes;
(7) by the changed time t in 1 tunnel of the 1st section Yan'an1,1=6.5 minutes, the changed time t in 2 tunnel of the 2nd section of Yan'an1,2=3 minutes, the 3rd The changed time t in 3 tunnels Duan Yanan1,3=4 minutes;
So transit time T of route 11=t1,1+t1,2+t1,3=6.5+3+4=13.5 minute
Similar, we can calculate route 2 ..., the transit time of route 12, T1, T2..., T12, as shown in the table:
Ti T1, T2, T3, T4, T5, T6, T7, T8, T9 , T10 , T11, T12
Unit/minute 13.5,15,16.5,20,37,44,14.2,15,19,18,7,10
(8) T11=7 is minimum, therefore it is target route to take 11 routes, namely it is final traffic route, corresponding peace to choose 11 routes Anti- 3 station of service station security protection is the security protection service station for providing rescue.
Command system sends out instruction to 3 station of security protection, provides traffic route 11,3 station of security protection to execute instruction to 3 station of security protection, Fire fighting truck can reach alarm place the Yellow River mansion along the trip of route 11 in about 7 minutes and sue and labour.
Upper example is that have abnormal data, and abnormal data deviation oscillation is beyond the mark, and when data are more dispersed, we take intermediate value Situation.
Embodiment 2:
Such as safety protection command system is connected to the alert report Room 801 of Yan'an road 7 for 23 seconds 6 minutes at 5 points in afternoon on March 4th, 2017 Fire inside has battery of electric vehicle and other explosives, may the explosion of detonation at any time, it is dangerous greatly, urgent need will 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:Pacify 1 security protection station(10 ° of east longitude, north latitude 11°), 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 section 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 mathematical 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 mathematical model of certain a road section congestion, have Body method is:
1) 6 when determining alert time of origin 5 points of 23 seconds 6 minutes determining time information 4 days 17 March in 2017 of afternoon on March 4th, 2017 Point;
2)1 tunnel length s=2 kilometer of section Yan'an are obtained by geographical data bank;
3) data stored according to control of traffic and road system, 6 branches when obtaining first 1 day corresponding moment i.e. 2017 on March 3,17 Motor vehicle average overall travel speed v=24 kilometer/hour on 1 tunnels Duan Yanan;
4)T is obtained by t=s/v1=2/24 hour=5 minutes, i.e., corresponding moment motor vehicle driving in preceding 1 day has been gone the 1st section and has been taken Between;
5)In this way, obtaining alert occurs t the time required to the complete section of the first 2 days particular moment motor lines2=4.8 minutes;
6) t the time required to the complete section of the particular moment motor line on the 30th in this way, showing that alert occurs preceding 3,4,5 ...3, t4,…,t30;
ti t1, t2, t3, …, t14, t15, t15, …, t15, t29, t 30
Time/minute 5,4.8,8 ..., 6,4,4.9 ..., 6,7,5
7)By t1,t2,t3,…,t30 According to the t ' that sorts successively from small to large1,t’2,t’3,…,t’30;
t’i t’1, t’2, t’3 , … t’8, t’9 ,… ,t’15,t’16,…t’24..., t '30
Time/minute 4,4.8,4.9 ... 5,5 ..., 6,7 ... 7 ..., 8
8) 3(t’24–t’8)/2=( 7-5)*3/2=3
t’30-t’24=8-7=1<3
That is (t '30-t’24)>3(t’24–t’8)/2 are unsatisfactory for,
T ' again8-t’1=5-4=1<3
That is (t '8-t’1)>3(t’24–t’8)/2 are also unsatisfactory for,
9)Inequality is unsatisfactory for, and is taken(t’9+t’10+…+t’23)/15=(5+5+…+6+7+…+7+7)/ 15=6.2 be the road Section the time required to passing through at the moment,
It it is 6.2 minutes the time required to the particular moment 1 tunnel passage of Yan'an.t1,2,t1,3The same t of algorithm1,1, do not exist together and only exist In the moment:
t1,1 6 divide when 4 days 17 March in 2017,
T again1,1=6.2 minutes, so:
t1,2 12.2 divide when 4 days 17 March in 2017, and time information minute value rounds up
t1,2 12 divide when 4 days 17 March in 2017
T is calculated using the mathematical model of above-mentioned section congestion1,2When, 12 divide when time information takes 4 days 17 March in 2017, in turn Calculate t1,2=3 minutes, then similar
t1,3 15 divide when 4 days 17 March in 2017
T is calculated using the mathematical model of above-mentioned section congestion1,3When, 15 divide when time information takes 4 days 17 March in 2017, in turn Calculate t1,3=4 minutes;
(7) by the changed time t in 1 tunnel of the 1st section Yan'an1,1=6.2 minutes, the changed time t in 2 tunnel of the 2nd section of Yan'an1,2=3 minutes, the 3rd The changed time t in 3 tunnels Duan Yanan1,3=4 minutes;
So transit time T of route 11=t1,1+t1,2+t1,3=6.2+4+3=13.2 minute
Similar, we can calculate route 2 ..., the transit time of route 12, T1, T2..., T12, as shown in the table:
Ti T1 , T2 , T3 , T4 , T5, T6, T7, T8, T9 , T10, T11, T12
Unit/minute 13.2,15,16.5,20,37,44,14.2,15,19,18,7,10
(8) T11=7 is minimum, therefore it is target route to take 11 routes, namely it is final traffic route, corresponding peace to choose 11 routes Anti- 3 station of service station security protection is the security protection service station for providing rescue.
Command system sends out instruction to 3 station of security protection, provides traffic route 11,3 station of security protection to execute instruction to 3 station of security protection, Fire fighting truck can reach alarm place the Yellow River mansion and sue and labour along the trip of route 11 being connected in alert about 7 minutes.

Claims (7)

1. a kind of alert of safety-protection system handles the monthly planing method of dynamic route, which is characterized in that include the following steps::
(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 mathematical model of section congestion, the every of be possible to transit route is calculated Time used in a road section, 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.
2. the mathematical model of section congestion according to claim 1, to certain a road section, which is characterized in that including following step Suddenly:(1)Determine time information:D points, a, b, c, d when e a month b day c, e is determined, time information is minimum timing list with minute Position;
(2)The data stored by geographical data bank or control of traffic and road system, obtain the road section length s;
(3)Obtain the motor vehicle average overall travel speed v that the first 1 day above-mentioned alert generation moment section occurs for alert:According to road The data of traffic control system storage, the average overall travel speed v of d points of section motor vehicles when obtaining e a month b-1 day c,
(4)D extension set motor-car motor lines complete institute when obtaining alert generation preceding above-mentioned moment on the 1st, that is, e a month b-1 day c by t=s/v State section required time t1
(5)Divide motor line the complete section institute in this way, calculating d when the preceding e a of particular moment on the 2nd month b-2 day c occurs for alert Take time t2
(6)Analogize, calculates alert and occur preceding 3,4,5 ... t the time required to the complete section of the particular moment motor line on the 30th3, t4,…,t30;
(7)By t1,t2,t3,…,t30 According to the t ' that sorts successively from small to large1,t’2,t’3,…,t’30;
(8)If (t '8-t’1)>3(t’24–t’8)/2 or (t '30-t’24)>3(t’24–t’8)/2, then take(t’15+t’16)/ 2 be institute Section is stated the time required to passing through at the moment;
(9)Otherwise it takes(t’9+t’10+…+t’23)/ 15 for the section the time required to passing through at the moment.
3. alert according to claim 1 handles route planning method, which is characterized in that the geographical location information all may be used To be obtained from geographical data bank, 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 established according to existing geography information.
4. alert according to claim 1 handles route planning method, which is characterized in that according to the alert spot Geographical location information is searched for the security protection service station in predeterminable area, is specifically included:With the latitude and longitude coordinates of the alert spot Centered on, search for the security protection service station in pre-set radius;According to the security protection service station searched, the security protection service station pair is determined The latitude and longitude coordinates answered.
5. each section of transit route according to claim 1 is established rules really, it is:Road name per a road section is single, And include starting point, do not include terminal, the last item section includes starting and terminal point.
6. time information according to claim 2, 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.
7. highway traffic data library according to claim 2, which is characterized in that including:Link length, road direction, often The average speed of the various vehicles in one moment road.
CN201711151734.XA 2017-11-19 2017-11-19 A kind of alert processing monthly planing method of dynamic route of safety-protection system Pending CN108303104A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711151734.XA CN108303104A (en) 2017-11-19 2017-11-19 A kind of alert processing monthly planing method of dynamic route of safety-protection system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711151734.XA CN108303104A (en) 2017-11-19 2017-11-19 A kind of alert processing monthly planing method of dynamic route of safety-protection system

Publications (1)

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

Family

ID=62869610

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711151734.XA Pending CN108303104A (en) 2017-11-19 2017-11-19 A kind of alert processing monthly planing method of dynamic route of safety-protection system

Country Status (1)

Country Link
CN (1) CN108303104A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112085265A (en) * 2020-08-28 2020-12-15 深圳市富思源智慧消防股份有限公司 Fire rescue guiding method, system, device and computer readable storage medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102353381A (en) * 2011-07-06 2012-02-15 广东威创视讯科技股份有限公司 Method and device for obtaining optimal path to hurry to scene of traffic accident
CN102762957A (en) * 2009-12-17 2012-10-31 佳明瑞士有限责任公司 Historial traffic data compression
CN103674043A (en) * 2012-09-26 2014-03-26 鸿富锦精密工业(深圳)有限公司 Vehicle navigation system and method
CN106447164A (en) * 2016-08-30 2017-02-22 长威信息科技发展股份有限公司 Method and system for selecting scheduling resources on map
CN106971516A (en) * 2017-05-09 2017-07-21 河北金锁安防工程股份有限公司 A kind of alert process circuit method and system for planning of safety-protection system

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102762957A (en) * 2009-12-17 2012-10-31 佳明瑞士有限责任公司 Historial traffic data compression
CN102353381A (en) * 2011-07-06 2012-02-15 广东威创视讯科技股份有限公司 Method and device for obtaining optimal path to hurry to scene of traffic accident
CN103674043A (en) * 2012-09-26 2014-03-26 鸿富锦精密工业(深圳)有限公司 Vehicle navigation system and method
CN106447164A (en) * 2016-08-30 2017-02-22 长威信息科技发展股份有限公司 Method and system for selecting scheduling resources on map
CN106971516A (en) * 2017-05-09 2017-07-21 河北金锁安防工程股份有限公司 A kind of alert process circuit method and system for planning of safety-protection system

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112085265A (en) * 2020-08-28 2020-12-15 深圳市富思源智慧消防股份有限公司 Fire rescue guiding method, system, device and computer readable storage medium

Similar Documents

Publication Publication Date Title
Sumi et al. Intelligent traffic management system for prioritizing emergency vehicles in a smart city
CN109087506B (en) Vehicle monitoring method and device
Chowdhury Priority based and secured traffic management system for emergency vehicle using IoT
CN110044373A (en) A kind of fining traffic weather information on services generation method
KR101335924B1 (en) System for serving information of dangerous district forecast based on natural disaster dangerous district data
CN108303109A (en) A kind of safety-protection system alert processing route planning system and normal state method
CN108303104A (en) A kind of alert processing monthly planing method of dynamic route of safety-protection system
Golpayegani et al. Urban emergency management using intelligent traffic systems: challenges and future directions
CN108304955A (en) A kind of dynamic route planing method of first-aid system
CN105447588A (en) Earthquake on-site rescue method based on crowd-sourcing perception, and application system thereof
KR101261480B1 (en) Person in charge matching system for prevent and transaction accident
CN108460981A (en) A kind of safety-protection system alert processing dynamic route planning system and normal state method
CN108305486A (en) A kind of state of an illness processing path planing method of first-aid system
CN108305481A (en) A kind of safety-protection system alert processing route planning system and method
CN108304957A (en) A kind of alert processing dynamic route common planning method of safety-protection system
CN108304954A (en) A kind of alert processing half season of dynamic route planing method of safety-protection system
Bagheri et al. Software-defined control of emergency vehicles in smart cities
CN108304956A (en) A kind of alert processing dynamic route planing method of safety-protection system
CN108305490A (en) A kind of safety-protection system alert processing dynamic route planning normal state method
CN115523938A (en) Traffic navigation method, system, electronic device and storage medium
CN108305480A (en) A kind of safety-protection system alert processing dynamic route 180 normal state system and method for planning
CN108303107A (en) A kind of alert processing dynamic route of safety-protection system is averaged planing method
Katre et al. A survey on shortest path algorithm for road network in emergency services
CN108305482A (en) A kind of safety-protection system alert processing half a year dynamic route planning system and method
CN108305483A (en) A kind of alert processing dynamic line planning big data method of safety-protection system

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

Application publication date: 20180720

WD01 Invention patent application deemed withdrawn after publication