CN110473404B - Cooperative optimization bottom layer control method for mixed traffic flow at urban crossroad - Google Patents
Cooperative optimization bottom layer control method for mixed traffic flow at urban crossroad Download PDFInfo
- Publication number
- CN110473404B CN110473404B CN201910886987.4A CN201910886987A CN110473404B CN 110473404 B CN110473404 B CN 110473404B CN 201910886987 A CN201910886987 A CN 201910886987A CN 110473404 B CN110473404 B CN 110473404B
- Authority
- CN
- China
- Prior art keywords
- vehicle
- time
- road
- conflict
- area
- 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
- 238000005457 optimization Methods 0.000 title claims abstract description 83
- 238000000034 method Methods 0.000 title claims abstract description 78
- 238000011217 control strategy Methods 0.000 claims abstract description 52
- 230000008569 process Effects 0.000 claims abstract description 34
- 230000001133 acceleration Effects 0.000 claims description 54
- 238000012544 monitoring process Methods 0.000 claims description 26
- 238000011144 upstream manufacturing Methods 0.000 claims description 26
- 230000006855 networking Effects 0.000 claims description 12
- 241001122315 Polites Species 0.000 claims description 10
- 238000004088 simulation Methods 0.000 claims description 9
- 230000001186 cumulative effect Effects 0.000 claims description 8
- 230000007704 transition Effects 0.000 claims description 8
- 230000035484 reaction time Effects 0.000 claims description 6
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 claims description 5
- 238000010586 diagram Methods 0.000 description 46
- 238000011160 research Methods 0.000 description 5
- 230000008859 change Effects 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 230000035699 permeability Effects 0.000 description 1
- 238000012827 research and development Methods 0.000 description 1
- 229920006395 saturated elastomer Polymers 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05D—SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- G05D1/00—Control of position, course, altitude or attitude of land, water, air or space vehicles, e.g. using automatic pilots
- G05D1/02—Control of position or course in two dimensions
- G05D1/021—Control of position or course in two dimensions specially adapted to land vehicles
- G05D1/0212—Control of position or course in two dimensions specially adapted to land vehicles with means for defining a desired trajectory
- G05D1/0223—Control of position or course in two dimensions specially adapted to land vehicles with means for defining a desired trajectory involving speed control of the vehicle
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Aviation & Aerospace Engineering (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Automation & Control Theory (AREA)
- Chemical & Material Sciences (AREA)
- Analytical Chemistry (AREA)
- Traffic Control Systems (AREA)
- Control Of Driving Devices And Active Controlling Of Vehicle (AREA)
Abstract
The invention provides a cooperative optimization bottom control method for mixed traffic flow at an urban crossroad, belonging to the field of traffic engineering. The method comprises the following steps: determining a microscopic following model; predicting an initial track of the vehicle; establishing a conflict coordination model aiming at the conflict type of the crossroad; simulating a cooperative control strategy set; judging whether the vehicle can smoothly pass through the conflict area; if the vehicle can pass through smoothly, the vehicle continues to run according to the speed of the microscopic follow-up model; if the vehicle cannot pass through the conflict area smoothly, the specific situation of the vehicle in the process of passing through the conflict area needs to be judged, and a corresponding cooperative control strategy is made; and optimizing the running track of the target vehicle according to the made cooperative control strategy, resolving the optimization problem into an optimal control problem of discrete time state constraint, solving by using a dynamic programming idea to obtain the cooperative optimization control strategy about the target vehicle, acting the cooperative optimization control strategy on the target vehicle, and controlling the running of the target vehicle.
Description
Technical Field
The invention relates to a cooperative optimization bottom control method for mixed traffic flow at an urban crossroad, belonging to the field of traffic engineering.
Background
With the continuous advance of the research and development of the intelligent networking technology, the intelligent networking vehicle can be driven on the road, and the characteristics of intelligence and safety are added, so that the intelligent networking vehicle is certainly popularized, but the traditional manually-driven vehicle cannot be completely replaced for a long time, and therefore, the future road traffic condition is certainly a mixed traffic condition of the intelligent networking vehicle and the traditional manually-driven vehicle. Meanwhile, with the rapid development of the intelligent networking system, research on intelligent networking vehicles is receiving more and more attention.
The plane intersection is the position of a conflict node and a bottleneck of a road traffic network, and the traffic flow control of the intersection is always the core of traffic organization and management. Because of the saturated traffic flow in the urban road and the lack of a very practical and effective intersection traffic control mode, some plane intersections become congestion places and accident multiple points of urban traffic.
Most of the existing research on intelligent networked vehicles only considers the assumed CAV permeability of 100% (i.e. all vehicles are intelligent networked vehicles), but this assumption is not realistic at least in the near future. Meanwhile, the conventional collaborative decision-making research mostly considers the situation of a highway or an urban express way, and the research on the traffic situation of an urban non-signal intersection is less. Therefore, the research on the urban intersection conflict collaborative optimization control in the mixed traffic flow environment is of great significance.
Disclosure of Invention
And defining the vehicle track optimization control problem as a bottom layer problem. The solution of the underlying problem needs to consider specific constraints including road geometric constraints, safety constraints, and vehicle type constraints according to the scene and the optimization objective. The invention provides a method for controlling a mixed traffic flow collaborative optimization bottom layer of an urban crossroad, which is suitable for the urban crossroad without traffic signal lamp indication, and aims to solve the bottom layer problem of the urban crossroad in the mixed traffic state of traditional driving vehicles (namely human driving vehicles) and intelligent internet vehicles (namely automatic driving vehicles). The traditional driving vehicle is a vehicle which cannot be controlled optimally, and the intelligent networked vehicle is a vehicle which can be controlled optimally.
The technical scheme adopted by the invention for realizing the aim is as follows:
a cooperative optimization bottom layer control method for mixed traffic flow at an urban crossroad comprises the following steps:
s1, determining a micro-following model, and describing a following state of the vehicle by using the micro-following model, wherein the following state of the vehicle comprises the speed, the acceleration and the position of the vehicle;
s2, acquiring the time and speed of the vehicle passing through the upstream monitoring point of the conflict area in the mixed traffic flow, and predicting the initial trajectory of the vehicle between the upstream monitoring point and the conflict end point by using the micro-following model; a road section with a certain distance between the upstream monitoring point and the conflict starting point; the collision starting point is positioned between the upstream monitoring point and the collision terminal point; the road sections between the collision starting point and the collision terminal point form a collision area;
s3, adding acceleration constraint, distance constraint and safety constraint to establish a conflict coordination model aiming at the conflict type of the crossroad based on the microcosmic car-following model; the conflict types of the crossroad comprise cross conflict and confluence conflict;
s4, aiming at various situations which can not pass through the conflict area smoothly and possibly occur in the process that the vehicle passes through the conflict area under the mixed traffic flow scene, a cooperative control strategy set is prepared;
s5, judging whether the vehicle can smoothly pass through a conflict area or not by the conflict coordination model based on the vehicle initial track; if the judgment result is that the vehicle can smoothly pass through the conflict area, the vehicle continuously drives according to the speed of the microcosmic following model; if the judgment result is that the vehicle cannot smoothly pass through the conflict area, further judging the specific situation of the vehicle in the process of passing through the conflict area, and making a cooperative control strategy corresponding to the cooperative strategy set simulated in the step S4 for the vehicle according to the specific situation of the vehicle in the process of passing through the conflict area, so as to execute a step S6;
and S6, determining the optimally controlled vehicles participating in the process that the vehicles pass through the conflict area as target vehicles, optimizing the running tracks of the target vehicles according to the cooperative control strategy made in the step S5, resolving the optimization problem into an optimal control problem of discrete time state constraint, solving the cooperative optimization control strategy related to the target vehicles by using a dynamic planning idea, acting the cooperative optimization control strategy related to the target vehicles on the target vehicles, and controlling the running of the target vehicles.
Preferably, the conflict type of the crossroad is cross conflict; the cross conflict means that vehicles in different driving directions run in a cross mode at a large angle; the step S3 specifically includes:
suppose that both the X and Y lanes are one-way lanes and the intersection of the X and Y lanes is (X)C,YC);
Defining a conflict area: determining a collision starting point and a collision end point by combining the geometric length of the road and the microcosmic car-following model, wherein the collision area on the X road is from the collision starting point XcsTo the conflicting terminal XceStopping; collision area self-conflict starting point Y on Y roadcsTo the conflict end point YceIf not, the conflict area is (X)cs,Ycs)~(Xce,Yce);
Defining a control area: control area on X road from vehicle distance conflict starting point XcsControl starting point X of a certain distanceDTo the cross point (X)C,YC) Stopping; control area on Y road from vehicle distance collision starting point YcsControl starting point Y of a certain distanceDTo the cross point (X)C,YC) If not, the control region is (X)D,YD)~(XC,YC) (ii) a The control starting point is positioned between the upstream monitoring point and the collision starting point;
suppose that vehicle k on the X road is in the control zone (X)D,YD)~(XC,YC) The interval between two vehicles that vehicle k will pass through a continuous flow on the Y road; k 'for each of two vehicles of the continuous stream on the Y-road'1And k'2Is represented by, wherein vehicle k'1Denotes a front vehicle, vehicle k'2Representing a rear vehicle;
at time t, the relative distance between vehicle k on the X road and vehicle k' on the Y road is represented by lk,k′(t) denotes, then:
wherein x isk(t) represents the position of the vehicle k on the X road at time t, yk′(t) represents the position of the vehicle k' on the Y road at time t;
u for conflict cooperative utilityk(t) indicating whether the vehicle k can smoothly pass through the collision area on the X road; the conflict cooperative utility Uk(t) is represented as follows:
wherein, | uk(t) | represents the absolute value of the acceleration of the vehicle k on the X road at the time t;denotes vehicle k 'on Y road'2The absolute value of the acceleration at time t;at time t, represents vehicle k ' on the X road and vehicle k ' on the Y road '1The relative distance therebetween;at time t, represents vehicle k ' on the X road and vehicle k ' on the Y road '2The relative distance therebetween;representing a safety body of the intelligent networked vehicle;representing a safety body of a conventionally driven vehicle; bsafeRepresents a maximum allowable deceleration; phiAThe method comprises the following steps of (1) providing an intelligent networked vehicle set; phiHη for conventional driving vehicle1Indicating a safety factor of η2Representing a polite coefficient; the intelligent networked vehicle is an optimally controllable vehicle and is represented by a letter A; the traditional driving vehicle is a vehicle which cannot be controlled optimally and is indicated by a letter H;
polite coefficient η2The expression of (a) is as follows:
wherein v isthIs a given threshold speed, β1And β2Is a constant.
For collaborative decision Ik(t + τ) is represented as follows:
wherein, IkA value of (t + τ) of 1 indicates that the vehicle k can smoothly pass through the collision region at time t + τ; i iskA value of 0 for (t + τ) indicates that vehicle k cannot smoothly pass through the collision zone at time t + τ.
Preferably, the conflict type of the crossroad is confluence conflict; the confluent conflict means that vehicles in different driving directions converge and drive in the same direction at a small angle; the step S3 specifically includes:
suppose that both the X and Y lanes are one-way lanes and the intersection of the X and Y lanes is (X)C,YC);
Defining a conflict area: determining a collision starting point and a collision end point by combining the geometric length of the road and the microcosmic car-following model, wherein the collision area on the X road is from the collision starting point XcsTo the conflicting terminal XceStopping; collision area self-conflict starting point Y on Y roadcsTo the conflict end point YceIf not, the conflict area is (X)cs,Ycs)~(Xce,Yce);
Defining a control area: control area on X road from vehicle distance conflict starting point XcsControl starting point X of a certain distanceDTo the cross point (X)C,YC) Stopping; control area on Y road from vehicle distance collision starting point YcsControl starting point Y of a certain distanceDTo the cross point (X)C,YC) If not, the control region is (X)D,YD)~(XC,YC) (ii) a The control starting point is positioned between the upstream monitoring point and the collision starting point;
suppose that vehicle k on the X road is in the control zone (X)D,YD)~(XC,YC) The interval between two vehicles that vehicle k will pass through a continuous flow on the Y road; k 'for each of two vehicles of the continuous stream on the Y-road'1And k'2Is represented by, wherein vehicle k'1Denotes a front vehicle, vehicle k'2Representing a rear vehicle;
at time t, the relative distance between vehicle k on the X road and vehicle k' on the Y road is represented by lk,k′(t) denotes, then:
when x isk(t)<XCAt the time of-r,
wherein x isk(t) represents the position of the vehicle k on the X road at time t, yk′(t) represents the position of the vehicle k' on the Y road at time t; r represents the turning radius of the vehicle k at the crossroad;
u for conflict cooperative utilityk(t) indicating whether the vehicle k can smoothly pass through the collision area on the X road; the conflict cooperative utility Uk(t) is represented as follows:
wherein, | uk(t) | represents the absolute value of the acceleration of the vehicle k on the X road at the time t;denotes vehicle k 'on Y road'2The absolute value of the acceleration at time t;at time t, represents vehicle k ' on the X road and vehicle k ' on the Y road '1The relative distance therebetween;at time t, represents vehicle k ' on the X road and vehicle k ' on the Y road '2The relative distance therebetween;denotes vehicle k on the X road and vehicle k 'on the Y road'1The vehicle k on the X road is an intelligent networking vehicle;denotes vehicle k on the X road and vehicle k 'on the Y road'1And the vehicle k on the X road is a conventional driving vehicle;denotes vehicle k on the X road and vehicle k 'on the Y road'2The vehicle k on the X road is an intelligent networking vehicle;denotes vehicle k on the X road and vehicle k 'on the Y road'2And the vehicle k on the X road is a conventional driving vehicle; bsafeRepresents a maximum allowable deceleration; phiAThe method comprises the following steps of (1) providing an intelligent networked vehicle set; phiHη for conventional driving vehicle1Indicating a safety factor of η2To representA polite coefficient; the intelligent networked vehicle is an optimally controllable vehicle and is represented by a letter A; the traditional driving vehicle is a vehicle which cannot be controlled optimally and is indicated by a letter H;
polite coefficient η2The expression of (a) is as follows:
wherein v isthIs a given threshold speed, β1And β2Is a constant.
For collaborative decision Ik(t + τ) is represented as follows:
wherein, IkA value of (t + τ) of 1 indicates that the vehicle k can smoothly pass through the collision region at time t + τ; i iskA value of 0 for (t + τ) indicates that vehicle k cannot smoothly pass through the collision zone at time t + τ.
Further, the step S4 specifically includes:
assuming that both the X and Y lanes are one-way lanes, vehicle k on the X lane will pass through the interval between two vehicles of the continuous flow on the Y lane, each with k'1And k'2Is represented by, wherein vehicle k'1Denotes a front vehicle, vehicle k'2Representing a rear vehicle;
for various situations which can occur in the process that vehicles pass through a conflict area in a mixed traffic flow scene, k 'of the vehicles is determined based on the micro-following model'1K 'of vehicle'2The relationship between the conflict areas is divided into the conflict areas which can be smoothly passed and the conflict areas which can not be smoothly passed; the failure to smoothly pass through the collision region is further divided into four cases, the first case is denoted by R1 and represents the vehicles k and k'1The distance between the two parts is too close to satisfy the constraint condition of smoothly passing through the conflict area; the second case is marked as R2 and represents vehicle k and vehicle k'2Too close to each other, failing to meet the requirement of smooth passing through the punchConstraint conditions of the protruding regions; the third case is marked as R3 and represents vehicle k and vehicle k'1And k 'with vehicle'2The distances between the two parts are too close to meet the constraint condition that the two parts can smoothly pass through a conflict area; the fourth case is marked as R4 and represents vehicle k and vehicle k'1And k 'with vehicle'2The basic spacing requirement is satisfied, but the process of passing through the conflict area is not comfortable;
aiming at four conditions that the vehicle can not smoothly pass through a conflict area, the vehicle which can be optimally controlled needs to be cooperatively controlled; the traditional driving vehicle is represented by H and is a vehicle which cannot be optimally controlled; the method comprises the following steps that A represents an intelligent networked vehicle which is an optimally controllable vehicle; n represents no front vehicle or no rear vehicle; and provides the combination sequence of the vehicles as vehicle k'1K 'of vehicle'2;
Based on different vehicle combinations, different vehicle type combinations and the four conditions that the conflict area can not be smoothly passed, a cooperative control strategy set is planned, and the following table shows that:
in the above table, the non-optimization means that the vehicle has no corresponding control strategy under the condition that the vehicle cannot smoothly pass through the conflict area; under the condition that optimization cannot be carried out, when the conflict type of the intersection is cross conflict, the vehicle k on the X road takes the intersection of the X road and the Y road as a stopped virtual front vehicle, continuously decelerates and even stops to wait by following the microcosmic following model, and the vehicle k does not pass through the conflict area until the vehicle interval meeting the passing conflict area appears on the Y road; when the conflict type of the crossroad is confluence conflict, the vehicle k on the X road takes the confluence point of the X road and the Y road as a stopped virtual front vehicle, continuously decelerates along the microcosmic car-following model, even stops and waits until the vehicle interval meeting the passing conflict area appears on the Y road, and the vehicle k passes through the conflict area; the confluence point of the X path and the Y path refers to the position where the X path traffic flow is converged into the Y path traffic flow;
the control state is unknown, and in the case R4 where the collision region cannot be smoothly passed, it is necessary to determine the vehicles k and k'1K 'of vehicle'2In the process of passing through the conflict area, which corresponding vehicles form discomfort, and corresponding control strategies are adopted according to the conditions of R1, R2 and R3 that the vehicles cannot pass through the conflict area smoothly;
the acceleration of the vehicle k is controlled by a decision variable u of the vehicle k at the time tk(t) satisfies:
and v isk(t)+uk(t)τ≤ve;
The control vehicle k decelerates, and a decision variable u of the vehicle k at the time t is usedk(t) satisfies:
and v isk(t)+uk(t)τ≥0;
The uncontrolled vehicle k is a decision variable u for the vehicle k at time tk(t) satisfies:
The control vehicle k'1The acceleration is to make the vehicle k 'at the time t'1Decision variables ofSatisfies the following conditions:
The vehicle k 'is not controlled'1Is to make the vehicle k 'at time t'1Decision variables ofSatisfies the following conditions:
The control vehicle k'2Deceleration is performed by making the vehicle k 'at time t'2Decision variables ofSatisfies the following conditions:
The vehicle k 'is not controlled'2Is to make the vehicle k 'at time t'2Decision variables ofSatisfies the following conditions:
Wherein u isk(t) as a decision variable for the vehicle k at time t, representing the acceleration of the vehicle k at time t;vk(t) is the speed of vehicle k at time t;is the safe following speed (where L is the safe following speed of the vehicle k at the moment t + tau) predicted according to the microcosmic following modelk(t) represents the relative distance between the vehicle k and its following preceding vehicle at time t, vk(t) represents the speed of the vehicle k at time t,representing the speed of the car k at time t before the car k follows);k 'of vehicle at time t'1Is a decision variable of vehicle k'1Acceleration at time t;is vehicle k'1Velocity at time t;is vehicle k 'predicted from the microscopic follow model'1Safe following speed at time t + tau (whereDenotes vehicle k 'at time t'1The relative distance between the car and the car before the car is driven,denotes vehicle k'1At the speed at the time of the t-instant,denotes vehicle k'1The speed of the car before the following at the time t);k 'of vehicle at time t'2Is a decision variable of vehicle k'2At time tAcceleration of the moment;is vehicle k'2Velocity at time t;is vehicle k 'predicted from the microscopic follow model'2Safe following speed at time t + tau (whereDenotes vehicle k 'at time t'2The relative distance between the car and the car before the car is driven,denotes vehicle k'2At the speed at the time of the t-instant,denotes vehicle k'2The speed of the car before the following at the time t); τ is the reaction time of the vehicle driving; v. ofeIs the desired speed.
Further, the step S6 specifically includes:
s6-1, predicting the moment t when the target vehicle enters the control area based on the microcosmic car-following model0The time when the user leaves the control area is tf(ii) a And will t0To tfIs divided into N segments on average in discrete time intervals τ', i.e., N ═ tf-t0) T', defining the control decision time as t0+τ′,t0+2τ′,t0+3τ′,t0+4τ′,…,t0+(N-1)τ′,tf;
S6-2, according to the target vehicle at t0The state of the time, the target vehicle is calculated at t0The set of allowable states at time + τ', and the target vehicle from t0State of time t0The allowable states at time + τ' aggregate the transition costs for each allowable state; said target vehicle is at t0The state at time t includes the target vehicle being at t0Speed and position of time of day;
S6-3, according to the target vehicle at t0The allowable state set at the time + tau' is calculated for the target vehicle at t0The allowable state set at time +2 τ', and the target vehicle from t0State at time + τ' to t0The allowable states at time +2 τ' are grouped into transition costs and cumulative costs for each allowable state;
s6-4, sequentially calculating the target vehicle at t according to the method of the step S6-30+3τ′,t0+4τ′,…,t0+(N-1)τ′,tfThe allowable state set of the time is calculated to obtain tfThe cumulative cost of each allowable state in the time-wise allowable state set;
s6-5, judging that the target vehicle is at tfWhether each allowable state in the allowable state set at the moment meets the condition that the allowable state can smoothly pass through the conflict area or not is judged, and the allowable state meeting the condition is brought into the final allowable state set;
s6-6, selecting the allowable state with the minimum accumulated cost in the final allowable state set as tfThe optimal state of the moment;
s6-7, according to tfThe optimal state of the moment is reversely deduced to obtain t0+τ′,t0+2τ′,t0+3τ′,t0+4τ′,…,t0+(N-1)τ′,tfThe optimal state at each moment, and the control decision corresponding to each optimal state is brought into a cooperative optimization control strategy;
and S6-8, controlling the operation of the target vehicle among the control areas according to the cooperative optimization control strategy.
Furthermore, a microscopic traffic flow simulation environment is constructed, and simulation results before and after optimization under different traffic situations are compared.
Compared with the prior art, the method has the beneficial effects that:
the invention provides a collaborative optimization bottom control method for mixed traffic flow at an urban crossroad, which considers the traffic characteristics of the urban crossroad, adds acceleration constraint, distance constraint and safety constraint to establish a conflict collaborative model aiming at different conflict types at the crossroad based on a microscopic following model, and provides a solving method based on dynamic planning to effectively solve the model. The method of the invention is used for carrying out track optimization control on the intelligent internet vehicles in the mixed traffic flow, can reduce vehicle conflict, and effectively improves the passing efficiency of the crossroad and the passing comfort of the vehicles.
Simulation experiments show that: the method can change the vehicle cooperation sequence, so that the vehicle speed is more stable and the acceleration is more stable. For single driving of a traditional driving vehicle, the operation in the mixed traffic flow is easier and the driving is safer. Meanwhile, compared with the common non-optimized situation, the running distance of the individual in the same passing time is increased by 8-12%.
The present invention will be described in further detail with reference to the following detailed description and the accompanying drawings, which are not intended to limit the scope of the invention.
Drawings
Fig. 1 is a schematic structural diagram of a city intersection in the first and second embodiments of the present invention.
Fig. 2 is a microscopic cooperative trajectory diagram of three vehicles in a cross collision with HHA as a vehicle combination in the second situation (R2) where the vehicles cannot smoothly pass through the collision area and without cooperative optimization control according to an embodiment of the present invention.
Fig. 3 is a microscopic cooperative trajectory diagram of three vehicles in a cross collision with HHA as the vehicle combination in the second situation (R2) where the vehicles cannot smoothly pass through the collision zone and under cooperative optimization control according to the embodiment of the present invention.
Fig. 4 is a microscopic cooperative trajectory diagram of three vehicles in a cross collision, in which the vehicle combination condition is HAA, in a third condition (R3) where the vehicles cannot smoothly pass through the collision area and the cooperative optimization control is absent, according to an embodiment of the present invention.
Fig. 5 is a microscopic cooperative trajectory diagram of three vehicles in the case of the third situation (R3) in which the combination of vehicles is HAA and cannot smoothly pass through the collision area in the case of the cooperative optimization control in the cross collision according to the embodiment of the present invention.
Fig. 6 is a microscopic cooperative trajectory diagram of three vehicles whose vehicle combination condition is HHA in the second merge conflict of the embodiment of the present invention, in the second situation (R2) where the vehicles cannot smoothly pass through the conflict area, and in the situation where there is no cooperative optimization control.
Fig. 7 is a microscopic cooperative trajectory diagram in the second merge conflict of the embodiment of the present invention, in the second situation (R2) in which three vehicles whose vehicle combination situation is HHA cannot smoothly pass through the conflict area, and in the cooperative optimization control situation.
Fig. 8 is a microscopic cooperative trajectory diagram in the first case (R1) in which three vehicles having the combination of vehicles HAA fail to smoothly pass through the collision region in the second merge collision according to the embodiment of the present invention and in the case of no cooperative optimization control.
Fig. 9 is a microscopic cooperative locus diagram in the case of cooperative optimization control in the first case (R1) in which three vehicles having a vehicle combination condition of HAA cannot smoothly pass through the collision region in the second merge collision according to the embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made with reference to the accompanying drawings.
A cooperative optimization bottom layer control method for mixed traffic flow at an urban crossroad comprises the following steps:
s1, determining a micro-following model, and describing a following state of the vehicle by using the micro-following model, wherein the following state of the vehicle comprises the speed, the acceleration and the position of the vehicle;
s2, acquiring the time and speed of the vehicle passing through the upstream monitoring point of the conflict area in the mixed traffic flow, and predicting the initial trajectory of the vehicle between the upstream monitoring point and the conflict end point by using the micro-following model; a road section with a certain distance between the upstream monitoring point and the conflict starting point; the collision starting point is positioned between the upstream monitoring point and the collision terminal point; the road sections between the collision starting point and the collision terminal point form a collision area;
s3, adding acceleration constraint, distance constraint and safety constraint to establish a conflict coordination model aiming at the conflict type of the crossroad based on the microcosmic car-following model; the conflict types of the crossroad comprise cross conflict and confluence conflict;
s4, aiming at various situations which can not pass through the conflict area smoothly and possibly occur in the process that the vehicle passes through the conflict area under the mixed traffic flow scene, a cooperative control strategy set is prepared;
s5, judging whether the vehicle can smoothly pass through a conflict area or not by the conflict coordination model based on the vehicle initial track; if the judgment result is that the vehicle can smoothly pass through the conflict area, the vehicle continuously drives according to the speed of the microcosmic following model; if the judgment result is that the vehicle cannot smoothly pass through the conflict area, further judging the specific situation of the vehicle in the process of passing through the conflict area, and making a cooperative control strategy corresponding to the cooperative strategy set simulated in the step S4 for the vehicle according to the specific situation of the vehicle in the process of passing through the conflict area, so as to execute a step S6;
and S6, determining the optimally controlled vehicles participating in the process that the vehicles pass through the conflict area as target vehicles, optimizing the running tracks of the target vehicles according to the cooperative control strategy made in the step S5, resolving the optimization problem into an optimal control problem of discrete time state constraint, solving the cooperative optimization control strategy related to the target vehicles by using a dynamic planning idea, acting the cooperative optimization control strategy related to the target vehicles on the target vehicles, and controlling the running of the target vehicles.
Example one
A cooperative optimization bottom layer control method for mixed traffic flow at an urban crossroad comprises the following steps:
and S1, determining a micro-following model, and describing the following state of the vehicle by using the micro-following model, wherein the following state of the vehicle comprises the speed, the acceleration and the position of the vehicle.
The present example uses the Gipps following model, which is as follows:
v(t+τ)=min(ve,v(t)+aτ,vsafe),
x(t+τ)=x(t)+v(t)τ+0.5u(t)τ2,
the velocity of the vehicle at time t + τ is denoted by v (t + τ), where veV (t) + a τ represents the velocity obtained by acceleration at a constant acceleration a, v (t) + a τ being the desired velocitysafeIndicating a minimum safe speed. τ is the reaction time of the vehicle driving; b is a constant deceleration, and the vehicle performs deceleration at the constant deceleration b by default when braking and decelerating; v (t) represents the speed of the vehicle at time t; u (t) represents the acceleration of the vehicle at time t; x (t) represents the position of the vehicle at time t; v. oflead(t) represents the speed of the preceding vehicle followed by the vehicle at time t; x is the number of0Represents the minimum safe distance between the vehicle and the preceding vehicle followed by the vehicle (even if the preceding vehicle suddenly brakes to decelerate to a complete stop (worst case), the distance between the vehicle and the preceding vehicle followed by the vehicle needs to be greater than the minimum safe distance x0)。
S2, acquiring the time and speed of the vehicle passing through the upstream monitoring point of the conflict area in the mixed traffic flow, and predicting the initial trajectory of the vehicle between the upstream monitoring point and the conflict end point by using the micro-following model; a road section with a certain distance between the upstream monitoring point and the conflict starting point; the collision starting point is positioned between the upstream monitoring point and the collision terminal point; the link between the collision start point and the collision end point constitutes a collision area.
S3, adding acceleration constraint, distance constraint and safety constraint to establish a conflict coordination model aiming at the conflict type of the crossroad based on the microcosmic car-following model; the conflict type of the crossroad is cross conflict; the cross collision means that vehicles in different driving directions run across each other at a large angle. The method specifically comprises the following steps:
fig. 1 is a schematic structural diagram of an urban crossroad.
Suppose X way andy roads are all one-way lanes, and the intersection point of the X road and the Y road is (X)C,YC);
Defining a conflict area: determining a collision starting point and a collision end point by combining the geometric length of the road and the microcosmic car-following model, wherein the collision area on the X road is from the collision starting point XcsTo the conflicting terminal XceStopping; collision area self-conflict starting point Y on Y roadcsTo the conflict end point YceIf not, the conflict area is (X)cs,Ycs)~(Xce,Yce);
Defining a control area: control area on X road from vehicle distance conflict starting point XcsControl starting point X of a certain distanceDTo the cross point (X)C,YC) Stopping; control area on Y road from vehicle distance collision starting point YcsControl starting point Y of a certain distanceDTo the cross point (X)C,YC) If not, the control region is (X)D,YD)~(XC,YC) (ii) a The control starting point is positioned between the upstream monitoring point and the collision starting point;
suppose that vehicle k on the X road is in the control zone (X)D,YD)~(XC,YC) The interval between two vehicles that vehicle k will pass through a continuous flow on the Y road; k 'for each of two vehicles of the continuous stream on the Y-road'1And k'2Is represented by, wherein vehicle k'1Denotes a front vehicle, vehicle k'2Representing a rear vehicle;
at time t, the relative distance between vehicle k on the X road and vehicle k' on the Y road is represented by lk,k' (t) denotes that:
wherein x isk(t) represents the position of the vehicle k on the X road at time t, yk′(t) represents the position of the vehicle k' on the Y road at time t;
u for conflict cooperative utilityk(t) is used to reflect whether the vehicle k can smoothly pass through the X roadA overshoot area; the conflict cooperative utility Uk(t) is represented as follows:
wherein, | uk(t) | represents the absolute value of the acceleration of the vehicle k on the X road at the time t;denotes vehicle k 'on Y road'2The absolute value of the acceleration at time t;at time t, represents vehicle k ' on the X road and vehicle k ' on the Y road '1The relative distance therebetween;at time t, represents vehicle k ' on the X road and vehicle k ' on the Y road '2The relative distance therebetween;representing a safety body of the intelligent networked vehicle;representing a safety body of a conventionally driven vehicle; bsafeRepresents a maximum allowable deceleration; phiAThe method comprises the following steps of (1) providing an intelligent networked vehicle set; phiHη for conventional driving vehicle1Indicating a safety factor of η2Representing a polite coefficient; the intelligent networked vehicle is an optimally controllable vehicle and is represented by a letter A; the conventional driving vehicle is a non-optimally controllable vehicle and is denoted by the letter H.
Polite coefficient η2The expression of (a) is as follows:
wherein v isthIs a given threshold speed, β1And β2Is a constant.
For collaborative decision Ik(t + τ) is represented as follows:
wherein, IkA value of (t + τ) of 1 indicates that the vehicle k can smoothly pass through the collision region at time t + τ; i iskA value of 0 for (t + τ) indicates that vehicle k cannot smoothly pass through the collision zone at time t + τ.
And S4, aiming at various situations which can occur in the process that vehicles pass through the conflict area in the mixed traffic flow scene and can not pass through the conflict area smoothly, simulating a cooperative control strategy set. The method specifically comprises the following steps:
assuming that both the X and Y lanes are one-way lanes, vehicle k on the X lane will pass through the interval between two vehicles of the continuous flow on the Y lane, each with k'1And k'2Is represented by, wherein vehicle k'1Denotes a front vehicle, vehicle k'2Representing a rear vehicle;
for various situations which can occur in the process that vehicles pass through a conflict area in a mixed traffic flow scene, k 'of the vehicles is determined based on the micro-following model'1K 'of vehicle'2The relationship between the conflict areas is divided into the conflict areas which can be smoothly passed and the conflict areas which can not be smoothly passed; the failure to smoothly pass through the collision region is further divided into four cases, the first case is denoted by R1 and represents the vehicles k and k'1The distance between the two parts is too close to satisfy the constraint condition of smoothly passing through the conflict area; the second case is marked as R2 and represents vehicle k and vehicle k'2The distance between the two parts is too close to satisfy the constraint condition of smoothly passing through the conflict area; the third case is marked as R3 and represents vehicle k and vehicle k'1And k 'with vehicle'2The distances between the two parts are too close to meet the constraint condition that the two parts can smoothly pass through a conflict area; the fourth case is marked as R4 and represents vehicle k and vehicle k'1And k 'with vehicle'2The basic spacing requirement is satisfied, but the process of passing through the conflict area is not comfortable;
aiming at four conditions that the vehicle can not smoothly pass through a conflict area, the vehicle which can be optimally controlled needs to be cooperatively controlled; the traditional driving vehicle is represented by H and is a vehicle which cannot be optimally controlled; the method comprises the following steps that A represents an intelligent networked vehicle which is an optimally controllable vehicle; n represents no front vehicle or no rear vehicle; and provides the combination sequence of the vehicles as vehicle k'1K 'of vehicle'2;
Based on different vehicle combinations, different vehicle type combinations and the four conditions that the conflict area can not be smoothly passed, a cooperative control strategy set is planned, and the following table shows that:
in the above table, the non-optimization means that the vehicle has no corresponding control strategy under the condition that the vehicle cannot smoothly pass through the conflict area; under the condition that optimization cannot be carried out, when the conflict type of the intersection is cross conflict, the vehicle k on the X road takes the intersection of the X road and the Y road as a stopped virtual front vehicle, continuously decelerates and even stops to wait by following the microcosmic following model, and the vehicle k does not pass through the conflict area until the vehicle interval meeting the passing conflict area appears on the Y road;
the control state is unknown, and in the case R4 where the collision region cannot be smoothly passed, it is necessary to determine the vehicles k and k'1K 'of vehicle'2In the process of passing through the conflict area, which corresponding vehicles form discomfort, and corresponding control strategies are adopted according to the conditions of R1, R2 and R3 that the vehicles cannot pass through the conflict area smoothly;
the acceleration of the vehicle k is controlled by a decision variable u of the vehicle k at the time tk(t) satisfies:
and v isk(t)+uk(t)τ≤ve;
The control vehicle k decelerates, and a decision variable u of the vehicle k at the time t is usedk(t) satisfies:
and v isk(t)+uk(t)τ≥0;
The uncontrolled vehicle k is a decision variable u for the vehicle k at time tk(t) satisfies:
The control vehicle k'1The acceleration is to make the vehicle k 'at the time t'1Decision variables ofSatisfies the following conditions:
The vehicle k 'is not controlled'1Is to make the vehicle k 'at time t'1Decision variables ofSatisfies the following conditions:
The control vehicle k'2Deceleration is performed by making the vehicle k 'at time t'2Decision variables ofSatisfies the following conditions:
The vehicle k 'is not controlled'2Is to make the vehicle k 'at time t'2Decision variables ofSatisfies the following conditions:
Wherein u isk(t) as a decision variable for the vehicle k at time t, representing the acceleration of the vehicle k at time t; v. ofk(t) is the speed of vehicle k at time t;is the safe following speed of the vehicle k at the moment of t + tau predicted according to the microcosmic following model;k 'of vehicle at time t'1Is a decision variable of vehicle k'1Acceleration at time t;is vehicle k'1Velocity at time t;is vehicle k 'predicted from the microscopic follow model'1Safe following speed at time t + τ;k 'of vehicle at time t'2Is a decision variable of vehicle k'2Acceleration at time t;is vehicle k'2Velocity at time t;is vehicle k 'predicted from the microscopic follow model'2Safe following speed at time t + τ; τ is the reaction time of the vehicle driving; v. ofeIs the desired speed.
S5, judging whether the vehicle can smoothly pass through a conflict area or not by the conflict coordination model based on the vehicle initial track; if the judgment result is that the vehicle can smoothly pass through the conflict area, the vehicle continuously drives according to the speed of the microcosmic following model; if the determination result is that the vehicle cannot smoothly pass through the collision area, it is necessary to further determine the specific situation of the vehicle in the process of passing through the collision area, and perform the cooperative control strategy corresponding to the cooperative strategy set formulated in step S4 on the vehicle according to the specific situation of the vehicle in the process of passing through the collision area, so as to execute step S6.
And S6, determining the optimally controlled vehicles participating in the process that the vehicles pass through the conflict area as target vehicles, optimizing the running tracks of the target vehicles according to the cooperative control strategy made in the step S5, resolving the optimization problem into an optimal control problem of discrete time state constraint, solving the cooperative optimization control strategy related to the target vehicles by using a dynamic planning idea, acting the cooperative optimization control strategy related to the target vehicles on the target vehicles, and controlling the running of the target vehicles. The method specifically comprises the following steps:
s6-1, predicting the moment t when the target vehicle enters the control area based on the microcosmic car-following model0The time when the user leaves the control area is tf(ii) a And will t0To tfIs divided into N segments on average in discrete time intervals τ', i.e., N ═ tf-t0) T', defining the control decision time as t0+τ′,t0+2τ′,t0+3τ′,t0+4τ′,…,t0+(N-1)τ′,tf;
S6-2, according to the target vehicle at t0The state of the time, the target vehicle is calculated at t0The set of allowable states at time + τ', and the target vehicle from t0State of time t0The allowable states at time + τ' aggregate the transition costs for each allowable state; said target vehicle is at t0The state at time t includes the target vehicle being at t0Speed and position of the moment;
s6-3, according to the target vehicle at t0The allowable state set at the time + tau' is calculated for the target vehicle at t0The allowable state set at time +2 τ', and the target vehicle from t0State at time + τ' to t0The allowable states at time +2 τ' are grouped into transition costs and cumulative costs for each allowable state;
s6-4, sequentially calculating the target vehicle at t according to the method of the step S6-30+3τ′,t0+4τ′,…,t0+(N-1)τ′,tfThe allowable state set of the time is calculated to obtain tfThe cumulative cost of each allowable state in the time-wise allowable state set;
s6-5, judging that the target vehicle is at tfWhether each allowable state in the allowable state set at the moment meets the condition that the allowable state can smoothly pass through the conflict area or not is judged, and the allowable state meeting the condition is brought into the final allowable state set;
s6-6, selecting the allowable state with the minimum accumulated cost in the final allowable state set as tfOptimal state of the moment;
S6-7, according to tfThe optimal state of the moment is reversely deduced to obtain t0+τ′,t0+2τ′,t0+3τ′,t0+4τ′,…,t0+(N-1)τ′,tfThe optimal state at each moment, and the control decision corresponding to each optimal state is brought into a cooperative optimization control strategy;
and S6-8, controlling the operation of the target vehicle among the control areas according to the cooperative optimization control strategy.
The method of the invention constructs a microscopic traffic flow simulation environment through Python, and realizes the parameters and values of the simulation experiment environment of the mixed traffic flow of the urban crossroads (the structure of which is shown in figure 1) by programming as shown in the following table:
FIG. 2 is a microscopic cooperative locus diagram of three vehicles in a cross collision, with a vehicle combination HHA, in a second situation (R2) where the vehicles cannot smoothly pass through a collision area and without cooperative optimization control, wherein (a) is a position-time relationship diagram, (b) is a speed-time relationship diagram, and (c) is an acceleration-time relationship diagram, and the time unit in the diagram is s, the position unit is m, the speed unit is m/s, and the acceleration unit is m/s2。
FIG. 3 is a microscopic cooperative locus diagram in the case of cooperative optimization control in the second case (R2) in which three vehicles having a vehicle combination condition HHA cannot smoothly pass through a collision area in a cross collision, wherein (a) is a position-time relationship diagram, (b) is a speed-time relationship diagram, and (c) is an acceleration-time relationship diagram, and the time unit in the diagram is s, the position unit is m, the speed unit is m/s, and the acceleration unit is m/s2。
FIG. 4 is a microscopic cooperative locus diagram of three vehicles in a cross collision, in which the combination of vehicles is HAA, in a third situation (R3) where the vehicles cannot smoothly pass through the collision region, and in the case of no cooperative optimization control, wherein (a) is a position-time relationship diagram, (b) is a speed-time relationship diagram, and (c) is an acceleration-time relationship diagramA time diagram, and the time unit is s, the position unit is m, the speed unit is m/s, and the acceleration unit is m/s2。
FIG. 5 is a microscopic cooperative locus diagram in a cooperative optimization control situation in a third situation (R3) in which three vehicles in a combined vehicle situation of HAA cannot smoothly pass through a collision area in a cross collision, wherein (a) is a position-time relationship diagram, (b) is a speed-time relationship diagram, and (c) is an acceleration-time relationship diagram, and the time unit in the diagram is s, the position unit is m, the speed unit is m/s, and the acceleration unit is m/s2。
In the comparison graph before and after the cross conflict optimization, it is found that: the speed-time relation graph can be obtained by comparing, under the cooperative optimization control, the speed change degrees of the three vehicles become smaller, and the vehicle speed is more stable; the acceleration-time relation graph can be obtained by comparing, and the acceleration is relatively stable without large acceleration and deceleration of the vehicle adopting the cooperative optimization control strategy. Meanwhile, under the condition of no cooperative optimization control, when a corresponding traditional driving vehicle passes through a conflict area, due to the fact that other vehicles participating in the conflict process are excessively decelerated, the vehicle needs to be accelerated and recovered to return to the original vehicle speed to pass through the conflict area, and therefore a driver of the traditional driving vehicle needs to be greatly and frequently accelerated and decelerated to be switched to cooperate with the traditional driving vehicle, driving operation of the traditional driving vehicle is complicated, and great unsafety is brought to vehicle driving; under cooperative optimization control, most of the conventional driving vehicles only adopt a deceleration mode to achieve the purpose of mutual cooperative cooperation when passing through a conflict area, so that the driving is obviously safe, comfortable and reasonable.
In general, by using the collaborative optimization bottom layer control method, the overall traffic flow can be more stable, the running cost is lower, and the driving operation becomes more stable and safer for the single driving of the traditional driving vehicle.
Example two
A cooperative optimization bottom layer control method for mixed traffic flow at an urban crossroad comprises the following steps:
and S1, determining a micro-following model, and describing the following state of the vehicle by using the micro-following model, wherein the following state of the vehicle comprises the speed, the acceleration and the position of the vehicle.
The present example uses the Gipps following model, which is as follows:
v(t+τ)=min(ve,v(t)+aτ,vsafe),
x(t+τ)=x(t)+v(t)τ+0.5u(t)τ2,
the velocity of the vehicle at time t + τ is denoted by v (t + τ), where veV (t) + a τ represents the velocity obtained by acceleration at a constant acceleration a, v (t) + a τ being the desired velocitysafeIndicating a minimum safe speed. τ is the reaction time of the vehicle driving; b is a constant deceleration, and the vehicle performs deceleration at the constant deceleration b by default when braking and decelerating; v (t) represents the speed of the vehicle at time t; u (t) represents the acceleration of the vehicle at time t; x (t) represents the position of the vehicle at time t; v. oflead(t) represents the speed of the preceding vehicle followed by the vehicle at time t; x is the number of0Represents the minimum safe distance between the vehicle and the preceding vehicle followed by the vehicle, and even if the preceding vehicle suddenly brakes and decelerates to a complete stop (worst case), the distance between the vehicle and the preceding vehicle followed by the vehicle needs to be larger than the minimum safe distance x0。
S2, acquiring the time and speed of the vehicle passing through the upstream monitoring point of the conflict area in the mixed traffic flow, and predicting the initial trajectory of the vehicle between the upstream monitoring point and the conflict end point by using the micro-following model; a road section with a certain distance between the upstream monitoring point and the conflict starting point; the collision starting point is positioned between the upstream monitoring point and the collision terminal point; the link between the collision start point and the collision end point constitutes a collision area.
S3, adding acceleration constraint, distance constraint and safety constraint to establish a conflict coordination model aiming at the conflict type of the crossroad based on the microcosmic car-following model; the conflict type of the crossroad is confluence conflict; the confluent collision means that vehicles in different driving directions travel together in the same direction at a small angle. The method specifically comprises the following steps:
fig. 1 is a schematic structural diagram of an urban crossroad.
Suppose that both the X and Y lanes are one-way lanes and the intersection of the X and Y lanes is (X)C,YC);
Defining a conflict area: determining a collision starting point and a collision end point by combining the geometric length of the road and a microcosmic car-following model, wherein the collision area on the X road is from a collision starting point XcsTo the conflicting terminal XceStopping; collision area self-conflict starting point Y on Y roadcsTo the conflict end point YceIf not, the conflict area is (X)cs,Ycs)~(Xce,Yce);
Defining a control area: control area on X road from vehicle distance conflict starting point XcsControl starting point X of a certain distanceDTo the cross point (X)C,YC) Stopping; control area on Y road from vehicle distance collision starting point YcsControl starting point Y of a certain distanceDTo the cross point (X)C,YC) If not, the control region is (X)D,YD)~(XC,YC) (ii) a The control starting point is positioned between the upstream monitoring point and the collision starting point;
suppose that vehicle k on the X road is in the control zone (X)D,YD)~(XC,YC) The interval between two vehicles that vehicle k will pass through a continuous flow on the Y road; k 'for each of two vehicles of the continuous stream on the Y-road'1And k'2Is represented by, wherein vehicle k'1Denotes a front vehicle, vehicle k'2Representing a rear vehicle;
at time t, the relative distance between vehicle k on the X road and vehicle k' on the Y road is represented by lk,k′(t) denotes, then:
when x isk(t)<XCAt the time of-r,
wherein x isk(t) represents the position of the vehicle k on the X road at time t, yk′(t) represents the position of the vehicle k' on the Y road at time t; r represents the turning radius of the vehicle k at the crossroad;
u for conflict cooperative utilityk(t) indicating whether the vehicle k can smoothly pass through the collision area on the X road; the conflict cooperative utility Uk(t) is represented as follows:
wherein, | uk(t) | represents the absolute value of the acceleration of the vehicle k on the X road at the time t;denotes vehicle k 'on Y road'2The absolute value of the acceleration at time t;at time t, represents vehicle k ' on the X road and vehicle k ' on the Y road '1The relative distance therebetween;at time t, represents vehicle k ' on the X road and vehicle k ' on the Y road '2The relative distance therebetween;denotes vehicle k on the X road and vehicle k 'on the Y road'1The vehicle k on the X road is an intelligent networking vehicle;denotes vehicle k on the X road and vehicle k 'on the Y road'1And the vehicle k on the X road is a conventional driving vehicle;denotes vehicle k on the X road and vehicle k 'on the Y road'2The vehicle k on the X road is an intelligent networking vehicle;denotes vehicle k on the X road and vehicle k 'on the Y road'2And the vehicle k on the X road is a conventional driving vehicle; bsafeRepresents a maximum allowable deceleration; phiAThe method comprises the following steps of (1) providing an intelligent networked vehicle set; phiHη for conventional driving vehicle1Indicating a safety factor of η2Representing a polite coefficient; the intelligent networked vehicle is an optimally controllable vehicle and is represented by a letter A; the conventional driving vehicle is a non-optimally controllable vehicle and is denoted by the letter H.
Polite coefficient η2The expression of (a) is as follows:
wherein v isthIs a given speed threshold, β1And β2Is a constant.
For collaborative decision Ik(t + τ) is represented as follows:
wherein, IkA value of (t + τ) of 1 indicates that the vehicle k can smoothly pass through the collision region at time t + τ; i iskA value of 0 for (t + τ) indicates that vehicle k cannot smoothly pass through the collision zone at time t + τ.
And S4, aiming at various situations which can occur in the process that vehicles pass through the conflict area in the mixed traffic flow scene and can not pass through the conflict area smoothly, simulating a cooperative control strategy set. The method specifically comprises the following steps:
assuming that both the X and Y lanes are one-way lanes, vehicle k on the X lane will pass through the interval between two vehicles of the continuous flow on the Y lane, each with k'1And k'2Is represented by, wherein vehicle k'1Denotes a front vehicle, vehicle k'2Representing a rear vehicle;
for various situations which can occur in the process that vehicles pass through a conflict area in a mixed traffic flow scene, k 'of the vehicles is determined based on the micro-following model'1K 'of vehicle'2The relationship between the conflict areas is divided into the conflict areas which can be smoothly passed and the conflict areas which can not be smoothly passed; the failure to smoothly pass through the collision region is further divided into four cases, the first case is denoted by R1 and represents the vehicles k and k'1The distance between the two parts is too close to satisfy the constraint condition of smoothly passing through the conflict area; the second case is marked as R2 and represents vehicle k and vehicle k'2The distance between the two parts is too close to satisfy the constraint condition of smoothly passing through the conflict area; the third case is marked as R3 and represents vehicle k and vehicle k'1And k 'with vehicle'2The distances between the two parts are too close to meet the constraint condition that the two parts can smoothly pass through a conflict area; the fourth case is marked as R4 and represents vehicle k and vehicle k'1And k 'with vehicle'2The basic spacing requirement is satisfied, but the process of passing through the conflict area is not comfortable;
aiming at four conditions that the vehicle can not smoothly pass through a conflict area, the vehicle which can be optimally controlled needs to be cooperatively controlled; by using H-metersThe traditional driving vehicle is a vehicle which cannot be controlled optimally; the method comprises the following steps that A represents an intelligent networked vehicle which is an optimally controllable vehicle; n represents no front vehicle or no rear vehicle; and provides the combination sequence of the vehicles as vehicle k'1K 'of vehicle'2;
Based on different vehicle combinations, different vehicle type combinations and the four conditions that the conflict area can not be smoothly passed, a cooperative control strategy set is planned, and the following table shows that:
in the above table, the non-optimization means that the vehicle has no corresponding control strategy under the condition that the vehicle cannot smoothly pass through the conflict area; under the condition that optimization cannot be carried out, when the conflict type of the intersection is confluence conflict, a vehicle k on the X road takes a confluence point of the X road and the Y road as a stopped virtual front vehicle, and continuously decelerates or even stops to wait by following the microcosmic following model until a vehicle interval meeting a passable conflict area appears on the Y road, and the vehicle k does not pass through the conflict area; the confluence point of the X path and the Y path refers to the position where the X path traffic flow is converged into the Y path traffic flow;
the control state is unknown, and in the case R4 where the collision region cannot be smoothly passed, it is necessary to determine the vehicles k and k'1K 'of vehicle'2In the process of passing through the conflict area, which corresponding vehicles form discomfort, and corresponding control strategies are adopted according to the conditions of R1, R2 and R3 that the vehicles cannot pass through the conflict area smoothly;
the acceleration of the vehicle k is controlled by a decision variable u of the vehicle k at the time tk(t) satisfies:
And v isk(t)+uk(t)τ≤ve;
The control vehicle k decelerates, and a decision variable u of the vehicle k at the time t is usedk(t) satisfies:
and v isk(t)+uk(t)τ≥0;
The uncontrolled vehicle k is a decision variable u for the vehicle k at time tk(t) satisfies:
The control vehicle k'1The acceleration is to make the vehicle k 'at the time t'1Decision variables ofSatisfies the following conditions:
The vehicle k 'is not controlled'1Is to make the vehicle k 'at time t'1Decision variables ofSatisfies the following conditions:
The control vehicle k'2Deceleration is performed by making the vehicle k 'at time t'2Decision variables ofSatisfies the following conditions:
The vehicle k 'is not controlled'2Is to make the vehicle k 'at time t'2Decision variables ofSatisfies the following conditions:
Wherein u isk(t) as a decision variable for the vehicle k at time t, representing the acceleration of the vehicle k at time t; v. ofk(t) is the speed of vehicle k at time t;is the safe following speed of the vehicle k at the moment of t + tau predicted according to the microcosmic following model;k 'of vehicle at time t'1Is a decision variable of vehicle k'1Acceleration at time t;is vehicle k'1Velocity at time t;is vehicle k 'predicted from the microscopic follow model'1Safe following speed at time t + τ;k 'of vehicle at time t'2Is a decision variable of vehicle k'2Acceleration at time t;is vehicle k'2Velocity at time t;is vehicle k 'predicted from the microscopic follow model'2Safe following speed at time t + τ; τ is the reaction time of the vehicle driving; v. ofeIs the desired speed.
S5, judging whether the vehicle can smoothly pass through a conflict area or not by the conflict coordination model based on the vehicle initial track; if the judgment result is that the vehicle can smoothly pass through the conflict area, the vehicle continuously drives according to the speed of the microcosmic following model; if the judgment result is that the vehicle cannot smoothly pass through the conflict area, further judging the specific situation of the vehicle in the process of passing through the conflict area, and making a cooperative control strategy corresponding to the cooperative strategy set simulated in the step S4 for the vehicle according to the specific situation of the vehicle in the process of passing through the conflict area, so as to execute a step S6;
and S6, determining the optimally controlled vehicles participating in the process that the vehicles pass through the conflict area as target vehicles, optimizing the running tracks of the target vehicles according to the cooperative control strategy made in the step S5, resolving the optimization problem into an optimal control problem of discrete time state constraint, solving the cooperative optimization control strategy related to the target vehicles by using a dynamic planning idea, acting the cooperative optimization control strategy related to the target vehicles on the target vehicles, and controlling the running of the target vehicles. The method specifically comprises the following steps:
s6-1, predicting the moment t when the target vehicle enters the control area based on the microcosmic car-following model0The time when the user leaves the control area is tf(ii) a And will t0To tfIs divided into N segments on average in discrete time intervals τ', i.e., N ═ tf-t0) T', defining the control decision time as t0+τ′,t0+2τ′,t0+3τ′,t0+4τ′,…,t0+(N-1)τ′,tf;
S6-2, according to the target vehicle at t0The state of the time, the target vehicle is calculated at t0The set of allowable states at time + τ', and the target vehicle from t0State of time t0The allowable states at time + τ' aggregate the transition costs for each allowable state; said target vehicle is at t0The state at time t includes the target vehicle being at t0Speed and position of the moment;
s6-3, according to the target vehicle at t0The allowable state set at the time + tau' is calculated for the target vehicle at t0The allowable state set at time +2 τ', and the target vehicle from t0State at time + τ' to t0The allowable states at time +2 τ' are grouped into transition costs and cumulative costs for each allowable state;
s6-4, sequentially calculating the target vehicle at t according to the method of the step S6-30+3τ′,t0+4τ′,…,t0+(N-1)τ′,tfThe allowable state set of the time is calculated to obtain tfThe cumulative cost of each allowable state in the time-wise allowable state set;
s6-5, judging that the target vehicle is at tfWhether each allowable state in the allowable state set at the moment meets the condition that the allowable state can smoothly pass through the conflict area or not is judged, and the allowable state meeting the condition is brought into the final allowable state set;
s6-6, selecting the allowable state with the minimum accumulated cost in the final allowable state set as tfThe optimal state of the moment;
s6-7, according to tfOptimal state of the momentBackward thrust to obtain t0+τ′,t0+2τ′,t0+3τ′,t0+4τ′,…,t0+(N-1)τ′,tfThe optimal state at each moment, and the control decision corresponding to each optimal state is brought into a cooperative optimization control strategy;
and S6-8, controlling the operation of the target vehicle among the control areas according to the cooperative optimization control strategy.
The method constructs a microscopic traffic flow simulation environment through Python, and realizes the parameters and values of the simulation experiment environment of the mixed traffic flow of the urban crossroads (the structure of which is shown in figure 1) by programming as shown in the following table:
FIG. 6 is a microscopic cooperative locus diagram in the case of no cooperative optimization control in the second case (R2) in which three vehicles having a vehicle combination HHA cannot smoothly pass through a collision area in a confluent collision, wherein (a) is a position-time relationship diagram, (b) is a speed-time relationship diagram, and (c) is an acceleration-time relationship diagram, and the time unit in the diagram is s, the position unit is m, the speed unit is m/s, and the acceleration unit is m/s2。
FIG. 7 is a microscopic cooperative locus diagram in the cooperative optimization control in the second case (R2) in which three vehicles having a vehicle combination HHA cannot smoothly pass through the collision area in the merge collision, wherein (a) is a position-time relationship diagram, (b) is a speed-time relationship diagram, and (c) is an acceleration-time relationship diagram, and the time unit in the diagram is s, the position unit is m, the speed unit is m/s, and the acceleration unit is m/s2。
FIG. 8 is a microscopic cooperative locus diagram of three vehicles in a merge collision, the combination of vehicles of which is HAA, in the first case (R1) where the vehicles cannot smoothly pass through the collision region, and in the case of no cooperative optimization control, in whichThe graph has time unit of s, position unit of m, speed unit of m/s and acceleration unit of m/s2。
FIG. 9 is a microscopic cooperative locus diagram in the cooperative optimization control in the first case (R1) in which three vehicles in the combination of vehicles HAA cannot smoothly pass through the collision region in the merge collision, wherein (a) is a position-time relationship diagram, (b) is a velocity-time relationship diagram, and (c) is an acceleration-time relationship diagram, and the time unit in the diagram is s, the position unit is m, the velocity unit is m/s, and the acceleration unit is m/s2。
In the comparison graph before and after confluence conflict optimization, the following results are found: the speed-time relation graph can be obtained by comparing, under the cooperative optimization control, the speed change degrees of the three vehicles become smaller, and the vehicle speed is more stable; the acceleration-time relation graph can be obtained by comparing, and the acceleration is relatively stable without large acceleration and deceleration of the vehicle adopting the cooperative optimization control strategy. Meanwhile, under the condition of no cooperative optimization control, when a corresponding traditional driving vehicle passes through a conflict area, due to the fact that other vehicles participating in the conflict process are excessively decelerated, the vehicle needs to be accelerated and recovered to return to the original vehicle speed to pass through the conflict area, and therefore a driver of the traditional driving vehicle needs to be greatly and frequently accelerated and decelerated to be switched to cooperate with the traditional driving vehicle, driving operation of the traditional driving vehicle is complicated, and great unsafety is brought to vehicle driving; under cooperative optimization control, most of the conventional driving vehicles only adopt a deceleration mode to achieve the purpose of mutual cooperative cooperation when passing through a conflict area, so that the driving is obviously safe, comfortable and reasonable.
In general, by using the collaborative optimization bottom layer control method, the overall traffic flow can be more stable, the running cost is lower, and the driving operation becomes more stable and safer for the single driving of the traditional driving vehicle.
While the present invention has been described above by way of example with reference to the accompanying drawings, it is to be understood that the invention is not limited to the specific embodiments shown herein.
Claims (5)
1. A collaborative optimization bottom layer control method for mixed traffic flow at an urban crossroad is characterized by comprising the following steps:
s1, determining a micro-following model, and describing a following state of the vehicle by using the micro-following model, wherein the following state of the vehicle comprises the speed, the acceleration and the position of the vehicle;
s2, acquiring the time and speed of the vehicle passing through the upstream monitoring point of the conflict area in the mixed traffic flow, and predicting the initial trajectory of the vehicle between the upstream monitoring point and the conflict end point by using the micro-following model; a road section with a certain distance between the upstream monitoring point and the conflict starting point; the collision starting point is positioned between the upstream monitoring point and the collision terminal point; the road sections between the collision starting point and the collision terminal point form a collision area;
s3, adding acceleration constraint, distance constraint and safety constraint to establish a conflict coordination model aiming at the conflict type of the crossroad based on the microcosmic car-following model; the conflict types of the crossroad comprise cross conflict and confluence conflict;
s4, aiming at various situations which can not pass through the conflict area smoothly and possibly occur in the process that the vehicle passes through the conflict area under the mixed traffic flow scene, a cooperative control strategy set is prepared;
s5, judging whether the vehicle can smoothly pass through a conflict area or not by the conflict coordination model based on the vehicle initial track; if the judgment result is that the vehicle can smoothly pass through the conflict area, the vehicle continuously drives according to the speed of the microcosmic following model; if the judgment result is that the vehicle cannot smoothly pass through the conflict area, further judging the specific situation of the vehicle in the process of passing through the conflict area, and making a cooperative control strategy corresponding to the cooperative strategy set simulated in the step S4 for the vehicle according to the specific situation of the vehicle in the process of passing through the conflict area, so as to execute a step S6;
s6, determining an optimally controlled vehicle participating in the process that the vehicle passes through a conflict area as a target vehicle, optimizing the running track of the target vehicle according to the cooperative control strategy made in the step S5, resolving the optimization problem into an optimal control problem of discrete time state constraint, solving the cooperative optimization control strategy related to the target vehicle by using a dynamic planning idea, acting the cooperative optimization control strategy related to the target vehicle on the target vehicle, and controlling the running of the target vehicle;
the step S4 specifically includes:
assuming that both the X and Y lanes are one-way lanes, vehicle k on the X lane will pass through the interval between two vehicles of the continuous flow on the Y lane, each with k'1 andk′2is represented by, wherein vehicle k'1Denotes a front vehicle, vehicle k'2Representing a rear vehicle;
for various situations which can occur in the process that vehicles pass through a conflict area in a mixed traffic flow scene, k 'of the vehicles is determined based on the micro-following model'1K 'of vehicle'2The relationship between the conflict areas is divided into the conflict areas which can be smoothly passed and the conflict areas which can not be smoothly passed; the failure to smoothly pass through the collision region is further divided into four cases, the first case is denoted by R1 and represents the vehicles k and k'1The distance between the two parts is too close to satisfy the constraint condition of smoothly passing through the conflict area; the second case is marked as R2 and represents vehicle k and vehicle k'2The distance between the two parts is too close to satisfy the constraint condition of smoothly passing through the conflict area; the third case is marked as R3 and represents vehicle k and vehicle k'1And k 'with vehicle'2The distances between the two parts are too close to meet the constraint condition that the two parts can smoothly pass through a conflict area; the fourth case is marked as R4 and represents vehicle k and vehicle k'1And k 'with vehicle'2The basic spacing requirement is satisfied, but the process of passing through the conflict area is not comfortable;
aiming at four conditions that the vehicle can not smoothly pass through a conflict area, the vehicle which can be optimally controlled needs to be cooperatively controlled; the traditional driving vehicle is represented by H and is a vehicle which cannot be optimally controlled; the method comprises the following steps that A represents an intelligent networked vehicle which is an optimally controllable vehicle;n represents no front vehicle or no rear vehicle; and provides the combination sequence of the vehicles as vehicle k'1K 'of vehicle'2;
Based on different vehicle combinations, different vehicle type combinations and the four conditions that the conflict area can not be smoothly passed, a cooperative control strategy set is planned, and the following table shows that:
in the above table, the non-optimization means that the vehicle has no corresponding control strategy under the condition that the vehicle cannot smoothly pass through the conflict area; under the condition that optimization cannot be carried out, when the conflict type of the intersection is cross conflict, the vehicle k on the X road takes the intersection of the X road and the Y road as a stopped virtual front vehicle, continuously decelerates and even stops to wait by following the microcosmic following model, and the vehicle k does not pass through the conflict area until the vehicle interval meeting the passing conflict area appears on the Y road; when the conflict type of the crossroad is confluence conflict, the vehicle k on the X road takes the confluence point of the X road and the Y road as a stopped virtual front vehicle, continuously decelerates along the microcosmic car-following model, even stops and waits until the vehicle interval meeting the passing conflict area appears on the Y road, and the vehicle k passes through the conflict area; the confluence point of the X path and the Y path refers to the position where the X path traffic flow is converged into the Y path traffic flow;
the control state is unknown, and in the case R4 where the collision region cannot be smoothly passed, it is necessary to determine the vehicles k and k'1K 'of vehicle'2In which corresponding vehicles are uncomfortable in passing through the conflict area, andadopting corresponding control strategies according to the conditions of R1, R2 and R3 that the conflict area can not be smoothly passed;
the acceleration of the vehicle k is controlled by a decision variable u of the vehicle k at the time tk(t) satisfies:
and v isk(t)+uk(t)τ≤ve;
The control vehicle k decelerates, and a decision variable u of the vehicle k at the time t is usedk(t) satisfies:
and v isk(t)+uk(t)τ≥0;
The uncontrolled vehicle k is a decision variable u for the vehicle k at time tk(t) satisfies:
The control vehicle k'1The acceleration is to make the vehicle k 'at the time t'1Decision variables ofSatisfies the following conditions:
The vehicle k 'is not controlled'1Is to make the vehicle k 'at time t'1Decision variables ofSatisfies the following conditions:
The control vehicle k'2Deceleration is performed by making the vehicle k 'at time t'2Decision variables ofSatisfies the following conditions:
The vehicle k 'is not controlled'2Is to make the vehicle k 'at time t'2Decision variables ofSatisfies the following conditions:
Wherein u isk(t) as a decision variable for the vehicle k at time t, representing the acceleration of the vehicle k at time t; v. ofk(t) is the speed of vehicle k at time t;is the safe following speed of the vehicle k at the moment t + tau predicted according to the microcosmic following model, wherein Lk(t) represents the relative distance between the vehicle k and its following preceding vehicle at time t,representing the speed of the car k before the car k follows at the time t;k 'of vehicle at time t'1Is a decision variable of vehicle k'1Acceleration at time t;is vehicle k'1Velocity at time t;is vehicle k 'predicted from the microscopic follow model'1Safe following speed at time t + tau, whereinDenotes vehicle k 'at time t'1The relative distance between the car and the car before the car is driven,denotes vehicle k'1The speed of the car before the car is followed at the time t;k 'of vehicle at time t'2Is a decision variable of vehicle k'2Acceleration at time t;is vehicle k'2Velocity at time t;is vehicle k 'predicted from the microscopic follow model'2Safe following speed at time t + tau, whereinDenotes vehicle k 'at time t'2The relative distance between the car and the car before the car is driven,denotes vehicle k'2The speed of the car before the car is followed at the time t; τ is the reaction time of the vehicle driving; v. ofeIs the desired speed.
2. The urban intersection mixed traffic flow collaborative optimization floor control method according to claim 1, characterized in that the conflict type of the intersection is a cross conflict; the cross conflict means that vehicles in different driving directions run in a cross mode at a large angle; the step S3 specifically includes:
suppose that both the X and Y lanes are one-way lanes and the intersection of the X and Y lanes is (X)C,YC);
Defining a conflict area: determining a collision starting point and a collision end point by combining the geometric length of the road and the microcosmic car-following model, wherein the collision area on the X road is from the collision starting point XcsTo the conflicting terminal XceStopping; collision area self-conflict starting point Y on Y roadcsTo the conflict end point YceIf not, the conflict area is (X)cs,Ycs)~(Xce,Yce);
Defining a control area: control area on X road from vehicle distance conflict starting point XcsControl starting point X of a certain distanceDTo the cross point (X)C,YC) Stopping; control area on Y road from vehicle distance collision starting point YcsFrom a control start YD at a distance to a cross-over point (X)C,YC) If not, the control region is (X)D,YD)~(XC,YC) (ii) a The control starting point is positioned between the upstream monitoring point and the collision starting point;
suppose thatVehicle k on the X-way is in the control zone (X)D,YD)~(XC,YC) The interval between two vehicles that vehicle k will pass through a continuous flow on the Y road; k 'for each of two vehicles of the continuous stream on the Y-road'1And k'2Is represented by, wherein vehicle k'1Denotes a front vehicle, vehicle k'2Representing a rear vehicle;
at time t, the relative distance between vehicle k on the X road and vehicle k' on the Y road is represented by lk,k′(t) denotes, then:
wherein x isk(t) represents the position of the vehicle k on the X road at time t, yk′(t) represents the position of the vehicle k' on the Y road at time t;
u for conflict cooperative utilityk(t) indicating whether the vehicle k can smoothly pass through the collision area on the X road; the conflict cooperative utility Uk(t) is represented as follows:
wherein, | uk(t) | represents the absolute value of the acceleration of the vehicle k on the X road at the time t;denotes vehicle k 'on Y road'2The absolute value of the acceleration at time t;at time t, represents vehicle k ' on the X road and vehicle k ' on the Y road '1The relative distance therebetween;at time t, represents vehicle k ' on the X road and vehicle k ' on the Y road '2The relative distance therebetween;representing a safety body of the intelligent networked vehicle;representing a safety body of a conventionally driven vehicle; bsafeRepresents a maximum allowable deceleration; phiAThe method comprises the following steps of (1) providing an intelligent networked vehicle set; phiHη for conventional driving vehicle1Indicating a safety factor of η2Representing a polite coefficient; the intelligent networked vehicle is an optimally controllable vehicle and is represented by a letter A; the traditional driving vehicle is a vehicle which cannot be controlled optimally and is indicated by a letter H;
for collaborative decision Ik(t + τ) is represented as follows:
wherein, IkA value of (t + τ) of 1 indicates that the vehicle k can smoothly pass through the collision region at time t + τ; i iskA value of 0 for (t + τ) indicates that vehicle k cannot smoothly pass through the collision zone at time t + τ.
3. The urban intersection mixed traffic flow collaborative optimization floor control method according to claim 1, characterized in that the conflict type of the intersection is a confluence conflict; the confluent conflict means that vehicles in different driving directions converge and drive in the same direction at a small angle; the step S3 specifically includes:
suppose that both the X and Y lanes are one-way lanes and the intersection of the X and Y lanes is (X)C,YC);
Defining a conflict area: determining a collision starting point and a collision end point by combining the geometric length of the road and the microcosmic car-following model, wherein the collision area on the X road is from the collision starting point XcsTo the conflicting terminal XceStopping; collision area self-conflict starting point Y on Y roadcsTo the conflict end point YceStop, then conflictThe region is (X)cs,Ycs)~(Xce,Yce);
Defining a control area: control area on X road from vehicle distance conflict starting point XcsControl starting point X of a certain distanceDTo the cross point (X)C,YC) Stopping; control area on Y road from vehicle distance collision starting point YcsControl starting point Y of a certain distanceDTo the cross point (X)C,YC) If not, the control region is (X)D,YD)~(XC,YC) (ii) a The control starting point is positioned between the upstream monitoring point and the collision starting point;
suppose that vehicle k on the X road is in the control zone (X)D,YD)~(XC,YC) The interval between two vehicles that vehicle k will pass through a continuous flow on the Y road; k 'for each of two vehicles of the continuous stream on the Y-road'1And k'2Is represented by, wherein vehicle k'1Denotes a front vehicle, vehicle k'2Representing a rear vehicle;
at time t, the relative distance between vehicle k on the X road and vehicle k' on the Y road is represented by lk,k′(t) denotes, then:
when x isk(t)<xCAt the time of-r,
wherein x isk(t) represents the position of the vehicle k on the X road at time t, yk′(t) table shows the position of the vehicle k on the Y road at time t; r is the turning radius of the vehicle k at the crossroad;
u for conflict cooperative utilityk(t) indicating whether the vehicle k can smoothly pass through the collision area on the X road; the conflict cooperative utility Uk(t) is represented as follows:
wherein, | uk(t) | represents the absolute value of the acceleration of the vehicle k on the X road at the time t;denotes vehicle k 'on Y road'2The absolute value of the acceleration at time t;at time t, represents vehicle k ' on the X road and vehicle k ' on the Y road '1The relative distance therebetween;at time t, represents vehicle k ' on the X road and vehicle k ' on the Y road '2The relative distance therebetween;denotes vehicle k on the X road and vehicle k 'on the Y road'1The vehicle k on the X road is an intelligent networking vehicle;denotes vehicle k on the X road and vehicle k 'on the Y road'1And the vehicle k on the X road is a conventional driving vehicle;denotes vehicle k on the X road and vehicle k 'on the Y road'2The vehicle k on the X road is an intelligent networking vehicle;denotes vehicle k on the X road and vehicle k 'on the Y road'2And the vehicle k on the X road is a conventional driving vehicle; bsafeRepresents a maximum allowable deceleration; phiAThe method comprises the following steps of (1) providing an intelligent networked vehicle set; phiHη for conventional driving vehicle1Indicating a safety factor of η2Representing a polite coefficient; the intelligent networked vehicle is an optimally controllable vehicle and is represented by a letter A; the traditional driving vehicle is a vehicle which cannot be controlled optimally and is indicated by a letter H;
for collaborative decision Ik(t + τ) is represented as follows:
wherein, IkA value of (t + τ) of 1 indicates that the vehicle k can smoothly pass through the collision region at time t + τ; i iskA value of 0 for (t + τ) indicates that vehicle k cannot smoothly pass through the collision zone at time t + τ.
4. The urban intersection mixed traffic flow cooperative optimization floor control method according to any one of claims 1 to 3, wherein the step S6 specifically comprises:
s6-1, predicting the moment t when the target vehicle enters the control area based on the microcosmic car-following model0The time when the user leaves the control area is tf(ii) a And will t0To tfIs divided into N segments on average in discrete time intervals τ', i.e., N ═ tf-t0) T', defining the control decision time as t0+τ′,t0+2τ′,t0+3τ′,t0+4τ′,...,t0+(N-1)τ′,tf;
S6-2, according to the target vehicle at t0The state of the time, the target vehicle is calculated at t0The set of allowable states at time + τ', and the target vehicle from t0State of time t0The allowable states at time + τ' aggregate the transition costs for each allowable state; said target vehicle is at t0The state at time t includes the target vehicle being at t0Speed and position of the moment;
s6-3, according to the target vehicle at t0The allowable state set at the time + tau' is calculated for the target vehicle at t0The allowable state set at time +2 τ', and the target vehicle from t0State at time + τ' to t0The allowable states at time +2 τ' are grouped into transition costs and cumulative costs for each allowable state;
s6-4, sequentially calculating the target vehicle at t according to the method of the step S6-30+3τ′,t0+4τ′,...,t0+(N-1)τ′,tfThe allowable state set of the time is calculated to obtain tfThe cumulative cost of each allowable state in the time-wise allowable state set;
s6-5, judging that the target vehicle is at tfWhether each allowable state in the allowable state set at the moment meets the condition that the allowable state can smoothly pass through the conflict area or not is judged, and the allowable state meeting the condition is brought into the final allowable state set;
s6-6, selecting the allowable state with the minimum accumulated cost in the final allowable state set as tfThe optimal state of the moment;
s6-7, according to tfThe optimal state of the moment is reversely deduced to obtain t0+τ′,t0+2τ′,t0+3τ′,t0+4τ′,...,t0+(N-1)τ′,tfThe optimal state at each moment, and the control decision corresponding to each optimal state is brought into a cooperative optimization control strategy;
and S6-8, controlling the operation of the target vehicle among the control areas according to the cooperative optimization control strategy.
5. The urban crossroad mixed traffic flow collaborative optimization bottom-layer control method according to claim 4, characterized in that a microscopic traffic flow simulation environment is constructed, and simulation results before and after optimization under different traffic situations are compared.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910886987.4A CN110473404B (en) | 2019-09-19 | 2019-09-19 | Cooperative optimization bottom layer control method for mixed traffic flow at urban crossroad |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910886987.4A CN110473404B (en) | 2019-09-19 | 2019-09-19 | Cooperative optimization bottom layer control method for mixed traffic flow at urban crossroad |
Publications (2)
Publication Number | Publication Date |
---|---|
CN110473404A CN110473404A (en) | 2019-11-19 |
CN110473404B true CN110473404B (en) | 2020-08-25 |
Family
ID=68516297
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201910886987.4A Active CN110473404B (en) | 2019-09-19 | 2019-09-19 | Cooperative optimization bottom layer control method for mixed traffic flow at urban crossroad |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN110473404B (en) |
Families Citing this family (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110910646B (en) * | 2019-12-11 | 2022-03-29 | 上海同济城市规划设计研究院有限公司 | Cooperative control method for unmanned buses at intersection |
CN110992695B (en) * | 2019-12-13 | 2021-01-29 | 北京理工大学 | Vehicle urban intersection traffic decision multi-objective optimization method based on conflict resolution |
CN111445692B (en) * | 2019-12-24 | 2021-01-29 | 清华大学 | Speed collaborative optimization method for intelligent networked automobile at signal-lamp-free intersection |
CN111724603B (en) * | 2020-07-01 | 2021-05-18 | 中南大学 | CAV state determination method, device, equipment and medium based on traffic track data |
CN111813117B (en) * | 2020-07-09 | 2023-09-01 | 北京布科思科技有限公司 | Robot line patrol priority navigation method, device and equipment |
CN112185132A (en) * | 2020-09-08 | 2021-01-05 | 大连理工大学 | Coordination method for vehicle intersection without traffic light |
CN114201847B (en) * | 2020-10-12 | 2024-06-21 | 西南交通大学 | Simplifying method for multi-vehicle track control under mixed traffic flow |
CN113219962B (en) * | 2021-02-26 | 2023-02-28 | 北京航空航天大学合肥创新研究院(北京航空航天大学合肥研究生院) | Control method and system for hybrid queue following safety and storage medium |
CN113053167A (en) * | 2021-03-11 | 2021-06-29 | 吉林大学 | Interconnected vehicle intersection collision-free management method in mixed traffic environment |
CN113055474B (en) * | 2021-03-12 | 2022-11-11 | 成都格林希尔德交通科技有限公司 | Micro road right transaction system |
CN112820125B (en) * | 2021-03-24 | 2023-01-17 | 苏州大学 | Intelligent internet vehicle traffic guidance method and system under mixed traffic condition |
CN113312752B (en) * | 2021-04-26 | 2022-11-04 | 东南大学 | Traffic simulation method and device for main road priority control intersection |
CN113486478B (en) * | 2021-05-31 | 2022-12-13 | 东南大学 | Simulation method and system for crossing turning vehicle to merge into straight lane |
CN114120639B (en) * | 2021-11-09 | 2023-04-11 | 广州文远知行科技有限公司 | Vehicle traffic control method, device and storage medium |
CN114067569B (en) * | 2022-01-14 | 2022-06-10 | 华砺智行(武汉)科技有限公司 | Vehicle left-turning auxiliary early warning method in V2X vehicle networking environment |
CN114495499B (en) * | 2022-01-21 | 2023-02-14 | 东南大学 | Multi-target intelligent internet vehicle cooperative optimization control method |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102368351A (en) * | 2011-10-19 | 2012-03-07 | 北京航空航天大学 | Method for eliminating traffic conflict of two vehicles at intersection without signal |
CN103177596A (en) * | 2013-02-25 | 2013-06-26 | 中国科学院自动化研究所 | Automatic intersection management and control system |
WO2018057597A1 (en) * | 2016-09-20 | 2018-03-29 | Waymo Llc | Vehicle-mounted radar deflectors |
CN108806252A (en) * | 2018-06-19 | 2018-11-13 | 西南交通大学 | A kind of Mixed Freeway Traffic Flows collaboration optimal control method |
CN108932840A (en) * | 2018-07-17 | 2018-12-04 | 北京理工大学 | Automatic driving vehicle urban intersection passing method based on intensified learning |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10427596B2 (en) * | 2017-07-27 | 2019-10-01 | Alexa Lea Haushalter | Vehicle directional indicator for autonomous and non-autonomous vehicles |
-
2019
- 2019-09-19 CN CN201910886987.4A patent/CN110473404B/en active Active
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102368351A (en) * | 2011-10-19 | 2012-03-07 | 北京航空航天大学 | Method for eliminating traffic conflict of two vehicles at intersection without signal |
CN103177596A (en) * | 2013-02-25 | 2013-06-26 | 中国科学院自动化研究所 | Automatic intersection management and control system |
WO2018057597A1 (en) * | 2016-09-20 | 2018-03-29 | Waymo Llc | Vehicle-mounted radar deflectors |
CN108806252A (en) * | 2018-06-19 | 2018-11-13 | 西南交通大学 | A kind of Mixed Freeway Traffic Flows collaboration optimal control method |
CN108932840A (en) * | 2018-07-17 | 2018-12-04 | 北京理工大学 | Automatic driving vehicle urban intersection passing method based on intensified learning |
Non-Patent Citations (3)
Title |
---|
Intelligent Vehicles’ Effects on Chinese Traffic: A Simulation Study of Cooperative Adaptive Cruise Control and Intelligent Speed Adaption;Xu Kang 等;《2018 21st International Conference on Intelligent Transportation Systems》;20181210;全文 * |
Traffic Flow in the Mixed Environment of Autonomous and Human-Operated Vehicles;Hiroto Furukawa 等;《2018 Eleventh International Conference on Mobile Computing and Ubiquitous Network》;20190228;全文 * |
智能网联环境下的无信号交叉口冲突消解方法研究;胡梦岩;《中国优秀硕士学位论文全文数据库 工程科技II辑》;20180215;全文 * |
Also Published As
Publication number | Publication date |
---|---|
CN110473404A (en) | 2019-11-19 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN110473404B (en) | Cooperative optimization bottom layer control method for mixed traffic flow at urban crossroad | |
CN110570049B (en) | Expressway mixed traffic flow convergence collaborative optimization bottom layer control method | |
Vahidi et al. | Energy saving potentials of connected and automated vehicles | |
CN110599772B (en) | Mixed traffic flow cooperative optimization control method based on double-layer planning | |
CN111445692B (en) | Speed collaborative optimization method for intelligent networked automobile at signal-lamp-free intersection | |
Li et al. | Planning and decision-making for connected autonomous vehicles at road intersections: A review | |
CN106997690B (en) | Non-forced lane changing control method for vehicles on expressway in Internet of vehicles environment | |
CN108475465B (en) | Method for moving, in particular controlling or regulating a vehicle fleet | |
CN114613179B (en) | Gathering and passing method for internet-connected automatic-driving mixed-driving vehicle intersection and control system thereof | |
CN112258875B (en) | Intersection intelligent control method based on vehicle-road cooperation and automatic driving | |
CN110471408A (en) | Automatic driving vehicle paths planning method based on decision process | |
CN112249033B (en) | Automatic driving system and method for vehicle | |
CN114013443B (en) | Automatic driving vehicle lane change decision control method based on hierarchical reinforcement learning | |
CN113312732B (en) | Non-signal control intersection simulation control method and device combining decision advance and dynamic adjustment | |
CN113012448B (en) | Intelligent driving system for vehicle distribution formation for solving intersection traffic jam | |
CN111994088A (en) | Driver lane change intention identification method and system based on hybrid strategy game | |
CN112233413A (en) | Multilane space-time trajectory optimization method for intelligent networked vehicle | |
CN111081069B (en) | Vehicle track control method for bottleneck area of expressway | |
CN112258864B (en) | Automatic driving vehicle intersection scheduling method and system based on sequence selection | |
CN113554886A (en) | Traffic flow conflict resolution method for cooperative intersection of vehicle and road | |
CN115641717A (en) | Highway main line-ramp vehicle cooperative confluence control method and device based on mixed traffic flow and storage medium | |
CN116895163A (en) | Multi-vehicle cooperative control method and system based on signal lamp active communication | |
CN113053167A (en) | Interconnected vehicle intersection collision-free management method in mixed traffic environment | |
CN111899509A (en) | Intelligent networking automobile state vector calculation method based on vehicle-road information coupling | |
CN113593225B (en) | Single-point intersection vehicle control method oriented to pure internet environment |
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 |