CN113246985A - Intelligent network vehicle merging and changing control method for expressway ramps under mixed-traveling condition - Google Patents

Intelligent network vehicle merging and changing control method for expressway ramps under mixed-traveling condition Download PDF

Info

Publication number
CN113246985A
CN113246985A CN202110687438.1A CN202110687438A CN113246985A CN 113246985 A CN113246985 A CN 113246985A CN 202110687438 A CN202110687438 A CN 202110687438A CN 113246985 A CN113246985 A CN 113246985A
Authority
CN
China
Prior art keywords
vehicle
lane
distance
time
change
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.)
Granted
Application number
CN202110687438.1A
Other languages
Chinese (zh)
Other versions
CN113246985B (en
Inventor
王成
俄文娟
陈颖
王翔
郑建颖
陶砚蕴
马世威
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Suzhou University
Original Assignee
Suzhou University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Suzhou University filed Critical Suzhou University
Priority to CN202110687438.1A priority Critical patent/CN113246985B/en
Publication of CN113246985A publication Critical patent/CN113246985A/en
Application granted granted Critical
Publication of CN113246985B publication Critical patent/CN113246985B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • BPERFORMING OPERATIONS; TRANSPORTING
    • B60VEHICLES IN GENERAL
    • B60WCONJOINT CONTROL OF VEHICLE SUB-UNITS OF DIFFERENT TYPE OR DIFFERENT FUNCTION; CONTROL SYSTEMS SPECIALLY ADAPTED FOR HYBRID VEHICLES; ROAD VEHICLE DRIVE CONTROL SYSTEMS FOR PURPOSES NOT RELATED TO THE CONTROL OF A PARTICULAR SUB-UNIT
    • B60W30/00Purposes of road vehicle drive control systems not related to the control of a particular sub-unit, e.g. of systems using conjoint control of vehicle sub-units
    • B60W30/18Propelling the vehicle
    • B60W30/18009Propelling the vehicle related to particular drive situations
    • B60W30/18163Lane change; Overtaking manoeuvres
    • BPERFORMING OPERATIONS; TRANSPORTING
    • B60VEHICLES IN GENERAL
    • B60WCONJOINT CONTROL OF VEHICLE SUB-UNITS OF DIFFERENT TYPE OR DIFFERENT FUNCTION; CONTROL SYSTEMS SPECIALLY ADAPTED FOR HYBRID VEHICLES; ROAD VEHICLE DRIVE CONTROL SYSTEMS FOR PURPOSES NOT RELATED TO THE CONTROL OF A PARTICULAR SUB-UNIT
    • B60W30/00Purposes of road vehicle drive control systems not related to the control of a particular sub-unit, e.g. of systems using conjoint control of vehicle sub-units
    • B60W30/08Active safety systems predicting or avoiding probable or impending collision or attempting to minimise its consequences
    • B60W30/095Predicting travel path or likelihood of collision
    • B60W30/0953Predicting travel path or likelihood of collision the prediction being responsive to vehicle dynamic parameters
    • BPERFORMING OPERATIONS; TRANSPORTING
    • B60VEHICLES IN GENERAL
    • B60WCONJOINT CONTROL OF VEHICLE SUB-UNITS OF DIFFERENT TYPE OR DIFFERENT FUNCTION; CONTROL SYSTEMS SPECIALLY ADAPTED FOR HYBRID VEHICLES; ROAD VEHICLE DRIVE CONTROL SYSTEMS FOR PURPOSES NOT RELATED TO THE CONTROL OF A PARTICULAR SUB-UNIT
    • B60W30/00Purposes of road vehicle drive control systems not related to the control of a particular sub-unit, e.g. of systems using conjoint control of vehicle sub-units
    • B60W30/08Active safety systems predicting or avoiding probable or impending collision or attempting to minimise its consequences
    • B60W30/095Predicting travel path or likelihood of collision
    • B60W30/0956Predicting travel path or likelihood of collision the prediction being responsive to traffic or environmental parameters
    • BPERFORMING OPERATIONS; TRANSPORTING
    • B60VEHICLES IN GENERAL
    • B60WCONJOINT CONTROL OF VEHICLE SUB-UNITS OF DIFFERENT TYPE OR DIFFERENT FUNCTION; CONTROL SYSTEMS SPECIALLY ADAPTED FOR HYBRID VEHICLES; ROAD VEHICLE DRIVE CONTROL SYSTEMS FOR PURPOSES NOT RELATED TO THE CONTROL OF A PARTICULAR SUB-UNIT
    • B60W40/00Estimation or calculation of non-directly measurable driving parameters for road vehicle drive control systems not related to the control of a particular sub unit, e.g. by using mathematical models
    • B60W40/02Estimation or calculation of non-directly measurable driving parameters for road vehicle drive control systems not related to the control of a particular sub unit, e.g. by using mathematical models related to ambient conditions
    • B60W40/04Traffic conditions
    • BPERFORMING OPERATIONS; TRANSPORTING
    • B60VEHICLES IN GENERAL
    • B60WCONJOINT CONTROL OF VEHICLE SUB-UNITS OF DIFFERENT TYPE OR DIFFERENT FUNCTION; CONTROL SYSTEMS SPECIALLY ADAPTED FOR HYBRID VEHICLES; ROAD VEHICLE DRIVE CONTROL SYSTEMS FOR PURPOSES NOT RELATED TO THE CONTROL OF A PARTICULAR SUB-UNIT
    • B60W60/00Drive control systems specially adapted for autonomous road vehicles
    • B60W60/001Planning or execution of driving tasks
    • B60W60/0011Planning or execution of driving tasks involving control alternatives for a single driving scenario, e.g. planning several paths to avoid obstacles
    • GPHYSICS
    • G08SIGNALLING
    • G08GTRAFFIC CONTROL SYSTEMS
    • G08G1/00Traffic control systems for road vehicles
    • G08G1/01Detecting movement of traffic to be counted or controlled
    • G08G1/0104Measuring and analyzing of parameters relative to traffic conditions
    • G08G1/0125Traffic data processing
    • GPHYSICS
    • G08SIGNALLING
    • G08GTRAFFIC CONTROL SYSTEMS
    • G08G1/00Traffic control systems for road vehicles
    • G08G1/16Anti-collision systems
    • G08G1/165Anti-collision systems for passive traffic, e.g. including static obstacles, trees
    • GPHYSICS
    • G08SIGNALLING
    • G08GTRAFFIC CONTROL SYSTEMS
    • G08G1/00Traffic control systems for road vehicles
    • G08G1/16Anti-collision systems
    • G08G1/166Anti-collision systems for active traffic, e.g. moving vehicles, pedestrians, bikes
    • GPHYSICS
    • G08SIGNALLING
    • G08GTRAFFIC CONTROL SYSTEMS
    • G08G1/00Traffic control systems for road vehicles
    • G08G1/16Anti-collision systems
    • G08G1/167Driving aids for lane monitoring, lane changing, e.g. blind spot detection
    • BPERFORMING OPERATIONS; TRANSPORTING
    • B60VEHICLES IN GENERAL
    • B60WCONJOINT CONTROL OF VEHICLE SUB-UNITS OF DIFFERENT TYPE OR DIFFERENT FUNCTION; CONTROL SYSTEMS SPECIALLY ADAPTED FOR HYBRID VEHICLES; ROAD VEHICLE DRIVE CONTROL SYSTEMS FOR PURPOSES NOT RELATED TO THE CONTROL OF A PARTICULAR SUB-UNIT
    • B60W2554/00Input parameters relating to objects
    • B60W2554/40Dynamic objects, e.g. animals, windblown objects
    • BPERFORMING OPERATIONS; TRANSPORTING
    • B60VEHICLES IN GENERAL
    • B60WCONJOINT CONTROL OF VEHICLE SUB-UNITS OF DIFFERENT TYPE OR DIFFERENT FUNCTION; CONTROL SYSTEMS SPECIALLY ADAPTED FOR HYBRID VEHICLES; ROAD VEHICLE DRIVE CONTROL SYSTEMS FOR PURPOSES NOT RELATED TO THE CONTROL OF A PARTICULAR SUB-UNIT
    • B60W2554/00Input parameters relating to objects
    • B60W2554/80Spatial relation or speed relative to objects

Landscapes

  • Engineering & Computer Science (AREA)
  • Automation & Control Theory (AREA)
  • Transportation (AREA)
  • Mechanical Engineering (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Human Computer Interaction (AREA)
  • Chemical & Material Sciences (AREA)
  • Analytical Chemistry (AREA)
  • Mathematical Physics (AREA)
  • Traffic Control Systems (AREA)
  • Control Of Driving Devices And Active Controlling Of Vehicle (AREA)

Abstract

The invention discloses a method for controlling merging and changing of an intelligent online vehicle on a ramp of a fast way under a mixed-running condition, which comprises the following steps of: collecting road traffic driving information; analyzing the running states and the optimal safety distance of the vehicle in the accelerating lane and the vehicle in the front of and behind the target lane, and judging whether a lane change decision is generated; and adjusting the acceleration of the vehicle in real time based on the track changing path function during driving, so as to realize safe lane changing. The method is based on the realization of related technologies such as intelligent internet connection, vehicle-road cooperation and the like, and performs decision-making judgment for lane change according to the information such as environment, traffic and the like of roads around the preset range acquired in the communication area, thereby avoiding rear-end collision among vehicles when driving the intelligent internet connection and effectively improving the safety and reliability of automatic driving in the lane change process.

Description

Intelligent network vehicle merging and changing control method for expressway ramps under mixed-traveling condition
Technical Field
The invention relates to the technical field of intelligent traffic, in particular to a method for controlling merging and changing of an intelligent network vehicle of an expressway ramp under a mixed-driving condition.
Background
The intelligent internet automobile senses and identifies the surrounding environment of a running vehicle by means of a vehicle-mounted system and a road test system, analyzes and processes the acquired information such as the position of the vehicle, traffic signals, roads, obstacles and the like, and controls the speed and the steering of the automobile to realize the intelligent driving of the vehicle. The realization of the intelligent internet automobile technology mainly depends on the fusion of a plurality of auxiliary driving technologies, the single auxiliary driving technology can only carry out driving assistance on a driver, and the fusion of the plurality of auxiliary driving technologies can adapt to more scenes and even adapt to unmanned driving under the full scene. According to the degree of automation of intelligent driving, automobiles can be classified into four types, i.e., primary driver-assist automobiles, advanced driver-assist automobiles, autonomous automobiles, and unmanned automobiles. The development path of the intelligent networked automobile mainly starts from two aspects, namely intellectualization and networking. The intellectualization means that the intelligent Driving function of the automobile is realized by a method of combining an on-board sensor and an automatic control System of the automobile by depending on Advanced Driving Assistance technology, such as Advanced Driving Assistance System (ADAS). Networking is mainly realized by means of a vehicle networking system, such as a vehicle to outside information exchange (V2X) system, so that information exchange of vehicles, people, vehicles, roads and platforms is realized, the driving safety of the vehicles is improved, and the road passing efficiency is improved.
The lane changing behavior of the vehicle is a process for describing the driving characteristics of the driver, adjusting the driving state of the driver according to the stimulation of the traffic environment around the vehicle and completing the target strategy. According to the motivation for pursuing benefits, the lane change of the vehicle is generally divided into two modes of free lane change and forced lane change. The mandatory lane change refers to a behavior that has a determined target lane and must implement lane change in a certain section, such as diversion of a ramp, a converging vehicle, a vehicle in an interlacing area and the like, wherein the key of the behavior is the existence of a latest lane change point. The free lane change refers to lane change behavior of a vehicle in a more free driving space when the vehicle encounters a vehicle in a slower front direction in order to pursue a faster vehicle speed.
The method comprises the steps of collecting dynamic traffic information of vehicles which cannot leave, collecting traffic information data on the basis of a traffic information collecting system, and collecting traffic information of the vehicles in a conventional environment in a mode of microwave radar, video, infrared, annular induction coils, floating vehicle traffic information collection and the like. The loop induction coil is generally composed of a loop coil, a transmission feeder line and a detection processing unit, wherein the loop coil is laid on a road and forms a magnetic field nearby the loop coil, and when a vehicle enters the magnetic field, the detection processing unit detects the vehicle and outputs a signal; the system can not only count and detect traffic flow, but also measure speed. The microwave detector is a radar detector, detects vehicles by using Doppler effect, can detect traffic volume and speed, and achieves the purpose of detecting road traffic information. The video monitoring system mainly comprises three parts, namely a front end, a transmission part and a terminal, wherein the front end part mainly comprises a camera, a lens, a holder, a decoder and the like, the transmission part commonly uses optical cables, video cables, telephone wires and the like, and the terminal part is usually a monitor and can display images transmitted from the front end and control front-end equipment; the television monitoring system has the double functions of image monitoring and traffic data acquisition; the installation is simple, and the detection rate is high, and is longe-lived, and the maintenance cost is low. The floating car traffic information acquisition is to exchange real-time information with a traffic data center through vehicles (such as taxies, buses and the like) provided with a global satellite positioning system and a wireless communication device, and has the characteristics of wide acquisition range and low investment, can reflect the change of the running state of a road network, and provides reference for dredging.
In order to ensure that lane change behaviors can be successfully and safely completed under expected space and time conditions, common lane change models are divided into three situations, namely a lane change model based on dynamic repeated games, a lane change model based on utility selection requirements and a lane change model based on a fuzzy logic method. The lane changing behavior ratio of the vehicle is subjected to a dynamic repeated game process based on a lane changing model of the dynamic repeated game, the vehicle needing lane changing and a rear vehicle on a target lane are compared, and the game is carried out for seeking a high-speed and satisfactory driving space between the vehicle needing lane changing and the rear vehicle; and (4) considering speed factors and safety factors, and analyzing various factors influencing the expected speed of the vehicle to obtain a lane changing model of the vehicle. Under the lane changing model based on the utility selection requirement, the satisfaction degree of a driver on different lanes is different when the driver drives on the different lanes, the satisfaction degree can be expressed by the utility, and the utility maximization setting is obeyed, namely the lane where the vehicle is located is certainly the highest satisfaction degree, and once the satisfaction degree of driving on other lanes is higher, the lane changing requirement is generated. The lane change model based on the fuzzy logic method considers that the lane change is a thinking decision process, and the fuzzy logic method adopts linguistic variables for approximate reasoning, so that the lane change model is very suitable for describing a subjective judgment process based on a driver; and comprehensively considering the relation factors of the speed and the distance between the target vehicle and the adjacent vehicle to establish a lane change model based on a fuzzy logic lane change algorithm.
With the continuous development of the car networking technology, great innovation is made especially in the field of automatic driving at present. The traditional traffic flow on roads is gradually changed into the traffic flow formed by mixing automatic driving vehicles and manual driving vehicles. The complex traffic environment has a plurality of random and uncertain influence factors, so that the lane changing state of the vehicle in the hybrid traffic driving mode is also complicated and diversified. Considering that the vehicle lane change has direct influence on the traffic capacity and traffic stability of the road, especially when vehicles on the ramp merge into a main line lane, the road section of the confluence area is easy to be blocked by improper lane change behavior, and even the traffic safety problem is caused. Not only does this affect people's confidence in the automated driving technique, but it also invisibly presents challenges to the development of automated driving techniques. Therefore, for the problem of vehicle lane change of heterogeneous traffic flow in a ramp confluence area, the research on a control method for automatically driving vehicles to merge on the ramp is very meaningful for improving the traffic capacity and the vehicle running efficiency in the confluence area.
However, road side facilities are not comprehensive at the present stage, and intelligent networked vehicles are not popularized yet. In this case, the road surface artificial vehicle can only judge the driving state, and cannot obtain specific dynamic driving data. In addition, the lane changing time required by the conventional lane changing is long, traffic jam is easy to occur on the ramp of the express way, and particularly, in a mixed traffic driving state, the driving behavior of an artificial vehicle owner in a target lane cannot be judged by the conventional vehicle lane changing method, the influence of the mixed vehicle on the lane changing of the vehicle cannot be judged in different driving states, and the decision error of the lane changing of the vehicle is easily caused.
Disclosure of Invention
Therefore, the technical problem to be solved by the invention is to overcome the defects in the prior art, and provide the control method for the merging and changing lanes of the intelligent on-line vehicle of the express way ramp under the mixed-running condition, which considers the influence of different driving forms of the mixed-running vehicle in the merging area on the changing lanes of the intelligent on-line vehicle and reduces the error in the decision of changing lanes of the intelligent on-line vehicle.
In order to solve the technical problem, the invention provides a method for controlling the merging and changing of an intelligent online vehicle on an expressway ramp under a mixed-driving condition, which comprises the following steps of:
s1: the intelligent internet vehicle serves as a main vehicle M to drive into the expressway confluence area, and the main vehicle M acquires surrounding road environment information in a communication area based on an intelligent vehicle path system and an intelligent vehicle-mounted system;
s2: calculating the triggering time t of the minimum safe distance of the vehicle A around the lane where the main vehicle M is away from according to the surrounding road environment informationi+cTrigger time t according to minimum safety distancei+cCalculating the minimum safety clearance SMSD(MA), minimum safety gap SMSD(MA) ensuring that the host vehicle M does not collide with the surrounding vehicles A when changing lanes;
s3: obtaining the real-time distance S between the main vehicle M and the surrounding vehicles Areal(MA) real-time distance between the host vehicle M and the surrounding vehicles ASreal(MA) minimum safety clearance SMSD(MA) comparison, if Sreal(MA)<SMSD(MA), the host M does not generate the lane change motive, executing S4; if Sreal(MA)≥SMSD(MA), the master M generating the lane change motive, performing S5;
s4: the master vehicle M continues to run in the lane or stops to wait for the lane change opportunity, and skips to execute S3 to Sreal(MA)≥SMSD(MA) the host M generating a lane change motive, performing S5;
s5: establishing a driving lane changing track f (x) and a target lane line g (x) of the master vehicle M, calculating an expected path function g (t) taking time as a parameter variable according to the driving lane changing track and the target lane line, and obtaining a speed change function v (t) and an acceleration change function a (t) by the expected path function g (t);
s6: the main vehicle M acquires the surrounding road environment information again and judges whether a front vehicle N and a rear vehicle F exist in the target lane for lane change, and the acceleration a required when the main vehicle M changes lanes is calculated under the three conditions that only the front vehicle N exists, only the rear vehicle F exists, and all the front vehicle N and the rear vehicle F existchangeThe master vehicle M is accelerated by an acceleration achangeAnd (5) changing the lane into the target lane, and updating the state information of the intelligent vehicle internet vehicle.
Further, in the step S2, the triggering time t of the minimum safe distance between the host vehicle M and the vehicle a around the lane is calculated according to the surrounding road environment informationi+cThe method specifically comprises the following steps:
triggering time t of minimum safety distancei+c=ti+tcWherein t isiAdjustment time t required for passing of the master vehicle M from the initial position to before lane changecIs the time from the start of lane change to the minimum safe distance from the surrounding vehicle a; minimum safe distance Smin(MA) is a minimum distance at which the host vehicle M does not collide with the surrounding vehicle a in the following state, and is set according to the traveling speed of the vehicle.
Further, the triggering time t according to the minimum safety distance in S2i+cCalculating the minimum safety clearance SMSD(MA), specifically:
calculating the longitudinal distance between the head of the main vehicle M and the parking space of the vehicle A
Figure BDA0003125115360000051
Wherein SMA(0) The initial distance between the master vehicle M and the vehicle A at the zero time of lane change, alpha is the yaw angle of lane change of the master vehicle M, aMIs the acceleration of the host vehicle M, aAAcceleration, v, of vehicle AM(0) Is the initial velocity, v, of the host vehicle MA(0) The initial velocity, W, of the vehicle AMThe width of the main vehicle M is wide;
the minimum safety clearance between the main vehicle M and the vehicle A is obtained by the triggering time of the longitudinal distance, the minimum safety distance and the minimum safety distance between the head of the main vehicle M and the parking space of the vehicle A:
SMSD(MA)=max{SMA(ti+c),Smin(MA)}。
further, in the step S4, if v is the time v during which the host M continues to run in the lane or stops waiting for the timing to change lanesM-vAIs a value greater than a preset speed threshold, vMIs the current speed, v, of the vehicle MAThe vehicle M properly decelerates and warns to prompt the surrounding additional vehicle A to accelerate to leave the accelerating lane or decelerates to a time waiting for parking and changing the lane so that the vehicle in front of the accelerating lane changes the lane preferentially; if v isM-vAThe value of the speed threshold is less than or equal to the preset speed threshold, and the vehicle M performs a lane change decision at a constant speed or at a proper and uniform acceleration on the premise of ensuring that the vehicle in front of the acceleration lane changes lanes preferentially.
Further, in the step S5, a driving lane change trajectory f (x) and a target lane line g (x) of the host M are established, specifically:
the driving lane change track f (x) of the master vehicle M is obtained by fitting a polynomial function of degree 5:
f(x)=a0+a1x1+a2x2+a3x3+a4x4+a5x5
the target lane line g (x) is obtained by fitting a polynomial function of degree 4:
g(x)=b0x0+b1x1+b2x2+b3x3+b4x4
further, in the step S5, an expected path function g (t) with time as a parameter variable is calculated according to the driving lane change track and the target lane line, and the expected path function g (t) with time as a parameter variable is:
Figure BDA0003125115360000061
further, in the S5, a speed change function v (t) and an acceleration change function a (t) are obtained from the expected path function g (t), and the speed change function
Figure BDA0003125115360000062
Said acceleration change function
Figure BDA0003125115360000063
Wherein,
Figure BDA0003125115360000064
vmindicates the initial speed of lane change, amRepresenting initial acceleration of lane change, t representing elapsed time of lane change, b0Is the position of the target lane on the coordinate system.
Further, when only the front vehicle N is present in S6, the specific process includes:
minimum safe distance S between main vehicle M and vehicle N when setting replacement pathmin(MN) according to the minimum safe distance Smin(MN) calculating the minimum safety clearance S between the host vehicle M and the vehicle NMSD(MN)=max{SMN(tm),Smin(MN); wherein t ismThe time from the lane change start of the master vehicle M to the minimum safety clearance from the surrounding vehicles N, SMN(tm) Is the minimum safety clearance of the host vehicle M from the surrounding vehicles N,
Figure BDA0003125115360000065
t∈[0,tm1],SMN(0) is a main vehicleInitial distance a between M and vehicle N at zero time of lane changeNIs the acceleration of the vehicle N, aMIs the acceleration, v, of the vehicle MN(0) Is the initial velocity, v, of the vehicle NM(0) Is the initial velocity, t, of the vehicle Mm1The elapsed time for changing lanes of the master vehicle M;
calculating the longitudinal distance between the head of the main vehicle M and the parking spaces of the N vehicles:
Figure BDA0003125115360000071
wherein S isNIs the distance N traveled on the target lane, SN=VN*tM,SMAs is the distance traveled by the host vehicle M,
Figure BDA0003125115360000072
LNthe length of the vehicle N, WMThe main vehicle M is in a vehicle width, and theta is a lane changing yaw angle generated by the main vehicle M in the lane changing process;
calculating the real-time distance between the main vehicle M and the vehicle N:
Figure BDA0003125115360000073
judgment Sreal(MN)≥SMSD(MN) is established, if not, the vehicle M continues to run or stop in the current lane until Sreal(MN)≥SMSD(MN) true;
when S isreal(MN)≥SMSD(MN) is established, and the distance between the master vehicle M and the vehicle N after the lane change of the master vehicle M is set to be the minimum safe distance Smin(MN) at this time tm1Satisfy the requirement of
Figure BDA0003125115360000074
Solved to obtain
Figure BDA0003125115360000075
Setting the distance between the main vehicle M and the vehicle N after the lane change of the main vehicle M as a critical distance 0, wherein the time for the main vehicle M to pass the lane change is tm2At this time tm2Satisfy the requirement of
Figure BDA0003125115360000076
Solved to obtain
Figure BDA0003125115360000077
Will tm1Substituting into acceleration variation function a (t) to obtain am1Will tm2Substituting into acceleration variation function a (t) to obtain am2To obtain achange=(am1,am2](ii) a Based on achange=(am1,am2]At t, is requiredm2Adjusting acceleration change of the host vehicle M within time to satisfy achangeWhile ensuring that the pressure drop is at (t)m2,tm1]Speed v of the host vehicle M in a time periodmSpeed V of the preceding vehicle NNAnd when the main vehicle M finishes lane changing, the main vehicle M and the vehicle N in front keep running at a constant speed.
Further, when only the rear vehicle F is present in S6, the specific process is as follows:
minimum safe distance S between main vehicle M and vehicle F when setting a lane changemin(MF) according to the minimum safety distance Smin(MF) calculating the minimum safety clearance S between the host vehicle M and the vehicle NMSD(MF)=max{SMF(tm'),Smin(MF) }; wherein t ism'For the time from the lane change start of the master vehicle M to the minimum safety clearance from the surrounding vehicle F, SMF(tm') Is the minimum safety clearance of the host vehicle M from the surrounding vehicles F,
Figure BDA0003125115360000081
t∈[0,tm1'],SMF(0) is the initial distance, a, between the master vehicle M and the vehicle F at the zero time of lane changeFIs the acceleration of the vehicle F, aMIs the acceleration, v, of the vehicle MF(0) Is the initial velocity v of the vehicle FM(0) Is the initial velocity, t, of the vehicle Mm1'The elapsed time for changing lanes of the master vehicle M;
calculating the longitudinal distance between the head of the main vehicle M and the parking space of the vehicle F:
Figure BDA0003125115360000082
wherein S isFIs the distance traveled by the vehicle F on the target lane, SF=VF*tM',SMAs is the distance traveled by the host vehicle M,
Figure BDA0003125115360000083
LMthe length of the vehicle M, WMThe main vehicle M is in a vehicle width, and theta is a lane changing yaw angle generated by the main vehicle M in the lane changing process;
calculating the real-time distance S between the main vehicle M and the vehicle Freal(MF):
Figure BDA0003125115360000084
Judgment Sreal(MF)≥SMSD(MF) is true, if not, the vehicle M continues to run or stop in the current lane until Sreal(MF)≥SMSD(MF) is established;
when S isreal(MF)≥SMSD(MF) establishing that the distance between the main vehicle M and the vehicle F after the lane change of the main vehicle M is finished is the minimum safe distance Smin(MF), at this time tm1'Satisfy the requirement of
Figure BDA0003125115360000085
Solved to obtain
Figure BDA0003125115360000086
Setting the distance between the master vehicle M and the vehicle F after the lane change of the master vehicle M as a critical distance 0, wherein the time for the lane change of the master vehicle M is tm2'At this time tm2'Satisfy the requirement of
Figure BDA0003125115360000087
Solved to obtain
Figure BDA0003125115360000088
Will tm1'Substituting into acceleration variation function a (t) to obtain am1', will tm2'Substituting into acceleration variation function a (t) to obtain am2', obtaining achange=(am1',am2'](ii) a Based on achange=(am1',am2']At t, is requiredm2’Inner adjusting mainAcceleration of the vehicle M varies to satisfy achangeWhile ensuring that the temperature is at (t)m2,tm1]Speed v of the host vehicle M in a time periodmEqual to or greater than the speed V of the front vehicle FF
Further, in S6, when both the front vehicle N and the rear vehicle F are present, the specific process is as follows:
minimum safe distance S between main vehicle M and vehicle N when setting replacement pathmin(MN) according to the minimum safe distance Smin(MN) calculating the minimum safety clearance S between the host vehicle M and the vehicle NMSD(MN)=max{SMN(tm),Smin(MN); wherein t ismThe time from the lane change start of the master vehicle M to the minimum safety clearance from the surrounding vehicles N, SMN(tm) Is the minimum safety clearance of the host vehicle M from the surrounding vehicles N,
Figure BDA0003125115360000091
t∈[0,tm1],SMN(0) the initial distance, a, between the main truck M and the truck N at the zero time of lane changeNIs the acceleration of the vehicle N, aMIs the acceleration, v, of the vehicle MN(0) Is the initial velocity, v, of the vehicle NM(0) Is the initial velocity, t, of the vehicle Mm1The elapsed time for changing lanes of the master vehicle M;
calculating the longitudinal distance between the head of the main vehicle M and the parking spaces of the N vehicles:
Figure BDA0003125115360000092
wherein S isNIs the distance N traveled on the target lane, SN=VN*tM,SMAs is the distance traveled by the host vehicle M,
Figure BDA0003125115360000093
LNthe length of the vehicle N, WMThe main vehicle M is in a vehicle width, and theta is a lane changing yaw angle generated by the main vehicle M in the lane changing process;
calculating the real-time distance between the main vehicle M and the vehicle N:
Figure BDA0003125115360000094
minimum safe distance S between main vehicle M and vehicle F when setting a lane changemin(MF) according to the minimum safety distance Smin(MF) calculating the minimum safety clearance S between the host vehicle M and the vehicle NMSD(MF)=max{SMF(tm'),Smin(MF) }; wherein t ism'For the time from the lane change start of the master vehicle M to the minimum safety clearance from the surrounding vehicle F, SMF(tm') Is the minimum safety clearance of the host vehicle M from the surrounding vehicles F,
Figure BDA0003125115360000095
t∈[0,tm1'],SMF(0) is the initial distance, a, between the master vehicle M and the vehicle F at the zero time of lane changeFIs the acceleration of the vehicle F, aMIs the acceleration, v, of the vehicle MF(0) Is the initial velocity v of the vehicle FM(0) Is the initial velocity, t, of the vehicle Mm1'The elapsed time for changing lanes of the master vehicle M;
calculating the longitudinal distance between the head of the main vehicle M and the parking space of the vehicle F:
Figure BDA0003125115360000101
wherein S isFIs the distance traveled by the vehicle F on the target lane, SF=VF*tM',SMAs is the distance traveled by the host vehicle M,
Figure BDA0003125115360000102
LMthe length of the vehicle M, WMThe main vehicle M is in a vehicle width, and theta is a lane changing yaw angle generated by the main vehicle M in the lane changing process;
calculating the real-time distance S between the main vehicle M and the vehicle Freal(MF):
Figure BDA0003125115360000103
Judgment Sreal(MN)≥SMSD(MN) and Sreal(MF)≥SMSD(MF) is satisfied at the same time, and if not, the vehicle M continues to run in the current lane or stops for waiting until Sreal(MN)≥SMSD(MN) and Sreal(MF)≥SMSD(MF) the same asThe time is right;
when S isreal(MN)≥SMSD(MN) and Sreal(MF)≥SMSD(MF) is established simultaneously, setting the minimum safe distance S between the vehicles N and F on the target lanemin(NF) according to the minimum safety distance Smin(NF) calculating the minimum safety clearance S between vehicle N and vehicle FMSD(NF)=max{SNF(t), smin (nf) }, wherein SNF(t)=SMN(t)+SMF(t)=SN+SMN(0)+SMF(0)-SF-2L-2WM*sinθ;
Calculating the real-time distance S between the vehicle N and the vehicle Freal(NF):
Figure BDA0003125115360000104
Wherein SNF(0) The initial distance between the master vehicle N and the vehicle F at the zero time of lane change;
judgment Sreal(NF)≥SMSD(NF) is true, if not, the vehicle M continues to run or stop in the current lane until Sreal(NF)≥SMSD(NF) is true;
when S isreal(NF)≥SMSD(NF) establishing, keeping the vehicle N and the vehicle F running at a constant speed, and setting the distance between the main vehicle M and the vehicle N after the main vehicle M finishes changing the lane as the minimum safe distance Smin(MN) at this time tm1Satisfy the requirement of
Figure BDA0003125115360000111
Solved to obtain
Figure BDA0003125115360000112
Setting the distance between the main vehicle M and the vehicle N after the lane change of the main vehicle M as a critical distance 0, wherein the time for the main vehicle M to pass the lane change is tm2At this time tm2Satisfy the requirement of
Figure BDA0003125115360000113
Solved to obtain
Figure BDA0003125115360000114
Will tm1Substituting into acceleration variation function a (t) to obtain am1Will tm2Substituting into acceleration variation function a (t) to obtain am2
Setting the distance between the main vehicle M and the vehicle F after the lane change of the main vehicle M as the minimum safe distance Smin(MF), at this time tm1'Satisfy the requirement of
Figure BDA0003125115360000115
Solved to obtain
Figure BDA0003125115360000116
Setting the distance between the master vehicle M and the vehicle F after the lane change of the master vehicle M as a critical distance 0, wherein the time for the lane change of the master vehicle M is tm2'At this time tm2'Satisfy the requirement of
Figure BDA0003125115360000117
Solved to obtain
Figure BDA0003125115360000118
Will tm1'Substituting into acceleration variation function a (t) to obtain am1', will tm2'Substituting into acceleration variation function a (t) to obtain am2';
A at this time is obtainedchange=(am1’,am2’]∪(am1,am2]The combination lane change time is generally within 5s, and the vehicle M needs to be in t ═ min { t }m1,tm2’5s } adjusting acceleration change of the host vehicle M to satisfy achangeWhile ensuring that the vehicle speed v of the host vehicle M is made at the time of completion of lane changemKeeping the speed of the front vehicle F and the rear vehicle N at a constant speed.
Compared with the prior art, the technical scheme of the invention has the following advantages:
(1) considering the condition of the mixed traffic flow, calculating the optimal safety gap distance triggering time and acceleration based on the acquired real-time traffic flow information and the running condition information of surrounding vehicles, optimizing the acceleration and deceleration of the intelligent network vehicle lane change process, and improving the traffic efficiency of the ramp merging area;
(2) the influence of interfering vehicles on lane change of the intelligent networked vehicle under different conditions of coming vehicles before and after lane change is considered, and meanwhile, the feasibility of the method is dynamically evaluated by using the expected path function according to the current traffic environment, so that rear-end collision accidents of the vehicles in the lane change process are avoided, and the safety and reliability of automatic driving in the lane change process are effectively improved;
(3) the method is based on the intelligent internet vehicle driving lane change track expectation function, and analyzes the acceleration change of the vehicle at different moments so as to perform post-adjustment and optimization processing, thereby shortening the lane change time of the intelligent vehicle while ensuring safe lane change.
Drawings
In order that the present disclosure may be more readily and clearly understood, reference will now be made in detail to the present disclosure, examples of which are illustrated in the accompanying drawings.
Fig. 1 is a flowchart for implementing the ramp merging stream switching control provided by the present invention.
FIG. 2 is a diagram of a function of the driving track of the M vehicle entering the target lane in the invention.
Fig. 3 is a schematic diagram of the positional relationship between the adjacent vehicle N and the adjacent vehicle F on the target lane when the M vehicle changes lanes in the present invention.
Fig. 4 is a track diagram illustrating the lane change of the vehicle M to the target lane in the present invention.
Fig. 5 is a communication area information sensing diagram of the expressway turn-merging area in the invention.
Detailed Description
The present invention is further described below in conjunction with the following figures and specific examples so that those skilled in the art may better understand the present invention and practice it, but the examples are not intended to limit the present invention.
In the description of the present invention, it should be understood that the term "comprises/comprising" is intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of S or elements is not limited to those listed but may alternatively include other S or elements not listed or inherent to such process, method, article, or apparatus.
Referring to the flowchart in fig. 1, an embodiment of the method for controlling the merging and changing of the intelligent networked vehicle on the expressway ramp under the mixed-driving condition in the invention comprises the following steps:
s1: the intelligent internet vehicle serves as a main vehicle M to drive into the expressway confluence area, and the main vehicle M acquires surrounding road environment information in a communication area based on an intelligent vehicle path system and an intelligent vehicle-mounted system; the range of the acquired surrounding road environment information is shown as a broken line range in fig. 5, and the sensing area range is preset to 800m in the present embodiment. The surrounding road environment information includes lane information, vehicle information (vehicle type, vehicle running position and speed information, vehicle running state), and obstacle information;
s2: calculating the triggering time t of the minimum safe distance of the vehicle A around the lane where the main vehicle M is away from according to the surrounding road environment informationi+cTrigger time t according to minimum safety distancei+cFurther calculating the minimum safety clearance SMSD(MA), minimum safety gap SMSD(MA) it is possible to ensure that the host vehicle M does not collide with the surrounding vehicles A at the time of lane change.
S2.1: the triggering time for calculating the minimum safe distance between the master vehicle M and the vehicle A around the lane where the master vehicle M is located according to the surrounding road environment information is obtained according to the minimum safe distance of the master vehicle M, and specifically comprises the following steps:
minimum safe distance Smin(MA) a minimum distance at which the host vehicle M does not collide with the surrounding vehicle a in a following state, set according to a running speed of the vehicle; in the embodiment, the minimum safe distance S is set under the condition that the speed of the main vehicle M is 40km/hmin(MA) 30 m. If the speed of the host vehicle M is faster and the flow rate of the vehicle in the lane is larger, the minimum safe distance is set correspondingly larger.
The triggering time of the minimum safety distance is obtained according to vehicle dynamics and initial vehicle speed difference analysis under the condition that other factors are ignored. That is, the traffic environment in the invention is only an ideal state, and other factors such as weather, road friction, air resistance and the like are not considered.
Triggering time t of minimum safety distancei+c=ti+tcWherein t isiFor the main truck M to pass from the initial position to the position before changing lanesElapsed adjustment time, tcIs the time from the start of the lane change to the minimum safe distance from the surrounding vehicle a.
In this example tiThe adjustment time t before lane change of the M cars from the initial positioncFrom the adjusted start time to the time when the distance between the two vehicle heads is 30m, namely:
Figure BDA0003125115360000141
wherein a isMIs the acceleration of the host vehicle M, aAAcceleration, v, of vehicle AM(0) Is the initial velocity, v, of the host vehicle MA(0) The initial velocity of car a.
S2.2: calculating the minimum safety clearance according to the triggering time of the minimum safety distance, specifically:
s2.2.1: calculating the longitudinal distance between the head of the main vehicle M and the parking space of the vehicle A
Figure BDA0003125115360000142
Wherein SMA(0) The initial distance between the master vehicle M and the vehicle A at the zero time of lane change, alpha is the yaw angle of lane change of the master vehicle M, aMIs the acceleration of the host vehicle M, aAAcceleration, v, of vehicle AM(0) Is the initial velocity, v, of the host vehicle MA(0) The initial velocity, W, of the vehicle AMThe width of the main vehicle M is wide; in general, the lane-changing yaw angle of the vehicle is between 3 ° and 5 °, so that the value of sin α tends to 0, and the value of cos α tends to 1, and the longitudinal distance between the head of the host vehicle M and the stall of the vehicle a can be simplified as follows:
Figure BDA0003125115360000143
s2.2.2: the minimum safety clearance between the main vehicle M and the vehicle A is obtained by the triggering time of the longitudinal distance, the minimum safety distance and the minimum safety distance between the vehicle head of the main vehicle M and the vehicle seat A:
SMSD(MA)=max{SMA(ti+c),Smin(MA)};
s3: obtaining the real-time distance S between the main vehicle M and the surrounding vehicles Areal(MA) determining a real-time distance S between the host vehicle M and the surrounding vehicle Areal(MA) minimum safety clearance SMSD(MA) comparison, if Sreal(MA)<SMSD(MA), the host M does not generate the lane change motive, executing S4; if Sreal(MA)≥SMSD(MA), the master M generating the lane change motive, performing S5;
s4: the master vehicle M continues to run in the lane or stops to wait for the lane change opportunity, and skips to execute S3 to Sreal(MA)≥SMSD(MA) the host M generating a lane change motive, performing S5;
if v is the time when the main vehicle M continues to run in the lane or stops for waiting for the lane-changing timeM-vAIs a value greater than a preset speed threshold, vMIs the current speed, v, of the vehicle MAThe vehicle M properly decelerates and warns to prompt the surrounding additional vehicle A to accelerate to leave the accelerating lane or decelerates to a time waiting for parking and changing the lane so that the vehicle in front of the accelerating lane changes the lane preferentially; if v isM-vAThe value of the speed threshold is less than or equal to the preset speed threshold, and the vehicle M performs a lane change decision at a constant speed or at a proper and uniform acceleration on the premise of ensuring that the vehicle in front of the acceleration lane changes lanes preferentially, so that the vehicle on the current lane can safely and effectively drive away from the acceleration lane. The speed threshold in this embodiment is 20 km/h.
S5: establishing a driving lane changing track f (x) and a target lane line g (x) of the master vehicle M, calculating an expected path function with time as a parameter variable on the basis of the driving lane changing track and the target lane line, and obtaining a speed change function and an acceleration change function by the expected path function;
s5.1: establishing a driving lane changing track f (x) and a target lane line g (x) of the master vehicle M, specifically:
the driving lane change track f (x) of the master vehicle M is obtained by fitting a polynomial function of degree 5:
f(x)=a0+a1x1+a2x2+a3x3+a4x4+a5x5
considering the flexibility of the target lane line, the target lane line g (x) is obtained by fitting a polynomial function of degree 4:
g(x)=b0x0+b1x1+b2x2+b3x3+b4x4
s5.2: calculating an expected path function with time as a parameter variable according to the driving lane change track and the target lane line, and specifically:
s5.2.1: as shown in FIG. 2, the host vehicle M makes a lane change at a constant vehicle speed, and the position of the host vehicle M at the end of the lane change is at the tangent point (x) of the lane change trajectory and the target lane linem,ym) In the above case, the curvature of the lane change trajectory of the host vehicle M and the curvature of the target lane line at the tangent point are the same, that is, the curvature of the polynomial function at the tangent point
Figure BDA0003125115360000161
Wherein, f' (x)m) The driving change track f (x) of the master M being at point xmFirst derivative of (a), g' (x)m) Is a target lane line g (x) at point xmThe first derivative of (c).
Further unfolding the curvature K yields:
Figure BDA0003125115360000162
s5.2.2: when the main vehicle M changes the road, the actual road section is in lateral linearity, the influence of the bending degree on the road surface can be ignored to a certain extent, namely b 1-b 2-b 3-b 4-0, and the target road line g (x) can be reduced to g (x) -b0x0=b0
G (x) b0Substituted into the curvature K to obtain
Figure BDA0003125115360000163
Solving to obtain the optimal unary quintic polynomial equation, and obtaining the driving lane change track of the main vehicle M as follows:
Figure BDA0003125115360000164
s5.2.3: the running distance of the main vehicle M
Figure BDA0003125115360000171
The driving switching track f (x) in S5.2.2 is substituted to obtain the expected path function g (t) with time as a parameter variable, which is:
Figure BDA0003125115360000172
s5.3: obtaining a speed change function and an acceleration change function from the expected path function, specifically:
obtaining a velocity variation function by performing a derivation on the expected path function g (t)
Figure BDA0003125115360000173
Carrying out one-time derivation on the speed change function to obtain an acceleration change function
Figure BDA0003125115360000174
Wherein,
Figure BDA0003125115360000175
vmindicates the initial speed of lane change, amRepresenting initial acceleration of lane change, t representing elapsed time of lane change, b0Is the position of the target lane on the coordinate system.
S6: the main vehicle M acquires the surrounding road environment information again and judges whether a front vehicle N and a rear vehicle F exist in the target lane for switching, and under the three conditions that only the front vehicle N exists, only the rear vehicle F exists, and both the front vehicle N and the rear vehicle F exist, the front vehicle N of the target lane for switching to according to the main vehicle M respectivelyAnd the running information of the rear vehicle F calculates the acceleration a required when the main vehicle M changes the lanechangeThe master vehicle M is accelerated by an acceleration achangeAnd (5) changing the lane into the target lane, and updating the state information of the intelligent vehicle internet vehicle. The vehicle operation change is a dynamic process, so that the environmental information of the surrounding road needs to be acquired in real time, and the host vehicle M acquires the surrounding road environmental information again to determine whether the adjacent preceding and following vehicles on the target lane change the lane.
S6.1: the main vehicle M judges whether a front vehicle N and a rear vehicle F exist in the target lane changed into the lane according to the surrounding road environment information acquired again, and if only the front vehicle N exists, S6.2-S6.7 are executed; if only the rear vehicle F exists, executing S6.8-S6.13; if the front vehicle N and the rear vehicle F are both available, executing S6.14-S6.18;
s6.2: minimum safe distance S between main vehicle M and vehicle N when setting replacement pathmin(MN) in the present embodiment, S is set with reference to a domestic vehicle travel safety distancemin(MN) ═ 30 m. According to the minimum safety distance Smin(MN) calculating the minimum safety clearance S between the host vehicle M and the vehicle NMSD(MN)=max{SMN(tm),Smin(MN)};
Wherein t ismThe time from the lane change start of the master vehicle M to the minimum safety clearance from the surrounding vehicles N, SMN(tm) Is the minimum safety clearance of the host vehicle M from the surrounding vehicles N, here tmIs t is obtained as followsm1
Figure BDA0003125115360000181
t∈[0,tm1],SMN(0) The initial distance, a, between the main truck M and the truck N at the zero time of lane changeNIs the acceleration of the vehicle N, aMIs the acceleration, v, of the vehicle MN(0) Is the initial velocity, v, of the vehicle NM(0) Is the initial velocity, t, of the vehicle Mm1The elapsed time for lane change of the master vehicle M.
S6.3: calculating the longitudinal distance between the head of the main vehicle M and the parking spaces of the N vehicles: sMN(t)=SN+SMN(0)-SM-LN-WM*sinθ;
Wherein S isMN(0) The initial distance S between the main vehicle M and the vehicle N at the zero time of lane changeNIs the distance N traveled on the target lane, SMThe distance traveled by the host vehicle M, LNThe length of the vehicle N, WMThe main vehicle M is in a vehicle width, and theta is a lane changing yaw angle generated by the main vehicle M in the lane changing process; in the embodiment, the length and the width of the vehicle are respectively 3.4m and 1.8m according to the standard small vehicle.
Solving for S based on vehicle dynamics and physicsN、SMTo obtain:
SN=VN*tM
Figure BDA0003125115360000182
in general, the lane change yaw angle of a vehicle is between 3 ° and 5 °, so that if the value of sin α is close to 0 and the value of cos α is close to 1, the vehicle will have a lane change yaw angle of 3 ° to 5 °
Figure BDA0003125115360000191
S6.4: calculating the real-time distance S between the main vehicle M and the vehicle Nreal(MN), should satisfy:
Figure BDA0003125115360000192
s6.5: judgment Sreal(MN)≥SMSD(MN) is true, if true, S6.6 is executed; if not, the vehicle M continues to run or stop in the current lane until Sreal(MN)≥SMSD(MN) true, go to S6.6;
s6.6: setting the distance between the master vehicle M and the vehicle N after the lane change of the master vehicle M as the minimum safe distance Smin(MN) at this time tm1Satisfy the requirement of
Figure BDA0003125115360000193
Solved to obtain
Figure BDA0003125115360000194
Setting the distance between the main vehicle M and the vehicle N after the lane change of the main vehicle M as a critical distance 0, wherein the time for the main vehicle M to pass the lane change is tm2At this time tm2Satisfy the requirement of
Figure BDA0003125115360000195
Solved to obtain
Figure BDA0003125115360000196
S6.7: will tm1Substituting acceleration change function
Figure BDA0003125115360000197
To obtain am1Will tm2Substituting acceleration change function
Figure BDA0003125115360000198
To obtain am2To obtain achange=(am1,am2]. Acceleration a during a lane changem1、am2And time t required for lane changem1、tm2Is the corresponding.
Based on achange=(am1,am2]At t, is requiredm2Adjusting acceleration change of the host vehicle M within time to satisfy achangeWhile ensuring that the pressure drop is at (t)m2,tm1]Speed v of the host vehicle M in a time periodmSpeed V of the preceding vehicle NNAnd the main vehicle M and the front vehicle N keep running at a constant speed at the time of finishing lane changing, so that the running safety is further ensured.
S6.8: minimum safe distance S between main vehicle M and vehicle F when setting a lane changemin(MF), in the present embodiment, S is set with reference to a domestic vehicle travel safety distancemin(MF) ═ 40 m. According to the minimum safety distance Smin(MF) calculating the minimum safety clearance S between the host vehicle M and the vehicle NMSD(MF)=max{SMF(tm'),Smin(MF)};
Wherein t ism'For the host vehicle M from lane change to the vehicle around the distanceTime for F to reach minimum safety gap, SMF(tm') Is the minimum safety clearance of the host vehicle M from the surrounding vehicle F, here tm'Is t is obtained as followsm1'
Figure BDA0003125115360000201
t∈[0,tm1'],SMF(0) Is the initial distance, a, between the master vehicle M and the vehicle F at the zero time of lane changeFAcceleration, v, of vehicle FF(0) The initial velocity of the vehicle F.
S6.9: calculating the longitudinal distance between the head of the main vehicle M and the parking space of the vehicle F: sMF(t)=SM+SMF(0)-SF-LM-WM*sinθ。
Wherein S isFIs the distance traveled by the vehicle F on the target lane, SMThe distance traveled by the host vehicle M, LMThe length of the vehicle M, WMThe main vehicle M is in a vehicle width, and theta is a lane changing yaw angle generated by the main vehicle M in the lane changing process;
solving for S based on vehicle dynamics and physicsF、SMTo obtain:
SF=VF*tM'
Figure BDA0003125115360000202
in general, the lane change yaw angle of the vehicle is between 3 ° and 5 °, so that the value of sin α tends to 0, the value of cos α tends to 1, and so on
Figure BDA0003125115360000203
S6.10: calculating the real-time distance S between the main vehicle M and the vehicle Freal(MF), which should satisfy:
Figure BDA0003125115360000211
s6.11: judgment Sreal(MF)≥SMSD(MF) is true, if true, S6.12 is performed; if not, the vehicle M continues to run or stop in the current lane until Sreal(MF)≥SMSD(MF) true, S6.12 is performed;
s6.12: setting the distance between the main vehicle M and the vehicle F after the lane change of the main vehicle M as the minimum safe distance Smin(MF), where the elapsed time for the lane change of the host vehicle M is tm1'At this time tm1'Satisfy the requirement of
Figure BDA0003125115360000212
Solved to obtain
Figure BDA0003125115360000213
Setting the distance between the master vehicle M and the vehicle F after the lane change of the master vehicle M as a critical distance 0, wherein the time for the lane change of the master vehicle M is tm2'At this time tm2'Satisfy the requirement of
Figure BDA0003125115360000214
Solved to obtain
Figure BDA0003125115360000215
S6.13: will tm1'Substituting acceleration change function
Figure BDA0003125115360000216
To obtain am1', will tm2'Substituting acceleration change function
Figure BDA0003125115360000217
To obtain am2', obtaining achange=(am1',am2']。
Based on achange=(am1',am2']At t, is requiredm2’Internally adjusting the acceleration change of the main vehicle M to satisfy achangeWhile ensuring that the temperature is at (t)m2,tm1]Speed v of the host vehicle M in a time periodmEqual to or greater than the speed V of the front vehicle FfFurther guarantee driving safetyAnd (4) completeness.
S6.14: when a vehicle N is in front of the main vehicle M and a vehicle F is in back of the main vehicle M, the main vehicle M needs to find an insertable gap for changing the lane; S6.2-S6.4 are executed to obtain SMSD(MN) and Sreal(MN), executing S6.8-S6.10 to obtain SMSD(MF) and Sreal(MF);
Judgment Sreal(MN)≥SMSD(MN) and Sreal(MF)≥SMSD(MF) is true at the same time, if true at the same time, perform S6.15; if not, the vehicle M continues to run or stop in the current lane until Sreal(MN)≥SMSD(MN) and Sreal(MF)≥SMSD(MF) is also true, S6.15 is performed;
s6.15: to satisfy the lane change of the host vehicle M in this state, a minimum safe distance S between the vehicle N and the vehicle F on the target lane is setmin(NF), in this embodiment, S is set with reference to the domestic safe driving distancemin(NF)=Smin(MN)+Smin(MF) ═ 70 m. According to the minimum safety distance Smin(NF) calculating the minimum safety clearance S between vehicle N and vehicle FMSD(NF)=max{SNF(t),Smin(NF)};
Wherein SNF(t)=SMN(t)+SMF(t)=SN+SMN(0)+SMF(0)-SF-2L-2WM*sinθ。
S6.16: calculating the real-time distance S between the vehicle N and the vehicle Freal(NF) satisfying:
Figure BDA0003125115360000221
wherein S isNF(0) The initial distance between the master vehicle N and the vehicle F at the zero time of lane change is shown.
S6.17: judgment Sreal(NF)≥SMSD(NF) judging whether the speed of the vehicle N and the speed of the vehicle F are equal, if so, keeping the vehicle N and the vehicle F to run at a constant speed, and executing S6.18; if not, the vehicle M continues to run or stop in the current lane until Sreal(NF)≥SMSD(NF) true, go to S6.18;
s6.18: execution of S66 to S6.7 obtaining tm1、tm2、am1And am2Executing S6.12-S6.13 to obtain tm1'、tm2'、am1' and am2';
A at this time is obtainedchange=(am1’,am2’]∪(am1,am2]Considering that the lane change time is about 5s generally, setting the longitudinal acceleration of the main vehicle M to be 0km/h can obtain the speed and the acceleration of the vehicle at different lane change moments based on the running track, and based on the safe lane change time of the traditional vehicle, the vehicle M needs to be in t-min { t } minm1,tm2’5s, i.e. it is necessary to complete the lane change at t ═ min { t }m1,tm2’5s } adjusting acceleration change of the host vehicle M to satisfy achangeWhile ensuring that the vehicle speed v of the host vehicle M is made at the time of completion of lane changemThe speed of the front vehicle F and the speed of the rear vehicle N are kept at a constant speed, and the driving safety is further guaranteed.
The main vehicle M in the invention can change the lane when driving from the ramp to the main road as shown in FIG. 3, or change the lane on a different lane of the main road as shown in FIG. 4.
Compared with the prior art, the technical scheme of the invention has the following advantages:
(1) considering the condition of the mixed traffic flow, calculating the optimal safety gap distance triggering time and acceleration based on the acquired real-time traffic flow information and the running condition information of surrounding vehicles, optimizing the acceleration and deceleration of the intelligent network vehicle lane change process, and improving the traffic efficiency of the ramp merging area;
(2) the influence of interfering vehicles on intelligent network vehicle lane changing under different conditions of coming vehicles before and after lane changing is considered, and meanwhile, the feasibility of the method is dynamically evaluated by using the expected path function according to the current traffic environment, so that rear-end collision accidents of the vehicles in the lane changing process are avoided, and the lane changing process is safer and more reliable;
(3) the method is based on the intelligent internet vehicle driving lane change track expectation function, and analyzes the acceleration change of the vehicle at different moments so as to perform post-adjustment and optimization processing, thereby shortening the lane change time of the intelligent vehicle while ensuring safe lane change.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operations S to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
It should be understood that the above examples are only for clarity of illustration and are not intended to limit the embodiments. Other variations and modifications will be apparent to persons skilled in the art in light of the above description. And are neither required nor exhaustive of all embodiments. And obvious variations or modifications of the invention may be made without departing from the spirit or scope of the invention.

Claims (10)

1. A method for controlling merging and changing of an intelligent online vehicle on an expressway ramp under mixed-traveling conditions is characterized by comprising the following steps of:
s1: the intelligent internet vehicle serves as a main vehicle M to drive into the expressway confluence area, and the main vehicle M acquires surrounding road environment information in a communication area based on an intelligent vehicle path system and an intelligent vehicle-mounted system;
s2: calculating the triggering time t of the minimum safe distance of the vehicle A around the lane where the main vehicle M is away from according to the surrounding road environment informationi+cTrigger time t according to minimum safety distancei+cCalculating the minimum safety clearance SMSD(MA), minimum safety gap SMSD(MA) ensuring that the host vehicle M does not collide with the surrounding vehicles A when changing lanes;
s3: obtaining the real-time distance S between the main vehicle M and the surrounding vehicles Areal(MA) determining a real-time distance S between the host vehicle M and the surrounding vehicle Areal(MA) minimum safety clearance SMSD(MA) comparison, if Sreal(MA)<SMSD(MA), the host M does not generate the lane change motive, executing S4; if Sreal(MA)≥SMSD(MA), the master M generating the lane change motive, performing S5;
s4: the master vehicle M continues to run in the lane or stops to wait for the lane change opportunity, and skips to execute S3 to Sreal(MA)≥SMSD(MA) the host M generating a lane change motive, performing S5;
s5: establishing a driving lane changing track f (x) and a target lane line g (x) of the master vehicle M, calculating an expected path function g (t) taking time as a parameter variable according to the driving lane changing track and the target lane line, and obtaining a speed change function v (t) and an acceleration change function a (t) by the expected path function g (t);
s6: the main vehicle M acquires the surrounding road environment information again and judges whether a front vehicle N and a rear vehicle F exist in the target lane for lane change, and the acceleration a required when the main vehicle M changes lanes is calculated under the three conditions that only the front vehicle N exists, only the rear vehicle F exists, and all the front vehicle N and the rear vehicle F existchangeThe master vehicle M is accelerated by an acceleration achangeAnd (5) changing the lane into the target lane, and updating the state information of the intelligent vehicle internet vehicle.
2. The intelligent online vehicle merging and changing control method for the expressway ramps under the mixed-traveling condition according to claim 1, wherein the intelligent online vehicle merging and changing control method comprises the following steps of: in the step S2, the triggering time t of the minimum safe distance of the vehicle A around the lane where the host vehicle M is located is calculated according to the surrounding road environment informationi+cThe method specifically comprises the following steps:
triggering time t of minimum safety distancei+c=ti+tcWherein t isiAdjustment time t required for passing of the master vehicle M from the initial position to before lane changecIs the time from the start of lane change to the minimum safe distance from the surrounding vehicle a; minimum safe distance Smin(MA) is a minimum distance at which the host vehicle M does not collide with the surrounding vehicle a in the following state, and is set according to the traveling speed of the vehicle.
3. The intelligent online vehicle merging and changing control method for the expressway ramps under the mixed-traveling condition according to claim 1, wherein the intelligent online vehicle merging and changing control method comprises the following steps of: the triggering time t according to the minimum safety distance in the step S2i+cCalculating the minimum safety clearance SMSD(MA), specifically:
calculating the longitudinal distance between the head of the main vehicle M and the parking space of the vehicle A
Figure FDA0003125115350000021
Wherein SMA(0) The initial distance between the master vehicle M and the vehicle A at the zero time of lane change, alpha is the yaw angle of lane change of the master vehicle M, aMIs the acceleration of the host vehicle M, aAIs that of vehicle AVelocity, vM(0) Is the initial velocity, v, of the host vehicle MA(0) The initial velocity, W, of the vehicle AMThe width of the main vehicle M is wide;
the minimum safety clearance between the main vehicle M and the vehicle A is obtained by the triggering time of the longitudinal distance, the minimum safety distance and the minimum safety distance between the head of the main vehicle M and the parking space of the vehicle A:
SMSD(MA)=max{SMA(ti+c),Smin(MA)}。
4. the intelligent online vehicle merging and changing control method for the expressway ramps under the mixed-traveling condition according to claim 1, wherein the intelligent online vehicle merging and changing control method comprises the following steps of: in the step S4, if v is in the process of the host vehicle M continuing to run in the lane or stopping for waiting for the lane change opportunityM-vAIs a value greater than a preset speed threshold, vMIs the current speed, v, of the vehicle MAThe vehicle M properly decelerates and warns to prompt the surrounding additional vehicle A to accelerate to leave the accelerating lane or decelerates to a time waiting for parking and changing the lane so that the vehicle in front of the accelerating lane changes the lane preferentially; if v isM-vAThe value of the speed threshold is less than or equal to the preset speed threshold, and the vehicle M performs a lane change decision at a constant speed or at a proper and uniform acceleration on the premise of ensuring that the vehicle in front of the acceleration lane changes lanes preferentially.
5. The intelligent online vehicle merging and changing control method for the expressway ramps under the mixed-traveling condition according to claim 1, wherein the intelligent online vehicle merging and changing control method comprises the following steps of: in the step S5, a driving lane change trajectory f (x) and a target lane line g (x) of the host M are established, specifically:
the driving lane change track f (x) of the master vehicle M is obtained by fitting a polynomial function of degree 5:
f(x)=a0+a1x1+a2x2+a3x3+a4x4+a5x5
the target lane line g (x) is obtained by fitting a polynomial function of degree 4:
g(x)=b0x0+b1x1+b2x2+b3x3+b4x4
6. the intelligent online vehicle merging and changing control method for the expressway ramps under the mixed-traveling condition according to claim 5, wherein the intelligent online vehicle merging and changing control method comprises the following steps of: in the step S5, an expected path function g (t) with time as a parameter variable is calculated according to the lane change track and the target lane line, where the expected path function g (t) with time as a parameter variable is:
Figure FDA0003125115350000031
7. the intelligent online vehicle merging and changing control method for the expressway ramps under the mixed-traveling condition according to claim 1, wherein the intelligent online vehicle merging and changing control method comprises the following steps of: in the step S5, a velocity change function v (t) and an acceleration change function a (t) are obtained from the expected path function g (t), and the velocity change function
Figure FDA0003125115350000032
Said acceleration change function
Figure FDA0003125115350000033
Wherein,
Figure FDA0003125115350000041
Figure FDA0003125115350000042
vmindicates the initial speed of lane change, amRepresenting initial acceleration of lane change, t representing elapsed time of lane change, b0Is the position of the target lane on the coordinate system.
8. The intelligent online vehicle merging and changing control method for the expressway ramps under the mixed-traveling condition according to claim 1, wherein the intelligent online vehicle merging and changing control method comprises the following steps of: when only the front vehicle N is available in the S6, the specific process is as follows:
minimum safe distance S between main vehicle M and vehicle N when setting replacement pathmin(MN) according to the minimum safe distance Smin(MN) calculating the minimum safety clearance S between the host vehicle M and the vehicle NMSD(MN)=max{SMN(tm),Smin(MN); wherein t ismThe time from the lane change start of the master vehicle M to the minimum safety clearance from the surrounding vehicles N, SMN(tm) Is the minimum safety clearance of the host vehicle M from the surrounding vehicles N,
Figure FDA0003125115350000043
SMN(0) the initial distance, a, between the main truck M and the truck N at the zero time of lane changeNIs the acceleration of the vehicle N, aMIs the acceleration, v, of the vehicle MN(0) Is the initial velocity, v, of the vehicle NM(0) Is the initial velocity, t, of the vehicle Mm1The elapsed time for changing lanes of the master vehicle M;
calculating the longitudinal distance between the head of the main vehicle M and the parking spaces of the N vehicles:
Figure FDA0003125115350000044
wherein S isNIs the distance N traveled on the target lane, SN=VN*tM,SMAs is the distance traveled by the host vehicle M,
Figure FDA0003125115350000045
LNthe length of the vehicle N, WMThe main vehicle M is in a vehicle width, and theta is a lane changing yaw angle generated by the main vehicle M in the lane changing process;
calculating the real-time distance between the main vehicle M and the vehicle N:
Figure FDA0003125115350000046
judgment Sreal(MN)≥SMSD(MN) is established, if not, the vehicle M continues to run or stop in the current lane until Sreal(MN)≥SMSD(MN) true;
when S isreal(MN)≥SMSD(MN) is established, and the main vehicle M is set to finish lane changeThe distance between the rear part and the vehicle N is the minimum safe distance Smin(MN) at this time tm1Satisfy the requirement of
Figure FDA0003125115350000051
Solved to obtain
Figure FDA0003125115350000052
Setting the distance between the main vehicle M and the vehicle N after the lane change of the main vehicle M as a critical distance 0, wherein the time for the main vehicle M to pass the lane change is tm2At this time tm2Satisfy the requirement of
Figure FDA0003125115350000053
Solved to obtain
Figure FDA0003125115350000054
Will tm1Substituting into acceleration variation function a (t) to obtain am1Will tm2Substituting into acceleration variation function a (t) to obtain am2To obtain achange=(am1,am2](ii) a Based on achange=(am1,am2]At t, is requiredm2Adjusting acceleration change of the host vehicle M within time to satisfy achangeWhile ensuring that the pressure drop is at (t)m2,tm1]Speed v of the host vehicle M in a time periodmSpeed V of the preceding vehicle NNAnd when the main vehicle M finishes lane changing, the main vehicle M and the vehicle N in front keep running at a constant speed.
9. The intelligent online vehicle merging and changing control method for the expressway ramps under the mixed-traveling condition according to claim 1, wherein the intelligent online vehicle merging and changing control method comprises the following steps of: when only the rear vehicle F exists in the S6, the specific process is as follows:
minimum safe distance S between main vehicle M and vehicle F when setting a lane changemin(MF) according to the minimum safety distance Smin(MF) calculating the minimum safety clearance S between the host vehicle M and the vehicle NMSD(MF)=max{SMF(tm'),Smin(MF) }; wherein t ism'For the main vehicle M to get from the lane change to the vehicle F around the distanceTime to minimum safety gap, SMF(tm') Is the minimum safety clearance of the host vehicle M from the surrounding vehicles F,
Figure FDA0003125115350000055
SMF(0) is the initial distance, a, between the master vehicle M and the vehicle F at the zero time of lane changeFIs the acceleration of the vehicle F, aMIs the acceleration, v, of the vehicle MF(0) Is the initial velocity v of the vehicle FM(0) Is the initial velocity, t, of the vehicle Mm1'The elapsed time for changing lanes of the master vehicle M;
calculating the longitudinal distance between the head of the main vehicle M and the parking space of the vehicle F:
Figure FDA0003125115350000056
wherein S isFIs the distance traveled by the vehicle F on the target lane, SF=VF*tM',SMAs is the distance traveled by the host vehicle M,
Figure FDA0003125115350000061
LMthe length of the vehicle M, WMThe main vehicle M is in a vehicle width, and theta is a lane changing yaw angle generated by the main vehicle M in the lane changing process;
calculating the real-time distance S between the main vehicle M and the vehicle Freal(MF):
Figure FDA0003125115350000062
Judgment Sreal(MF)≥SMSD(MF) is true, if not, the vehicle M continues to run or stop in the current lane until Sreal(MF)≥SMSD(MF) is established;
when S isreal(MF)≥SMSD(MF) establishing that the distance between the main vehicle M and the vehicle F after the lane change of the main vehicle M is finished is the minimum safe distance Smin(MF), at this time tm1'Satisfy the requirement of
Figure FDA0003125115350000063
Solved to obtain
Figure FDA0003125115350000064
Setting the distance between the master vehicle M and the vehicle F after the lane change of the master vehicle M as a critical distance 0, wherein the time for the lane change of the master vehicle M is tm2'At this time tm2'Satisfy the requirement of
Figure FDA0003125115350000065
Solved to obtain
Figure FDA0003125115350000066
Will tm1'Substituting into acceleration variation function a (t) to obtain am1', will tm2'Substituting into acceleration variation function a (t) to obtain am2', obtaining achange=(am1',am2'](ii) a Based on achange=(am1',am2']At t, is requiredm2’Internally adjusting the acceleration change of the main vehicle M to satisfy achangeWhile ensuring that the temperature is at (t)m2,tm1]Speed v of the host vehicle M in a time periodmEqual to or greater than the speed V of the front vehicle FF
10. The intelligent online vehicle merging and changing control method for the expressway ramps under the mixed-traveling condition according to claim 1, wherein the intelligent online vehicle merging and changing control method comprises the following steps of: in S6, when both the front vehicle N and the rear vehicle F are present, the specific process is as follows:
minimum safe distance S between main vehicle M and vehicle N when setting replacement pathmin(MN) according to the minimum safe distance Smin(MN) calculating the minimum safety clearance S between the host vehicle M and the vehicle NMSD(MN)=max{SMN(tm),Smin(MN); wherein t ismThe time from the lane change start of the master vehicle M to the minimum safety clearance from the surrounding vehicles N, SMN(tm) Is the minimum safety clearance of the host vehicle M from the surrounding vehicles N,
Figure FDA0003125115350000071
SMN(0) the initial distance between the main truck M and the truck N at the zero time of lane changeFrom, aNIs the acceleration of the vehicle N, aMIs the acceleration, v, of the vehicle MN(0) Is the initial velocity, v, of the vehicle NM(0) Is the initial velocity, t, of the vehicle Mm1The elapsed time for changing lanes of the master vehicle M;
calculating the longitudinal distance between the head of the main vehicle M and the parking spaces of the N vehicles:
Figure FDA0003125115350000072
wherein S isNIs the distance N traveled on the target lane, SN=VN*tM,SMAs is the distance traveled by the host vehicle M,
Figure FDA0003125115350000073
LNthe length of the vehicle N, WMThe main vehicle M is in a vehicle width, and theta is a lane changing yaw angle generated by the main vehicle M in the lane changing process;
calculating the real-time distance between the main vehicle M and the vehicle N:
Figure FDA0003125115350000074
minimum safe distance S between main vehicle M and vehicle F when setting a lane changemin(MF) according to the minimum safety distance Smin(MF) calculating the minimum safety clearance S between the host vehicle M and the vehicle NMSD(MF)=max{SMF(tm'),Smin(MF) }; wherein t ism'For the time from the lane change start of the master vehicle M to the minimum safety clearance from the surrounding vehicle F, SMF(tm') Is the minimum safety clearance of the host vehicle M from the surrounding vehicles F,
Figure FDA0003125115350000075
SMF(0) is the initial distance, a, between the master vehicle M and the vehicle F at the zero time of lane changeFIs the acceleration of the vehicle F, aMIs the acceleration, v, of the vehicle MF(0) Is the initial velocity v of the vehicle FM(0) Is the initial velocity, t, of the vehicle Mm1'The elapsed time for changing lanes of the master vehicle M;
calculating the longitudinal distance between the head of the main vehicle M and the parking space of the vehicle F:
Figure FDA0003125115350000076
wherein S isFIs the distance traveled by the vehicle F on the target lane, SF=VF*tM',SMAs is the distance traveled by the host vehicle M,
Figure FDA0003125115350000081
LMthe length of the vehicle M, WMThe main vehicle M is in a vehicle width, and theta is a lane changing yaw angle generated by the main vehicle M in the lane changing process;
calculating the real-time distance S between the main vehicle M and the vehicle Freal(MF):
Figure FDA0003125115350000082
Judgment Sreal(MN)≥SMSD(MN) and Sreal(MF)≥SMSD(MF) is satisfied at the same time, and if not, the vehicle M continues to run in the current lane or stops for waiting until Sreal(MN)≥SMSD(MN) and Sreal(MF)≥SMSD(MF) is established simultaneously;
when S isreal(MN)≥SMSD(MN) and Sreal(MF)≥SMSD(MF) is established simultaneously, setting the minimum safe distance S between the vehicles N and F on the target lanemin(NF) according to the minimum safety distance Smin(NF) calculating the minimum safety clearance S between vehicle N and vehicle FMSD(NF)=max{SNF(t), smin (nf) }, wherein SNF(t)=SMN(t)+SMF(t)=SN+SMN(0)+SMF(0)-SF-2L-2WM*sinθ;
Calculating the real-time distance S between the vehicle N and the vehicle Freal(NF):
Figure FDA0003125115350000083
Wherein SNF(0) The initial distance between the master vehicle N and the vehicle F at the zero time of lane change;
judgment Sreal(NF)≥SMSD(NF) is true, and if not,the vehicle M continues to run or stop in the current lane until Sreal(NF)≥SMSD(NF) is true;
when S isreal(NF)≥SMSD(NF) establishing, keeping the vehicle N and the vehicle F running at a constant speed, and setting the distance between the main vehicle M and the vehicle N after the main vehicle M finishes changing the lane as the minimum safe distance Smin(MN) at this time tm1Satisfy the requirement of
Figure FDA0003125115350000084
Solved to obtain
Figure FDA0003125115350000085
Setting the distance between the main vehicle M and the vehicle N after the lane change of the main vehicle M as a critical distance 0, wherein the time for the main vehicle M to pass the lane change is tm2At this time tm2Satisfy the requirement of
Figure FDA0003125115350000091
Solved to obtain
Figure FDA0003125115350000092
Will tm1Substituting into acceleration variation function a (t) to obtain am1Will tm2Substituting into acceleration variation function a (t) to obtain am2
Setting the distance between the main vehicle M and the vehicle F after the lane change of the main vehicle M as the minimum safe distance Smin(MF), at this time tm1'Satisfy the requirement of
Figure FDA0003125115350000093
Solved to obtain
Figure FDA0003125115350000094
Setting the distance between the master vehicle M and the vehicle F after the lane change of the master vehicle M as a critical distance 0, wherein the time for the lane change of the master vehicle M is tm2'At this time tm2'Satisfy the requirement of
Figure FDA0003125115350000095
Solved to obtain
Figure FDA0003125115350000096
Will tm1'Substituting into acceleration variation function a (t) to obtain am1', will tm2'Substituting into acceleration variation function a (t) to obtain am2';
A at this time is obtainedchange=(am1’,am2’]∪(am1,am2]The combination lane change time is generally within 5s, and the vehicle M needs to be in t ═ min { t }m1,tm2’5s } adjusting acceleration change of the host vehicle M to satisfy achangeWhile ensuring that the vehicle speed v of the host vehicle M is made at the time of completion of lane changemKeeping the speed of the front vehicle F and the rear vehicle N at a constant speed.
CN202110687438.1A 2021-06-21 2021-06-21 Intelligent network vehicle merging and changing control method for expressway ramps under mixed-traveling condition Active CN113246985B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110687438.1A CN113246985B (en) 2021-06-21 2021-06-21 Intelligent network vehicle merging and changing control method for expressway ramps under mixed-traveling condition

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110687438.1A CN113246985B (en) 2021-06-21 2021-06-21 Intelligent network vehicle merging and changing control method for expressway ramps under mixed-traveling condition

Publications (2)

Publication Number Publication Date
CN113246985A true CN113246985A (en) 2021-08-13
CN113246985B CN113246985B (en) 2022-08-09

Family

ID=77189040

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110687438.1A Active CN113246985B (en) 2021-06-21 2021-06-21 Intelligent network vehicle merging and changing control method for expressway ramps under mixed-traveling condition

Country Status (1)

Country Link
CN (1) CN113246985B (en)

Cited By (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113327441A (en) * 2021-02-04 2021-08-31 长沙理工大学 Network-connection automatic vehicle speed control and track optimization method based on highway confluence area
CN113990085A (en) * 2021-10-11 2022-01-28 南京航空航天大学 Traffic grooming method and system for ramp afflux area
CN114202949A (en) * 2021-12-13 2022-03-18 大连理工大学宁波研究院 Method for distinguishing adjacent vehicles and adjusting reference path of intelligent networked automobile on highway
CN114435405A (en) * 2022-03-21 2022-05-06 北京主线科技有限公司 Vehicle lane changing method, device, equipment and storage medium
CN114715156A (en) * 2022-05-18 2022-07-08 北京小马智卡科技有限公司 Method, device, equipment and storage medium for controlling vehicle to enter and exit ramp
CN114842644A (en) * 2022-04-26 2022-08-02 河北工业大学 Traffic capacity calculation method for mixed traffic flow intersection area
CN115042792A (en) * 2022-08-17 2022-09-13 浙江吉利控股集团有限公司 Vehicle control method and device
CN115063995A (en) * 2022-04-15 2022-09-16 重庆大学 Expressway burst bottleneck area network connection automatic vehicle control method and device
CN115206093A (en) * 2022-06-21 2022-10-18 同济大学 Traffic flow control method based on intelligent network connection vehicle
CN115376346A (en) * 2022-08-11 2022-11-22 苏州大学 Multi-mode driving vehicle collaborative intersection method for expressway confluence area under mixed-driving condition
CN115497323A (en) * 2022-09-29 2022-12-20 斯润天朗(北京)科技有限公司 Vehicle cooperative lane changing method and device based on V2X
CN115547035A (en) * 2022-08-31 2022-12-30 交通运输部公路科学研究所 Beyond-visual-range collision avoidance driving control method and device and information physical system
CN115641717A (en) * 2022-10-19 2023-01-24 长沙理工大学 Highway main line-ramp vehicle cooperative confluence control method and device based on mixed traffic flow and storage medium
CN115662131A (en) * 2022-10-26 2023-01-31 合肥工业大学 Multi-lane cooperative lane changing method for road accident section in networking environment
CN115817460A (en) * 2022-11-07 2023-03-21 苏州大学 Intelligent network vehicle-connected active coordination collision avoidance method under mixed flow condition
CN115830886A (en) * 2023-02-09 2023-03-21 西南交通大学 Intelligent network vehicle collaborative lane change time sequence calculation method, device, equipment and medium
CN116363905A (en) * 2023-05-19 2023-06-30 吉林大学 Heterogeneous traffic flow converging region lane change time judging and active safety control method
CN116469263A (en) * 2023-04-26 2023-07-21 合肥工业大学 Traffic flow control method considering bus stop under network environment
CN116543595A (en) * 2023-05-24 2023-08-04 合肥工业大学 Dynamic regulation and control method for CAV special lane change decision point of expressway diversion area
CN116740939A (en) * 2023-06-29 2023-09-12 西部科学城智能网联汽车创新中心(重庆)有限公司 Intelligent network-connected vehicle running planning method and device
CN117681878A (en) * 2024-02-04 2024-03-12 西南交通大学 Intelligent network-connected automobile collaborative lane changing method based on formation perception
US12131632B1 (en) 2023-04-26 2024-10-29 Hefei University Of Technology Methods for traffic flow control considering bus stops in connected environment

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106218638A (en) * 2016-08-17 2016-12-14 北方工业大学 Intelligent network-connected automobile cooperative lane change control method
CN107315411A (en) * 2017-07-04 2017-11-03 合肥工业大学 A kind of lane-change method for planning track based on automatic driving vehicle under collaborative truck
US20200180633A1 (en) * 2018-12-07 2020-06-11 Nio Usa, Inc. Systems and methods of autonomously controlling vehicle lane change maneuver
CN111338351A (en) * 2020-03-24 2020-06-26 东南大学 Multi-intelligent-network-connection vehicle cooperative confluence control method for expressway ramp entrance
CN111422197A (en) * 2020-05-18 2020-07-17 吉林大学 Intelligent driving vehicle active lane changing system considering intelligent vehicle group flow

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106218638A (en) * 2016-08-17 2016-12-14 北方工业大学 Intelligent network-connected automobile cooperative lane change control method
CN107315411A (en) * 2017-07-04 2017-11-03 合肥工业大学 A kind of lane-change method for planning track based on automatic driving vehicle under collaborative truck
US20200180633A1 (en) * 2018-12-07 2020-06-11 Nio Usa, Inc. Systems and methods of autonomously controlling vehicle lane change maneuver
CN111338351A (en) * 2020-03-24 2020-06-26 东南大学 Multi-intelligent-network-connection vehicle cooperative confluence control method for expressway ramp entrance
CN111422197A (en) * 2020-05-18 2020-07-17 吉林大学 Intelligent driving vehicle active lane changing system considering intelligent vehicle group flow

Cited By (34)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113327441A (en) * 2021-02-04 2021-08-31 长沙理工大学 Network-connection automatic vehicle speed control and track optimization method based on highway confluence area
CN113327441B (en) * 2021-02-04 2022-03-08 长沙理工大学 Network-connection automatic vehicle speed control and track optimization method based on highway confluence area
CN113990085A (en) * 2021-10-11 2022-01-28 南京航空航天大学 Traffic grooming method and system for ramp afflux area
CN114202949A (en) * 2021-12-13 2022-03-18 大连理工大学宁波研究院 Method for distinguishing adjacent vehicles and adjusting reference path of intelligent networked automobile on highway
CN114202949B (en) * 2021-12-13 2024-04-12 大连理工大学宁波研究院 Method for identifying adjacent vehicles and adjusting reference paths of expressway intelligent network-connected automobile
CN114435405A (en) * 2022-03-21 2022-05-06 北京主线科技有限公司 Vehicle lane changing method, device, equipment and storage medium
CN115063995A (en) * 2022-04-15 2022-09-16 重庆大学 Expressway burst bottleneck area network connection automatic vehicle control method and device
CN114842644A (en) * 2022-04-26 2022-08-02 河北工业大学 Traffic capacity calculation method for mixed traffic flow intersection area
CN114715156A (en) * 2022-05-18 2022-07-08 北京小马智卡科技有限公司 Method, device, equipment and storage medium for controlling vehicle to enter and exit ramp
CN115206093B (en) * 2022-06-21 2023-08-29 同济大学 Traffic flow control method based on intelligent network-connected vehicle
CN115206093A (en) * 2022-06-21 2022-10-18 同济大学 Traffic flow control method based on intelligent network connection vehicle
CN115376346A (en) * 2022-08-11 2022-11-22 苏州大学 Multi-mode driving vehicle collaborative intersection method for expressway confluence area under mixed-driving condition
CN115042792B (en) * 2022-08-17 2022-11-08 浙江吉利控股集团有限公司 Vehicle control method and device
CN115042792A (en) * 2022-08-17 2022-09-13 浙江吉利控股集团有限公司 Vehicle control method and device
CN115547035A (en) * 2022-08-31 2022-12-30 交通运输部公路科学研究所 Beyond-visual-range collision avoidance driving control method and device and information physical system
CN115547035B (en) * 2022-08-31 2023-08-29 交通运输部公路科学研究所 Beyond-visual-distance collision avoidance running control method and device and information physical system
CN115497323A (en) * 2022-09-29 2022-12-20 斯润天朗(北京)科技有限公司 Vehicle cooperative lane changing method and device based on V2X
CN115641717A (en) * 2022-10-19 2023-01-24 长沙理工大学 Highway main line-ramp vehicle cooperative confluence control method and device based on mixed traffic flow and storage medium
CN115641717B (en) * 2022-10-19 2023-09-19 长沙理工大学 Highway main line-ramp vehicle cooperative confluence control method, device and storage medium based on mixed traffic flow
CN115662131A (en) * 2022-10-26 2023-01-31 合肥工业大学 Multi-lane cooperative lane changing method for road accident section in networking environment
CN115662131B (en) * 2022-10-26 2023-07-25 合肥工业大学 Multi-lane collaborative lane changing method for road accident section in network environment
CN115817460A (en) * 2022-11-07 2023-03-21 苏州大学 Intelligent network vehicle-connected active coordination collision avoidance method under mixed flow condition
CN115817460B (en) * 2022-11-07 2024-04-05 苏州大学 Intelligent network linkage vehicle active coordination collision avoidance method under mixed flow condition
CN115830886A (en) * 2023-02-09 2023-03-21 西南交通大学 Intelligent network vehicle collaborative lane change time sequence calculation method, device, equipment and medium
CN116469263A (en) * 2023-04-26 2023-07-21 合肥工业大学 Traffic flow control method considering bus stop under network environment
CN116469263B (en) * 2023-04-26 2024-04-12 合肥工业大学 Traffic flow control method considering bus stop under network environment
US12131632B1 (en) 2023-04-26 2024-10-29 Hefei University Of Technology Methods for traffic flow control considering bus stops in connected environment
CN116363905B (en) * 2023-05-19 2023-09-05 吉林大学 Heterogeneous traffic flow converging region lane change time judging and active safety control method
CN116363905A (en) * 2023-05-19 2023-06-30 吉林大学 Heterogeneous traffic flow converging region lane change time judging and active safety control method
CN116543595A (en) * 2023-05-24 2023-08-04 合肥工业大学 Dynamic regulation and control method for CAV special lane change decision point of expressway diversion area
CN116543595B (en) * 2023-05-24 2024-04-26 合肥工业大学 Dynamic regulation and control method for CAV special lane change decision point of expressway diversion area
CN116740939A (en) * 2023-06-29 2023-09-12 西部科学城智能网联汽车创新中心(重庆)有限公司 Intelligent network-connected vehicle running planning method and device
CN117681878A (en) * 2024-02-04 2024-03-12 西南交通大学 Intelligent network-connected automobile collaborative lane changing method based on formation perception
CN117681878B (en) * 2024-02-04 2024-04-16 西南交通大学 Intelligent network-connected automobile collaborative lane changing method based on formation perception

Also Published As

Publication number Publication date
CN113246985B (en) 2022-08-09

Similar Documents

Publication Publication Date Title
CN113246985B (en) Intelligent network vehicle merging and changing control method for expressway ramps under mixed-traveling condition
CN111688663B (en) Motor vehicle and method for controlling automatic driving operation thereof
CN111862635B (en) Traffic signal lamp-based vehicle speed control method and device and automobile
CN108459588B (en) Automatic driving method and device and vehicle
CN111986514B (en) Vehicle-based data processing method, device, equipment and medium
US11142203B2 (en) Cooperative vehicle navigation
CN106470886B (en) Method for establishing the ambient enviroment model of means of transport
US11529952B2 (en) On-vehicle control device, traveling speed control method, and computer program
CN106991846B (en) Highway vehicle forced lane changing control method under Internet of vehicles environment
US6169940B1 (en) Automatic driving system
CN112292719B (en) Adapting the trajectory of an ego-vehicle to a moving foreign object
CN112820125B (en) Intelligent internet vehicle traffic guidance method and system under mixed traffic condition
CN111469847B (en) Lane change path planning method and system
JP2007219743A (en) Traveling control system for automobile
US10319226B2 (en) Vehicle control device
EP3895947A1 (en) Parking control method and parking control device
CN110949387A (en) Vehicle control device
CN109955851B (en) Lane changing decision and track planning method
CN116985790A (en) Intelligent networking automobile decision-making method and system for intersection without signal lamp
CN115273461A (en) Intersection driving method and device for vehicle, vehicle and storage medium
US12012103B2 (en) Vehicle control method and vehicle control device
CN111103882A (en) Autonomous following control method for unmanned electric vehicle
CN111688693B (en) Vehicle control device, vehicle control method, and storage medium
JP7257882B2 (en) Driving support method and driving support device
CN113496613B (en) Autonomous traveling vehicle and operation management device for autonomous traveling vehicle

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