CN107507415B - Road network boundary current limiting control method based on MFD and queuing length under Internet of vehicles - Google Patents
Road network boundary current limiting control method based on MFD and queuing length under Internet of vehicles Download PDFInfo
- Publication number
- CN107507415B CN107507415B CN201710550098.1A CN201710550098A CN107507415B CN 107507415 B CN107507415 B CN 107507415B CN 201710550098 A CN201710550098 A CN 201710550098A CN 107507415 B CN107507415 B CN 107507415B
- Authority
- CN
- China
- Prior art keywords
- road network
- road
- boundary
- vehicles
- current limiting
- 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.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/01—Detecting movement of traffic to be counted or controlled
- G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
- G08G1/0137—Measuring and analyzing of parameters relative to traffic conditions for specific applications
- G08G1/0145—Measuring and analyzing of parameters relative to traffic conditions for specific applications for active traffic flow control
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/065—Traffic control systems for road vehicles by counting the vehicles in a section of the road or in a parking area, i.e. comparing incoming count with outgoing count
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Chemical & Material Sciences (AREA)
- Analytical Chemistry (AREA)
- Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention relates to the technical field of control methods, in particular to a road network boundary current-limiting control strategy method based on MFD and queuing length in the Internet of vehicles, which comprises the following specific steps: (a) firstly, acquiring traffic parameters; mounting GPS vehicle-mounted equipment on a vehicle, and transmitting information such as longitude, latitude, speed and the like in real time; (b) secondly, defining the meeting conditions of the vehicles in the road network area, and judging whether the mobile vehicles fall in the road network area according to the conditions; (c) thirdly, calculating the distance from each vehicle on each road section to each parking line at each entrance, and finally obtaining the maximum queuing length qLmax(i)Taking 95% of the road section length Li as the road section safe queuing length Lsi, and taking q asLmax(i)Comparing the traffic congestion with Lsi to judge whether the traffic congestion occurs at the upstream intersection or not; (d) finally, carrying out current limiting control on the boundary traffic; and when the road network tends to be congested, simple boundary current limiting control is implemented on the road network. The invention is used for real-time counting of vehicles in a road network and the maximum queuing length of road sections in the environment of the Internet of vehicles.
Description
Technical Field
The invention relates to the technical field of control methods, in particular to a road network boundary current limiting control strategy method based on MFD and queuing length in the Internet of vehicles.
Background
With the rapid development of social economy, the automobile holding capacity is greatly increased, the urban traffic jam problem is worsened, and the urban traffic jam problem becomes one of the bottlenecks of urban development. In order to reduce the delay time and the queuing length of vehicles and relieve traffic jam, most of large cities adopt an advanced traffic control technology and implement an intelligent traffic signal control system. However, as the number of traffic flows increases, the oversaturated traffic phenomenon appears in part of urban traffic, and the effect of the original traffic control system is affected. Two scholars of Daganzo and Geroliminis recently studied a lot of actual traffic data, and found that there is a certain objective regularity in the urban traffic network, namely the relation between the traffic running state of the network and the number of moving vehicles, which is called as a Macroscopic Fundamental Diagrams (MFD), and the popularity of the Macroscopic Fundamental Diagrams is also confirmed by a plurality of scholars through a lot of actual data. And partial scholars propose to utilize a macro basic graph correlation theory to carry out traffic control on the oversaturated traffic area, so that the congestion condition of the oversaturated traffic area is improved. For example, Marying proposes that the traffic signal control of the road network can be carried out from a macro level by using MFD; do Yi Man et al propose the dynamic regulation and control technology of the total amount of regional traffic based on macroscopic basic diagram; mehdi et al have studied the feedback gate control method based on network MFD, Yosh et al propose the regional measurement control method based on macroscopic basic diagram to the supersaturated road network, and have verified the validity of the method; the authors have proposed a road network simple boundary current-limiting control strategy based on MFD and verified its effectiveness. Through further research, a writer thinks that when a road network implements a peripheral traffic flow limiting strategy, the condition that vehicles at a peripheral flow limiting intersection queue and overflow to cause congestion at an upstream intersection should be avoided, but how to judge whether the overflow phenomenon occurs at a boundary road section in real time becomes a key point of the problem. Recently, the technology of internet of vehicles is vigorously developed in various countries, the internet of vehicles is the development direction of intelligent traffic systems, and under the environment of the internet of vehicles, information such as vehicle positions, speeds and the like can be uploaded to a command center in real time through a vehicle-mounted terminal and a road side unit, so that a reliable means is provided for determining the number of vehicles in the road network and the queuing length in real time, and opportunities and conditions are provided for improving traffic signal control. .
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provides a road network boundary current-limiting control strategy method based on MFD and queuing length under the Internet of vehicles.
In order to solve the technical problems, the invention adopts the technical scheme that:
the road network boundary current-limiting control method based on the MFD and the queuing length in the Internet of vehicles is provided, and comprises the following specific steps:
(a) firstly, acquiring traffic parameters; mounting GPS vehicle-mounted equipment on a vehicle, and transmitting information such as longitude, latitude, speed and the like in real time;
(b) secondly, defining the meeting conditions of the vehicles in the road network area, and judging whether the mobile vehicles fall in the road network area according to the conditions; guiding a line from the longitude and latitude points of the vehicle to be judged to a certain direction, calculating the number of intersection points with the road network boundary, wherein if the number is an even number or 0, the point is outside the road network area, and if the number is an odd number, the point is inside the road network area; converting the number of vehicles falling in the road network area into equivalent traffic volume, and determining the number N of the vehicles in the road network and the traffic volume qi (i represents the ith road segment) of each road segment;
(c) thirdly, calculating the distance from each vehicle on each road section to each parking line at each entrance, and finally obtaining the maximum queuing length qLmax(i)Taking 95% of the road section length Li as the road section safe queuing length Lsi, and taking q asLmax(i)Comparing the traffic congestion with Lsi to judge whether the traffic congestion occurs at the upstream intersection or not; if q isLmax(i)≥LsiThe vehicles can be caused to queue and overflow to the upstream intersection, so that the traffic jam occurs at the upstream intersection;
(d) finally, carrying out current limiting control on the boundary traffic; and when the road network tends to be congested, simple boundary current limiting control is implemented on the road network.
The invention relates to a road network boundary current-limiting control strategy method based on MFD and queuing length under an Internet of vehicles, which is characterized in that the number of vehicles in a road network and the maximum queuing length of road sections are real-time under the environment of the Internet of vehicles, and whether the maximum queuing length of each boundary road section exceeds the safe queuing length of the road section or not is judged in real time according to a macroscopic basic graph when a peripheral traffic current-limiting control strategy is implemented on the road network, so that the road network inrush rate is adjusted in time, and the overflow phenomenon of the boundary road sections is avoided.
Preferably, in step (c), the maximum queuing length q is derivedLmax(i)The steps are as follows:
(A) firstly, the distance from each vehicle to each entrance parking line is calculated, and the calculation formula is as follows:
in the formula: dij-the distance from the jth vehicle on the ith road segment to the entrance stop line of the road segment;
ajij, AWij-the longitude and latitude of the jth vehicle on the ith road section;
BJij,BWij-longitude and latitude of an entrance stop line on the ith road section;
(B) after step (a), the set of distances for the vehicle to reach the stop line on each road segment is denoted as D and is represented as:
D＝{dij|i∈L,j∈N}；
the set of instantaneous speeds of the vehicle is denoted V and is represented as:
V＝{vij|i∈L,j∈N}
in the formula, vij is the instantaneous speed of the jth vehicle on the ith road section;
(C) after step (B), defining the vehicles with the instantaneous speed v less than or equal to 5km/h as the parking queuing vehicles, thereby obtaining the queuing length set of all the parking queuing vehicles on the road section, which is expressed as QL:
QL＝{dij，viji belongs to L, j belongs to N, and vij≤5}
Thereby obtaining the maximum queuing length q of the vehicles on the ith road sectionLmax(i) Can be represented as
qLmax(i)＝max(QLi)
Thereby finally obtaining the maximum queuing length qLmax(i)。
Preferably, in step (d), when the road network tends to be congested, simple boundary current limiting control is performed on the road network, and the specific steps utilize the following formula:
in the formula: t-a certain time (h);
Δ t — time step (h);
qG-controlled road network boundary traffic inflow (pcu/h);
i-traffic inflow (pcu/h) at time t of road network, Ii(t) is the traffic inflow amount (pcu/h) of the ith inlet at the moment t,
I(t)＝∑Ii(t)；
o (t) -road network traffic volume (pcu/h) at a certain time;
Rin-the ingress rate (allowable ratio of traffic ingress);
according to the allowable inflow amount I of traffic flowi(t + delta t), and recalculating the optimal signal period of each boundary intersection after current limiting by adopting a Webster timing method.
Preferably, the specific steps are as follows:
(1) when N (t) is not less than NCWhen the road network is in a crowded state;
(2) when the vehicle enters the congestion state, calculating the maximum number q of queued vehicles at each entrance of all the boundary intersections at the time tLmax(i)(t) if qLmax(i)≥LsiIf so, the intersection inlet does not implement a peripheral current limiting strategy, and a Webster method is adopted to carry out timing design according to actual traffic requirements; defining a variable qm(t) for counting all unfit weeksBoundary intersection current limiting value and variable q of side current limiting strategym(t) can be expressed as:
in the formula, s represents the number of the inlet road section of the boundary intersection which is not suitable for current limiting;
if q ism(t) when t is 0, then press RinImplementing a peripheral current limiting strategy on the inrush rate; if q ism(t)>0, then q ism(t) averagely shifting to other boundary intersections, and readjusting inflow rate R'in。
Preferably, R 'is obtained'inThe method comprises the following specific steps:
(1) first, according to
In the formula, n is the total number of the road sections imported from the road network boundary intersection;
x is the number of the inlet road sections which are not suitable for limiting the flow at the road network boundary intersection, and n-x is the number of the inlet road sections which are suitable for limiting the flow at the road network boundary intersection;
Δqmwhen overflow phenomenon exists in the individual boundary road section, the average flow limiting value which is added to other boundary road sections is increased;
(2) secondly, obtaining an inlet current limiting value suitable for current limiting at a road network boundary intersection:
qmy(t+Δt)＝(1-Rin)Iy(t)+Δqm
in the formula, y represents the number of the inlet road section of the boundary intersection suitable for current limiting;
(3) thirdly, obtaining the new inflow amount of each inlet suitable for current limiting at the road network boundary intersection:
qGy(t+Δt)＝Iy(t)-qmy(t+Δt)
＝Iy(t)-[(1-Rin)Iy(t)+Δqm]
＝RinIy(t)-Δqm
therefore, the new inflow amount of all inlets suitable for current limiting at the road network boundary intersection is obtained:
the boundary intersection actual inflow amount I' (t) suitable for limiting the current is as follows:
(4) finally obtaining a new inrush rate R 'after readjustment'in：
Compared with the prior art, the invention has the beneficial effects that:
the invention relates to a road network boundary current-limiting control strategy method based on MFD and queuing length under an Internet of vehicles, which is characterized in that the number of vehicles in a road network and the maximum queuing length of road sections are real-time under the environment of the Internet of vehicles, and whether the maximum queuing length of each boundary road section exceeds the safe queuing length of the road section or not is judged in real time according to a macroscopic basic graph when a peripheral traffic current-limiting control strategy is implemented on the road network, so that the road network inrush rate is adjusted in time, and the overflow phenomenon of the boundary road sections is avoided.
Drawings
Fig. 1 is a flowchart of a road network boundary current-limiting control strategy based on MFDs and queuing lengths in the internet of vehicles according to an embodiment.
Fig. 2 is a schematic view of a commercial district of a sports center in a river district according to an embodiment.
FIG. 3 is a schematic diagram of a simulation model of a road network of a river business area according to an embodiment.
FIG. 4 is an MFD graph of an embodiment simulated road network.
FIG. 5 is a schematic diagram illustrating an average queuing length of intersections of an oversaturated road network according to an embodiment.
FIG. 6 is a schematic diagram of average delay time of intersections of the oversaturated road network according to the embodiment.
FIG. 7 is a schematic diagram of average number of stops at each intersection of the supersaturated road network.
Fig. 8 is a comparison table of control indexes of each traffic signal of an oversaturated road network under three strategies.
Detailed Description
The present invention will be further described with reference to the following embodiments. Wherein the showings are for the purpose of illustration only and are shown by way of illustration only and not in actual form, and are not to be construed as limiting the present patent; to better illustrate the embodiments of the present invention, some parts of the drawings may be omitted, enlarged or reduced, and do not represent the size of an actual product; it will be understood by those skilled in the art that certain well-known structures in the drawings and descriptions thereof may be omitted.
The same or similar reference numerals in the drawings of the embodiments of the present invention correspond to the same or similar components; in the description of the present invention, it should be understood that if there is an orientation or positional relationship indicated by the terms "upper", "lower", "left", "right", etc. based on the orientation or positional relationship shown in the drawings, it is only for convenience of describing the present invention and simplifying the description, but it is not intended to indicate or imply that the referred device or element must have a specific orientation, be constructed in a specific orientation, and be operated, and therefore, the terms describing the positional relationship in the drawings are only used for illustrative purposes and are not to be construed as limiting the present patent, and the specific meaning of the terms may be understood by those skilled in the art according to specific circumstances.
Examples
Fig. 1 to 8 show an embodiment of a road network boundary current-limiting control strategy method based on MFDs and queuing lengths in the internet of vehicles according to the present invention, which includes the following specific steps:
(a) firstly, acquiring traffic parameters; mounting GPS vehicle-mounted equipment on a vehicle, and transmitting information such as longitude, latitude, speed and the like in real time;
(b) secondly, defining the meeting conditions of the vehicles in the road network area, and judging whether the mobile vehicles fall in the road network area according to the conditions; guiding a line from the longitude and latitude points of the vehicle to be judged to a certain direction, calculating the number of intersection points with the road network boundary, wherein if the number is an even number or 0, the point is outside the road network area, and if the number is an odd number, the point is inside the road network area; converting the number of vehicles falling in the road network area into equivalent traffic volume, and determining the number N of the vehicles in the road network and the traffic volume qi (i represents the ith road segment) of each road segment;
(c) thirdly, calculating the distance from each vehicle on each road section to each parking line at each entrance, and finally obtaining the maximum queuing length qLmax(i)Taking 95% of the road section length Li as the road section safe queuing length Lsi, and taking q asLmax(i)Comparing the traffic congestion with Lsi to judge whether the traffic congestion occurs at the upstream intersection or not; if q isLmax(i)≥LsiThe vehicles can be caused to queue and overflow to the upstream intersection, so that the traffic jam occurs at the upstream intersection;
(d) finally, carrying out current limiting control on the boundary traffic; and when the road network tends to be congested, simple boundary current limiting control is implemented on the road network.
Wherein in step (c) the maximum queue length q is derivedLmax(i)The steps are as follows:
(A) firstly, the distance from each vehicle to each entrance parking line is calculated, and the calculation formula is as follows:
in the formula: dij-the distance from the jth vehicle on the ith road segment to the entrance stop line of the road segment;
ajij, AWij-the longitude and latitude of the jth vehicle on the ith road section;
BJij,BWij-longitude and latitude of an entrance stop line on the ith road section;
(B) after step (a), the set of distances for the vehicle to reach the stop line on each road segment is denoted as D and is represented as:
D＝{dij|i∈L,j∈N}；
the set of instantaneous speeds of the vehicle is denoted V and is represented as:
V＝{vij|i∈L,j∈N}
in the formula, vij is the instantaneous speed of the jth vehicle on the ith road section;
(C) after step (B), defining the vehicles with the instantaneous speed v less than or equal to 5km/h as the parking queuing vehicles, thereby obtaining the queuing length set of all the parking queuing vehicles on the road section, which is expressed as QL:
QL＝{dij，viji belongs to L, j belongs to N, and vij≤5}
Thereby obtaining the maximum queuing length q of the vehicles on the ith road sectionLmax(i) It can be expressed as:
qLmax(i)＝max(QLi)
thereby finally obtaining the maximum queuing length qLmax(i)。
In addition, in the step (d), when the road network tends to be congested, simple boundary current limiting control is implemented on the road network, and the following formula is utilized in the concrete steps:
in the formula: t-a certain time (h);
Δ t — time step (h);
qG-controlled road network boundary traffic inflow (pcu/h);
i-traffic inflow (pcu/h) at time t of road network, Ii(t) is the traffic inflow amount (pcu/h) of the ith inlet at the moment t,
I(t)＝ΣIi(t)；
o (t) -road network traffic volume (pcu/h) at a certain time;
Rin-the ingress rate (allowable ratio of traffic ingress);
according to the allowable inflow amount I of traffic flowi(t + delta t), and recalculating the optimal signal period of each boundary intersection after current limiting by adopting a Webster timing method.
The method comprises the following specific steps:
(1) when N (t) is not less than NCWhen the road network is in a crowded state;
(2) when the vehicle enters the congestion state, calculating the maximum number q of queued vehicles at each entrance of all the boundary intersections at the time tLmax(i)(t) if qLmax(i)≥LsiIf so, the intersection inlet does not implement a peripheral current limiting strategy, and a Webster method is adopted to carry out timing design according to actual traffic requirements; defining a variable qm(t) is used for counting all boundary intersection flow limiting values which are not suitable for implementing the peripheral flow limiting strategy, and variable qm(t) can be expressed as:
in the formula, s represents the number of the inlet road section of the boundary intersection which is not suitable for current limiting;
if q ism(t) when t is 0, then press RinImplementing a peripheral current limiting strategy on the inrush rate; if q ism(t)>0, then q ism(t) averagely shifting to other boundary intersections, and readjusting inflow rate R'in。
In addition, R 'is obtained'inThe specific steps are as follows, refer to fig. 1:
(1) first, according to
In the formula, n is the total number of the road sections imported from the road network boundary intersection;
x is the number of the inlet road sections which are not suitable for limiting the flow at the road network boundary intersection, and n-x is the number of the inlet road sections which are suitable for limiting the flow at the road network boundary intersection;
Δqmwhen overflow phenomenon exists in the individual boundary road section, the average flow limiting value which is added to other boundary road sections is increased;
(2) secondly, obtaining an inlet current limiting value suitable for current limiting at a road network boundary intersection:
qmy(t+Δt)＝(1-Rin)Iy(t)+Δqm
in the formula, y represents the number of the inlet road section of the boundary intersection suitable for current limiting;
(3) thirdly, obtaining the new inflow amount of each inlet suitable for current limiting at the road network boundary intersection:
qGy(t+Δt)＝Iy(t)-qmy(t+Δt)
＝Iy(t)-[(1-Rin)Iy(t)+Δqm]
＝RinIy(t)-Δqm
therefore, the new inflow amount of all inlets suitable for current limiting at the road network boundary intersection is obtained:
the boundary intersection actual inflow amount I' (t) suitable for limiting the current is as follows:
(4) finally obtaining a new inrush rate R 'after readjustment'in：
The specific application examples are as follows:
the Guangzhou river area sports center business area is used as a research object, as shown in fig. 2, wherein the north road, the east road and the south road of the river are main channels of the area.
1) Determining a macroscopic basic graph of a road network
In the Vissim traffic simulation software, a road network traffic simulation model is established, and the Internet of vehicles environment can be effectively simulated, as shown in FIG. 3. In the road network simulation model, the simulated traffic flow starts from a low peak, the driving traffic volume of each road section at the boundary of the road network is increased by 100pcu/h every 900s until the supersaturation state of a high peak, the total simulation is 27000s, data is collected for 1 time every 120s and 225 times, and finally the number of moving vehicles of the road network (calculated by the road section density ki and the road section length Li), the traffic inflow volume and the traffic outflow volume of the boundary intersection and the road section flow are counted and processed to obtain the reference MFD of the road network, as shown in FIG. 3.
Calculating the maximum weighted flow of the region from the fitted curve of FIG. 4
Number of critical vehicles Nc1090 pcu. It can be seen that when the number of vehicles N>1090pcu, the road network is in a supersaturated congestion state.
2) Boundary current limiting control strategy simulation
And (3) carrying out secondary development on a com programming interface provided by the Visim by adopting C # language, and implementing a boundary current-limiting control strategy considering a boundary road section queuing space on the road network. In order to obtain the maximum queuing length of the boundary road section, a queuing detector is arranged at the safe queuing position of the road section. When the road network is simulated for 133 periods (the simulation time is about 15960s), the road network enters a congestion state, the initial inrush rate of the road network is obtained according to a boundary current limiting control strategy, and the current is required to be limited for 8% of flow. Therefore, in order to simplify the calculation, the green time of the driving direction of the boundary road segment is reduced by 8%, and the simulation analysis is performed again. Approximately, about 156 cycles are operated, as the queuing spaces of the road sections CR, ED and FG are limited, the situation of insufficient queuing space occurs, the queues overflow to the upstream intersection, the surge rate of the road network needs to be readjusted, the surge rate is recalculated to 90% according to the boundary current-limiting control algorithm considering the queuing spaces of the road sections, namely, the current limitation is not performed on the road sections CR, ED and FG, the current limitation with 90% of the surge rate is performed on other boundary road sections, and the simulation analysis is performed again.
Analyzing simple perimeter restriction policy without implementing perimeter restriction policy[11]And under three control strategies such as a boundary current-limiting control strategy of a queuing space and the like, acquiring the traffic signal control index of the supersaturated network by using the simulation data (15960-27000 s is a supersaturated simulation time period) of the supersaturated network, as shown in fig. 5-7.
As can be seen from fig. 8, the average delay times of the simple periphery current limiting strategy and the algorithm herein are respectively reduced by 12.6% and 17.1% compared with the case where the periphery current limiting strategy is not implemented; the average parking times of the simple peripheral current limiting strategy and the algorithm are respectively reduced by 6.7 percent and 4.2 percent compared with the average parking times without the peripheral current limiting strategy; the average queue length of the simple peripheral current limiting strategy and the algorithm is respectively reduced by 17.7 percent and 18.6 percent compared with the average queue length without the implementation of the peripheral current limiting strategy. The simple peripheral current limiting strategy and each traffic signal control index of the algorithm are improved compared with the method without the implementation of the peripheral current limiting strategy.
It should be understood that the above-described embodiments of the present invention are merely examples for clearly illustrating the present invention, and are not intended to limit the embodiments of the present invention. Other variations and modifications will be apparent to persons skilled in the art in light of the above description. And are neither required nor exhaustive of all embodiments. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the claims of the present invention.
Claims (3)
1. A road network boundary current limiting control method based on MFD and queuing length in the Internet of vehicles is characterized by comprising the following specific steps:
(a) firstly, acquiring traffic parameters; mounting GPS vehicle-mounted equipment on a vehicle, and transmitting information such as longitude, latitude, speed and the like in real time;
(b) secondly, defining the meeting conditions of the vehicles in the road network area, and judging whether the mobile vehicles fall in the road network area according to the conditions; guiding a line from the longitude and latitude points of the vehicle to be judged to a certain direction, calculating the number of intersection points with the road network boundary, wherein if the number is an even number or 0, the point is outside the road network area, and if the number is an odd number, the point is inside the road network area; converting the number of vehicles falling in the road network area into equivalent traffic volume, and determining the number N of the vehicles in the road network and the traffic volume qi (i represents the ith road segment) of each road segment;
(c) thirdly, calculating the distance from each vehicle on each road section to each parking line at each entrance, and finally obtaining the maximum queuing length qLmax(i)Get it95% of the road section length Li is the road section safe queuing length Lsi, and q isLmax(i)Comparing the traffic congestion with Lsi to judge whether the traffic congestion occurs at the upstream intersection or not; if q isLmax(i)≥LsiThe vehicles can be caused to queue and overflow to the upstream intersection, so that the traffic jam occurs at the upstream intersection;
(d) finally, carrying out current limiting control on the boundary traffic; when the road network tends to be congested, simple boundary current limiting control is implemented on the road network;
in the step (d), when the road network tends to be congested, implementing simple boundary current limiting control on the road network, and using the following formula:
in the formula: t-a certain time (h);
Δ t — time step (h);
qG-controlled road network boundary traffic inflow (pcu/h); i-road network time t inflow amount (pcu/h),
Ii(t) is the traffic inflow amount (pcu/h) of the ith inlet at the moment t,
I(t)＝∑Ii(t)；
o (t) -road network traffic volume (pcu/h) at a certain time;
Rin-the ingress rate (allowable ratio of traffic ingress);
according to the allowable inflow amount I of traffic flowi(t + delta t), recalculating the optimal signal period of each boundary intersection after current limiting by adopting a Webster timing method;
the method comprises the following specific steps:
(1) when N (t) is more than or equal to Nc, the road network enters a congestion state, wherein Nc is the critical vehicle number;
(2) when the vehicle enters the congestion state, calculating the maximum number q of queued vehicles at the entrances of all the boundary intersections at the time tLmax(i)(t) if qLmax(i)≥LsiIf the intersection is not provided with the peripheral current limiting strategy, the Webster method is adopted according to the actual traffic demandTiming design is carried out; defining a variable qm(t) is used for counting all boundary intersection flow limiting values which are not suitable for implementing the peripheral flow limiting strategy, and variable qm(t) can be expressed as:
in the formula, s represents the number of the inlet road section of the boundary intersection which is not suitable for current limiting;
if q ism(t) when t is 0, then press RinImplementing a peripheral current limiting strategy on the inrush rate; if q ism(t) > 0, then q ism(t) averagely transferring to other boundary intersections, and readjusting the inflow rate Rin。
2. The MFD and queuing length based road network boundary current limiting control strategy in the Internet of vehicles of claim 1, wherein in step (c), the maximum queuing length q is obtainedLmax(i)The steps are as follows:
(A) firstly, the distance from each vehicle to each entrance parking line is calculated, and the calculation formula is as follows:
in the formula: dij-the distance from the jth vehicle on the ith road segment to the entrance stop line of the road segment;
AJij，AWij-the longitude and latitude of the jth vehicle on the ith road segment;
BJij，BWij-longitude and latitude of an entrance stop line on the ith road section;
(B) after step (a), the set of distances for the vehicle to reach the stop line on each road segment is denoted as D and is represented as:
D＝{dij|i∈L，j∈N}；
the set of instantaneous speeds of the vehicle is denoted V and is represented as:
V＝{vij|i∈L，j∈N}
in the formula, vij is the instantaneous speed of the jth vehicle on the ith road section;
(C) after the step (B), defining the vehicles with the instantaneous speed V less than or equal to 5km/h as the parking queuing vehicles, thereby obtaining the queuing length set of all the parking queuing vehicles on the road section as QLExpressed as:
QL＝{dij，viji belongs to L, j belongs to N, and vij≤5}
Thereby obtaining the maximum queuing length q of the vehicles on the ith road sectionLmax(i)Can be represented as
qLmax(i)＝max(QLi)
Thereby finally obtaining the maximum queuing length qLmax(i)。
3. The MFD and queuing length based road network boundary current limiting control strategy method in the Internet of vehicles of claim 1, wherein R is derivedinThe method comprises the following specific steps:
(1) first, according to
In the formula, n is the total number of the road sections imported from the road network boundary intersection;
x is the number of the inlet road sections which are not suitable for limiting the flow at the road network boundary intersection, and n-x is the number of the inlet road sections which are suitable for limiting the flow at the road network boundary intersection;
Δqmwhen overflow phenomenon exists in the individual boundary road section, the average flow limiting value which is added to other boundary road sections is increased;
(2) secondly, obtaining an inlet current limiting value suitable for current limiting at a road network boundary intersection:
qmy(t+Δt)＝(1-Rin)Iy(t)+Δqm
in the formula, y represents the number of the inlet road section of the boundary intersection suitable for current limiting;
(3) thirdly, obtaining the new inflow amount of each inlet suitable for current limiting at the road network boundary intersection:
q Gy(t+Δt)＝Iy(t)-qmy(t+Δt)
＝Iy(t)-[(1-Rin)Iy(t)+Δqm]
＝RinIy(t)-Δqm
therefore, the new inflow amount of all inlets suitable for current limiting at the road network boundary intersection is obtained:
the boundary intersection actual inflow amount I' (t) suitable for limiting the current is as follows:
(4) finally obtaining a new inrush rate R 'after readjustment'in：
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710550098.1A CN107507415B (en) | 2017-07-06 | 2017-07-06 | Road network boundary current limiting control method based on MFD and queuing length under Internet of vehicles |
| PCT/CN2018/082138 WO2019007126A1 (en) | 2017-07-06 | 2018-04-08 | Mfd and queuing length based road network boundary flow limiting control method under internet of vehicles |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710550098.1A CN107507415B (en) | 2017-07-06 | 2017-07-06 | Road network boundary current limiting control method based on MFD and queuing length under Internet of vehicles |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107507415A CN107507415A (en) | 2017-12-22 |
| CN107507415B true CN107507415B (en) | 2020-12-18 |
Family
ID=60679588
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710550098.1A Active CN107507415B (en) | 2017-07-06 | 2017-07-06 | Road network boundary current limiting control method based on MFD and queuing length under Internet of vehicles |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN107507415B (en) |
| WO (1) | WO2019007126A1 (en) |
Families Citing this family (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107507415B (en) * | 2017-07-06 | 2020-12-18 | 广东交通职业技术学院 | Road network boundary current limiting control method based on MFD and queuing length under Internet of vehicles |
| CN108297878B (en) * | 2018-02-06 | 2020-04-24 | 北京百度网讯科技有限公司 | Vehicle control method, device, vehicle-mounted terminal, server and medium |
| CN108615362A (en) * | 2018-06-22 | 2018-10-02 | 广东交通职业技术学院 | A kind of road traffic flow parameter extracting method under 5G car networkings environment |
| CN109243177B (en) * | 2018-10-11 | 2021-01-01 | 招商局重庆交通科研设计院有限公司 | Road traffic wide-area induction method |
| CN109872538B (en) * | 2019-04-16 | 2021-08-31 | 广东交通职业技术学院 | MFD-based saturated intersection group multilayer boundary iterative learning control method and device |
| CN110766940A (en) * | 2019-09-24 | 2020-02-07 | 重庆交通大学 | Method for evaluating running condition of road signalized intersection |
| CN111429733A (en) * | 2020-03-24 | 2020-07-17 | 浙江工业大学 | Road network traffic signal control method based on macroscopic basic graph |
| CN111932914B (en) * | 2020-06-03 | 2022-05-13 | 东南大学 | Double-layer boundary control method for road network in urban congestion area |
| CN111931317B (en) * | 2020-06-03 | 2022-11-11 | 东南大学 | Regional congestion road network boundary control method based on vehicle-mounted GPS data |
| CN111932888B (en) * | 2020-08-17 | 2021-11-12 | 山东交通学院 | Regional dynamic boundary control method and system for preventing boundary road section queuing overflow |
| CN112609614A (en) * | 2021-01-07 | 2021-04-06 | 广州羽嘉科技有限公司 | Lifting column capable of controlling traffic flow of parking lot |
| CN113487861B (en) * | 2021-06-29 | 2022-07-08 | 东南大学 | Multi-mode traffic network boundary control method |
| CN113706862B (en) * | 2021-08-04 | 2023-05-12 | 兆边(上海)科技有限公司 | Distributed active equalization control method considering road network capacity constraint |
| CN113947905B (en) * | 2021-10-19 | 2022-09-06 | 交通运输部公路科学研究所 | Traffic operation situation sensing method, module and system |
| CN114399908B (en) * | 2021-12-10 | 2024-01-05 | 中交第二公路勘察设计研究院有限公司 | Method for judging lane-level queuing length of road intersection by vehicle-mounted ADAS |
| CN115171374A (en) * | 2022-06-27 | 2022-10-11 | 云控智行(上海)汽车科技有限公司 | Overflow queuing prediction and multi-channel traffic signal coordination control algorithm, system and device based on vehicle-road cooperation |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1154389A1 (en) * | 2000-05-10 | 2001-11-14 | DaimlerChrysler AG | Method to determine the traffic situation in a road network |
| CN106408943A (en) * | 2016-11-17 | 2017-02-15 | 华南理工大学 | Road-network traffic jam discrimination method based on macroscopic fundamental diagram |
| CN106504536A (en) * | 2016-12-09 | 2017-03-15 | 华南理工大学 | A kind of traffic zone coordination optimizing method |
| CN106781558A (en) * | 2017-01-20 | 2017-05-31 | 华南理工大学 | The quick leading method of main channel traffic flow based on macroscopical parent map under car networking |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4003828B2 (en) * | 2002-03-29 | 2007-11-07 | 富士通エフ・アイ・ピー株式会社 | Road control method, road control system, and recording medium |
| JP4793324B2 (en) * | 2007-05-30 | 2011-10-12 | 株式会社日立製作所 | Vehicle monitoring apparatus and vehicle monitoring method |
| CN104021682B (en) * | 2014-05-06 | 2015-12-02 | 东南大学 | Oversaturated intersection selfreparing control method |
| CN105023445A (en) * | 2014-07-04 | 2015-11-04 | 吴建平 | Regional traffic dynamic regulation-control method and system |
| CN107507415B (en) * | 2017-07-06 | 2020-12-18 | 广东交通职业技术学院 | Road network boundary current limiting control method based on MFD and queuing length under Internet of vehicles |
-
2017
- 2017-07-06 CN CN201710550098.1A patent/CN107507415B/en active Active
-
2018
- 2018-04-08 WO PCT/CN2018/082138 patent/WO2019007126A1/en active Application Filing
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1154389A1 (en) * | 2000-05-10 | 2001-11-14 | DaimlerChrysler AG | Method to determine the traffic situation in a road network |
| CN106408943A (en) * | 2016-11-17 | 2017-02-15 | 华南理工大学 | Road-network traffic jam discrimination method based on macroscopic fundamental diagram |
| CN106504536A (en) * | 2016-12-09 | 2017-03-15 | 华南理工大学 | A kind of traffic zone coordination optimizing method |
| CN106781558A (en) * | 2017-01-20 | 2017-05-31 | 华南理工大学 | The quick leading method of main channel traffic flow based on macroscopical parent map under car networking |
Non-Patent Citations (4)
| Title |
|---|
| 基于MFD的路网周边交通控制策略与仿真;林晓辉;《中外公路》;20140831;第34卷(第4期);正文第354页第1-4段 * |
| 基于浮动车数据的道路拥堵状态评价及宏观基本图研究;李梦琦;《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》;20170115(第1期);正文第11-12、23、27、30-31页、表2-1 * |
| 李梦琦.基于浮动车数据的道路拥堵状态评价及宏观基本图研究.《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》.2017,(第1期),第11-30页、表2-1. * |
| 车路协同下基于交通密度的交叉口交通信号控制方法与仿真;林晓辉;《工业工程》;20140831;第17卷(第4期);正文第124-125页第8段、图2 * |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2019007126A1 (en) | 2019-01-10 |
| CN107507415A (en) | 2017-12-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107507415B (en) | Road network boundary current limiting control method based on MFD and queuing length under Internet of vehicles | |
| CN108665707B (en) | Expressway entrance diversion and flow cooperative control method for preventing local traffic jam | |
| CN111341095B (en) | Traffic signal control system and method based on edge side online calculation | |
| CN104021682B (en) | Oversaturated intersection selfreparing control method | |
| CN106781499B (en) | Traffic network efficiency evaluation system | |
| CN107730886A (en) | Dynamic optimization method for traffic signals at urban intersections in Internet of vehicles environment | |
| CN112396834B (en) | Foggy-day expressway coordination control method based on cellular automaton model | |
| CN105679032B (en) | A kind of traffic control sub-area division method under urban traffic flow hypersaturated state | |
| CN113591269A (en) | Special road control method for intelligent networked vehicles on congested road sections based on traffic simulation | |
| CN112435473B (en) | Expressway traffic flow tracing and ramp regulating method combined with historical data | |
| CN103810868A (en) | Traffic overflow inhibition method based on high altitude video information | |
| CN109410599B (en) | Coordination inducing and controlling method for expressway ramps in traffic incident | |
| CN113947900A (en) | Intelligent network connection express way ramp cooperative control system | |
| CN106548632A (en) | A kind of adjacent upstream and downstream signalized intersections queue length method of estimation | |
| CN106530757B (en) | A kind of elevated ramp intelligent signal regulation method | |
| WO2023216793A1 (en) | Dynamic speed limit control method for highway bottleneck section in mixed traffic flow environment | |
| CN105513366B (en) | A kind of intersection traffic behavior decision method | |
| CN111932916A (en) | Control method and control system for dynamic emergency lane of urban road | |
| CN113192344B (en) | Traffic light control method, system and storage medium | |
| CN111815953B (en) | Traffic incident-oriented method for evaluating traffic control effect of highway | |
| CN111932899A (en) | Traffic emergency control method and device based on traffic simulation | |
| CN110047292A (en) | Road section congestion warning method | |
| WO2023035666A1 (en) | Urban road network traffic light control method based on expected reward estimation | |
| CN106846809B (en) | A kind of farthest point calculating method of queuing based on vehicle parking number | |
| CN113870562B (en) | Method for determining highway lane control strategy based on congested road sections |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |