CN112477846B - Intelligent networking electric automobile queue control method giving consideration to stability and energy conservation - Google Patents

Intelligent networking electric automobile queue control method giving consideration to stability and energy conservation Download PDF

Info

Publication number
CN112477846B
CN112477846B CN202011267689.6A CN202011267689A CN112477846B CN 112477846 B CN112477846 B CN 112477846B CN 202011267689 A CN202011267689 A CN 202011267689A CN 112477846 B CN112477846 B CN 112477846B
Authority
CN
China
Prior art keywords
vehicle
queue
ith
following
stability
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202011267689.6A
Other languages
Chinese (zh)
Other versions
CN112477846A (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.)
Southeast University
Original Assignee
Southeast 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 Southeast University filed Critical Southeast University
Priority to CN202011267689.6A priority Critical patent/CN112477846B/en
Publication of CN112477846A publication Critical patent/CN112477846A/en
Application granted granted Critical
Publication of CN112477846B publication Critical patent/CN112477846B/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/02Control of vehicle driving stability
    • 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
    • B60W50/00Details of control systems for road vehicle drive control not related to the control of a particular sub-unit, e.g. process diagnostic or vehicle driver interfaces
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00Computer-aided design [CAD]
    • G06F30/20Design optimisation, verification or simulation
    • GPHYSICS
    • G08SIGNALLING
    • G08GTRAFFIC CONTROL SYSTEMS
    • G08G1/00Traffic control systems for road vehicles
    • G08G1/20Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles
    • 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
    • B60W50/00Details of control systems for road vehicle drive control not related to the control of a particular sub-unit, e.g. process diagnostic or vehicle driver interfaces
    • B60W2050/0001Details of the control system
    • B60W2050/0043Signal treatments, identification of variables or parameters, parameter estimation or state estimation
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02TCLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
    • Y02T10/00Road transport of goods or passengers
    • Y02T10/80Technologies aiming to reduce greenhouse gasses emissions common to all road transportation technologies
    • Y02T10/84Data processing systems or methods, management, administration

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Mechanical Engineering (AREA)
  • Automation & Control Theory (AREA)
  • Transportation (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Human Computer Interaction (AREA)
  • Computer Hardware Design (AREA)
  • Evolutionary Computation (AREA)
  • Geometry (AREA)
  • General Engineering & Computer Science (AREA)
  • Electric Propulsion And Braking For Vehicles (AREA)

Abstract

The invention provides an intelligent networking electric automobile queue control method giving consideration to stability and energy conservation, which comprises the following steps: constructing a vehicle motor model and a vehicle distance strategy of an electric vehicle queue; constructing a single vehicle dynamics model and a vehicle queue model to complete the establishment of a vehicle energy consumption objective function; constructing a linear state feedback controller for the vehicles by using a feedback control strategy, and simultaneously analyzing the control gain range of each vehicle according to the queue stability; and optimizing control gain by applying a selected genetic algorithm, solving by taking the target function as a fitness function to obtain the optimal control gain, and realizing the goals of queue stability and energy conservation. The invention provides an intelligent networking electric automobile queue control method considering stability and energy conservation, aiming at intelligent networking electric automobiles, and by optimizing the working point of a motor, the energy consumption efficiency of each automobile is obviously improved, and the integral energy efficiency of the automobile queue is improved.

Description

Intelligent networking electric automobile queue control method giving consideration to stability and energy conservation
Technical Field
An intelligent networking electric automobile queue control method giving consideration to both stability and energy conservation optimizes energy consumption of a vehicle queue on the premise of ensuring the queue stability of the vehicle queue, and belongs to the field of economic control of intelligent networking electric automobile queues.
Background
The intelligent vehicle queue control technology is that intelligent vehicles running on a road form a queue, the vehicles in the queue can obtain information of surrounding environment and the road through an environment sensing technology, vehicle state information sharing among vehicle queues is realized through a vehicle-to-outside information exchange (V2X) wireless communication technology, single vehicle node control in the queue is completed on the basis, and a cooperative control technology for stable running of the vehicle queues is achieved on the whole.
For an intelligent vehicle queue, the queue stability and the queue energy-saving effect are two crucial performance indexes, and the research enthusiasm of a large number of scholars at home and abroad is attracted. Most of the available literature and patents focus on the cohort stability of the study cohort. However, few have explored vehicle fleet stability while considering energy efficiency. When the queue encounters interference, the energy efficiency of the queue can be influenced by the changed speed, and the common vehicle queue control method is mostly based on that vehicles in the queue run along with a pilot vehicle to track the pilot vehicle speed in real time, so that the method can cause the phenomenon that the number of unnecessary acceleration and deceleration times of the following vehicles in the vehicle queue is increased, and the energy consumption of the whole queue is increased. In addition, most of the current domestic and foreign researches on vehicle queues are directed at fuel vehicles and hybrid electric vehicles, few researches are carried out on applying the energy-saving control of the vehicle queues to pure electric vehicles, and the electric vehicles have the natural advantages of high motor response speed and easiness in torque accurate regulation and control of a drive-by-wire system, and the motors feed back braking to recover energy, so that the energy-saving optimization effect of the electric vehicle queues is expected to be superior to that of the fuel vehicles and the hybrid electric vehicles.
Disclosure of Invention
The purpose of the invention is as follows: the invention aims to solve the problem of road traffic jam, improve the traffic efficiency, improve the driving safety and improve the vehicle economy.
The technical scheme is as follows: in order to solve the above problems, the present invention provides the following technical solutions:
an intelligent networking electric automobile queue control method giving consideration to both stability and energy conservation is characterized in that: the method comprises the following steps:
step 1: constructing a vehicle motor model and a vehicle distance strategy of an electric vehicle queue;
step 2: constructing a single vehicle dynamics model and a vehicle queue model to complete the establishment of a vehicle energy consumption objective function;
and step 3: constructing a linear state feedback controller for the vehicles by using a feedback control strategy, and simultaneously analyzing the control gain range of each vehicle according to the queue stability;
and 4, step 4: and optimizing control gain by applying a selected genetic algorithm, solving by taking the target function as a fitness function to obtain the optimal control gain, and realizing the goals of queue stability and energy conservation.
In step 1, the vehicle motor model is as follows:
Figure BDA0002776605950000021
wherein, PmIs the motor power, wmIs the motor speed, TmIn order to be the torque of the motor,
Figure BDA0002776605950000022
in order to achieve the driving efficiency of the motor,
Figure BDA0002776605950000023
generating efficiency for the motor;
in step 1, the inter-vehicle distance strategy is: during the vehicle queue running, the queue control aims at keeping the distance between adjacent vehicles at a desired inter-vehicle distance and keeping the speed of the following vehicle consistent with that of the pilot vehicle, namely
Figure BDA0002776605950000024
Wherein v isi(t)The speed of the ith following vehicle at time t; v. of0(t)The speed of the piloted vehicle at time t; p is a radical ofi-1(t)The motor power of the i-1 th following vehicle at the time t; p is a radical ofi(t)The motor power of the ith following vehicle at the time t; n is the number of following vehicles; di-1,iRepresenting the desired inter-vehicle distance between node i-1 and node i, di-1,i>0;
The definition of the expected vehicle distance satisfies the following operational expression:
Figure BDA0002776605950000025
the geometry of the train being determined by the desired vehicle spacing di-1,iThe specific selection decision of (2);
for constant distance type of vehicle spacing, di-1,iIs a fixed constant, i.e.
di-1,i=d0,i∈n (14)
Wherein d is0Is a constant greater than zero;
for constant-headway type vehicle spacing, di-1,iIs a linear function related to the vehicle speed, i.e.
di-1,i=thvi+d0,i∈n (15)
Wherein, thThe time interval of following the vehicle;
for non-linear distance type inter-vehicle distance, di-1,iIs a non-linear function related to the vehicle speed, i.e.
di-1,i=g(vi),i∈n (16)
The goals of vehicle fleet control are:
dmin≤di-1,i≤dmax (17)
wherein d isminRepresenting the minimum allowable inter-vehicle distance, dmaxRepresenting the maximum allowable car-to-car distance.
In the step 1, a vehicle motor model and an inter-vehicle distance strategy of an electric vehicle queue are constructed according to a selected workshop information flow topological structure, wherein the selected workshop information flow topological structure is in a front vehicle-navigator following mode, namely a set of one navigator and n following vehicles is defined as the queue, and each vehicle i can receive information of the navigator and adjacent vehicles.
The plant information flow topology is described by a directed graph g, wherein the directed graph g represents the information flow topology between the following vehicles in the queuen+1Representing the information flow between the following vehicle and the pilot vehicle:
directed graph gn={vnn,AnIn which the vertices are collectedvn1,2, …, n, and an edge set epsilonn=vn×vnAdjacent matrix An=[aij]∈Rn×nWherein a isijIs a non-negative contiguous element;
directed graph gn+1={vn+1n+1,An+1V, node collection vn+1={v0,v1,…,vn}, edge union εn+1=vn+1×vn+1Adjacent matrix An=[aij]∈R(n+1)×(n+1)
The topology of the information flow in the queue is represented by gnAnd gn+1Characterized as the following three matrices:
(1) adjacency matrix An
(2) Laplace matrix
Figure BDA0002776605950000031
(3) Traction matrix
Figure BDA0002776605950000032
Wherein A isn=[aij]∈Rn×nIs defined as follows
Figure BDA0002776605950000033
Wherein, aij1, namely representing that the ith vehicle can receive the state information from the jth vehicle; suppose this gnIn which no self-loop is present, i.e. all of aij0, i belongs to n; the information set of all vehicle state information that the vehicle i can receive is defined as:
Ni={j|aij=1}
the set represents a collection of all vehicles that can acquire information, in the following vehicles, by vehicle i through V2X communication or radar detection; the degree of entry of vehicle i is defined as
Figure BDA0002776605950000041
At the same time, the in-degree matrix is defined as
Figure BDA0002776605950000042
Corresponds to gnLaplacian matrix of
Figure BDA0002776605950000043
Is defined as
Figure BDA0002776605950000044
And corresponds to gn+1Traction matrix P ∈ Rn×nFor describing the case where the following vehicle acquires the relevant pilot vehicle state information, the following is defined as follows:
Figure BDA0002776605950000045
wherein if {0, i }. epsilon. [ epsilon ], [ epsilon ]n+1Then p isi0, otherwise piWhen the ith vehicle can acquire the relevant state information of the pilot vehicle, the value p is represented as 0i1 is ═ 1; at this time, the ith vehicle is also called as being directly towed by the pilot vehicle.
Under the workshop information flow topological structure of the front vehicle-navigator following mode, the information set of the vehicle i is
Figure BDA0002776605950000046
The adjacency matrix and the Laplace matrix of the topological structure of the workshop information flow are
Figure BDA0002776605950000047
Figure BDA0002776605950000051
Piloting vehicle reachable set of vehicle i
(Pi)PLF={0}
Therefore, the traction matrix representation of the plant information flow topology is as follows
Figure BDA0002776605950000052
And 2, constructing a single vehicle dynamics model and a vehicle queue model to complete the establishment of a vehicle energy consumption objective function:
dynamic model of single vehicle
The vehicle queue consists of n +1 vehicle groups, wherein the pilot vehicle is manually controlled and is numbered as 0, and the number of the whole vehicle queue is from 0 to n;
the longitudinal dynamics model of the ith vehicle is:
Figure BDA0002776605950000053
wherein, ViIs the speed of the ith vehicle in the queue; δ is a mass transfer factor; u. ofiIs an input to a vehicle system; g is the acceleration of gravity; f is the rolling resistance coefficient; thetaiIs a road slope angle; ρ is the air density; a. theiIs the cross-sectional area of the vehicle; cd,iIs the air resistance coefficient; m isiIs the mass of the ith vehicle;
vehicle queue model
The intelligent vehicle fleet is represented as:
Pp=[P0,P1,…Pn]T,Vp=[V0,V1,…Vn]T,Fp=[F0,F1,…Fn]T,Ff,p=[Ff,0,Ff,1,…Ff,n]T,Fg,p=[Fg,0,Fg,1,…Fg,n]T,FA,p=[FA,0,FA,1,…FA,n]T
the dynamics of the cohort are as follows:
Figure BDA0002776605950000061
wherein, Pp、Vp、Fp、Ff,p、Fg,pAnd FA,pIs the set of position, speed, resultant longitudinal tire force, rolling resistance, ramp inclination resistance and air resistance of each vehicle; m ispThe mass of the vehicle, being a homogenous vehicle train, has mp=miThe mass of each vehicle is the same;
the mathematical structure of the queue is described as follows:
Figure BDA0002776605950000062
Figure BDA0002776605950000063
wherein D isdIs the desired vehicle spacing; l isiIs the length of the vehicle;
Figure BDA0002776605950000064
is the error between the desired pitch and the actual pitch;
Figure BDA0002776605950000065
is a pair of
Figure BDA0002776605950000066
Derivation is carried out; piThe position of the ith vehicle in the queue;
vehicle energy consumption model
The ith vehicle in the queue from the initial time t0The energy consumption of the destination reached for time t is:
Figure BDA0002776605950000067
wherein f isiFor the energy consumption of the ith vehicle:
Figure BDA0002776605950000068
wherein the content of the first and second substances,
Figure BDA0002776605950000069
is the efficiency of the motor; pm,iThe motor power required by the ith vehicle;
motor power P required by ith vehiclem,iComprises the following steps:
Figure BDA00027766059500000610
wherein, Pf,iIs the power consumed by the vehicle to overcome the grade resistance, Pf,i=migfcos(θi)Vi;Pg,iIs the power consumed by the vehicle to overcome the grade resistance, Pg,i=migfcos(θi)Vi;PA,iIs the power consumed by the vehicle to overcome the air resistance;
Figure BDA00027766059500000611
Pa,iis the power required for the acceleration of the vehicle,
Figure BDA00027766059500000612
ηiis the mechanical transmission efficiency.
In step 3, the transfer function of the linear state feedback controller is:
Figure BDA0002776605950000071
controlling gain k1,k2,k3,k4The ranges of (A) are as follows:
Figure BDA0002776605950000072
step 4, in the control gain range obtained in the step 3, optimizing the control gain by using a genetic algorithm, and solving the optimal control gain, wherein the steps are as follows:
the optimization objective is to minimize the vehicle energy consumption J, which is expressed as follows:
Figure BDA0002776605950000073
to control the gain kjIs an independent variable, j is 1,2,3, 4; taking the energy consumption J of the vehicle queue as a fitness function:
Figure BDA0002776605950000074
s.t.
Figure BDA0002776605950000075
Mmin≤Mi≤Mmax,
k3 2+2k1k3≥0,
k4 2+2k1k4-2k1-2k3≥0,
k1>0,k2>0,k3>0,k4>0,
k1<20,k2<20,k3<20,k4<20
wherein M isminAnd MmaxRepresents a minimum value and a maximum value of the motor torque; j. the design is a squarei(kj) Is the ith vehicle at control gain kjEnergy consumption under control.
The basic operation process of the genetic algorithm is as follows:
a) initializing, namely setting an evolution algebra counter t to be 0, setting a maximum evolution algebra G, and randomly generating N individuals as an initial population P (0);
b) evaluating individuals, namely calculating the fitness of each individual in the population P (t);
c) selecting operation, namely acting the selecting operator on the group;
d) performing cross operation, namely acting a cross operator on the group;
e) mutation operation, namely acting mutation operators on the population; the group P (t) is subjected to selection, intersection and mutation operation to obtain a next generation group P (t + 1);
f) and (5) judging a termination condition, namely if t is G, outputting the individual with the maximum fitness obtained in the evolution process as an optimal solution, and terminating the calculation.
Has the advantages that: compared with the prior art, the invention has the advantages that:
1. innovatively proposes to improve vehicle economy by optimizing control gain;
2. gain is optimized and controlled through a genetic algorithm, so that the calculation efficiency is higher, and the method is suitable for real vehicle scenes;
3. the intelligent networking electric automobile queue control with both stability and energy conservation is realized;
4. road gradient conditions are considered in the queue economy, and the queue economy better accords with actual road situations.
Drawings
FIG. 1 is a schematic diagram of a workshop information flow topological structure selecting a front vehicle-navigator following mode according to an embodiment of the invention;
FIG. 2 is a flow chart of a genetic algorithm according to an embodiment of the present invention;
fig. 3 is a control method for an intelligent networked electric vehicle queue with both stability and energy saving in accordance with an embodiment of the present invention.
Detailed Description
The invention will be further described with reference to the accompanying drawings in which:
fig. 1 is a flow chart of the intelligent networked electric vehicle queue as an object for selecting a front vehicle-navigator following mode by a vehicle queue workshop information flow topological structure according to fig. 3.
Firstly, establishing a basic model of a vehicle queue: and selecting a workshop information flow topological structure, and constructing a vehicle motor model and a vehicle distance strategy according to the selected workshop information flow topological structure.
The workshop information flow topological structure selects a front vehicle-navigator following mode, namely, a set of one navigator vehicle and n following vehicles is defined as a queue, and each vehicle i can receive information of the navigator vehicle and adjacent vehicles. The workshop information flow topological structure is described by algebraic graph theory, a set comprising a pilot vehicle and n following vehicles is defined as a queue, and the information flow topological structure between the following vehicles in the queue is represented by a directed graph g. Directed graph gn={vnn,AnV, in which the vertex sets v n1,2, …, n, and an edge set epsilonn=vn×vnAdjacent matrix An=[aij]∈Rn×nWherein a isijAre non-negative contiguous elements. In the directed graph, each vertex refers to a following vehicle, if the vertex i refers to the ith following vehicle, j, i represents a directed edge from the following vehicle j to the vehicle i, which indicates that the following vehicle i can obtain state information from the vehicle j, and the information flow between the following vehicle and the pilot vehicle can be used as an augmented directed graph gn+1={vn+1n+1,An+1Denotes, where the node collection vn+1={v0,v1,…,vn}, edge union εn+1=vn+1×vn+1Adjacent matrix An=[aij]∈R(n+1)×(n+1). The topology of the information flow in the queue can be represented by gnAnd gn+1Characterized as the following three matrices:
(1) adjacency matrix An
(2) Laplace matrix
Figure BDA0002776605950000091
(3) Traction matrix
Figure BDA0002776605950000092
Wherein A isn=[aij]∈Rn×nIs defined as follows
Figure BDA0002776605950000093
Wherein, aijThat is, 1 represents that the ith vehicle can receive the status information from the jth vehicle. Suppose this gnIn which no self-loop is present, i.e. all of aij0, i ∈ n. The information set of all vehicle state information that the vehicle i can receive is defined as:
Ni={j|aij=1} (2)
the set represents a collection of all vehicles that can acquire information by vehicle i through V2X communication or radar detection in the following vehicle. The degree of entry of vehicle i is defined as
Figure BDA0002776605950000094
At the same time, the in-degree matrix is defined as
Figure BDA0002776605950000095
Corresponds to gnLaplacian matrix of
Figure BDA0002776605950000096
Can be defined as
Figure BDA0002776605950000097
And corresponds to gn+1Traction matrix of
Figure BDA0002776605950000098
The following vehicle state information acquisition method can be used for describing the situation that the following vehicle acquires the related pilot vehicle state information, and is defined as follows:
Figure BDA0002776605950000099
wherein if {0, i }. epsilon. [ epsilon ], [ epsilon ]n+1Then p isi0, otherwise piWhen the ith vehicle can acquire the relevant state information of the pilot vehicle, the value p is represented as 0i1 is ═ 1; at this time, the ith vehicle is also called as being directly towed by the pilot vehicle. The purpose of using the traction matrix is to represent the information interaction between the vehicles in the queue and the pilot vehicle in the form of a matrix.
Two related underlying concepts are given below:
(1) directed path: if there is a set of directed edge sequence sets (i)1,i2),(i2,i3),…(ik-1,ik) Wherein
Figure BDA0002776605950000101
Then the directed edge sequence set is called as a slave node i1To ikA directed path.
(2) And (3) directed spanning tree, if the tree consisting of the edge sets in the graph can connect all nodes in the graph, the tree consisting of the edge sets is called a directed spanning tree.
If the edges are combinedn+1When there is a case that a subset constitutes a directed spanning tree, the directed graph gn+1Including a directed spanning tree. gn+1The minimum of the directional spanning trees which take the pilot vehicle as the starting point is the basis for meeting the system control. In short, there should be at least one directed path from the lead vehicle to any one of the following vehicles in the queue. This means that any one following vehicle can directly or indirectly obtain relevant state information from the lead vehicle. Under a preceding vehicle-navigator following mode (PLF) vehicle information flow topology, the information set of vehicle i is
Figure BDA0002776605950000102
Therefore, the adjacency matrix and the Laplace matrix of the topology of the plant information flow are
Figure BDA0002776605950000103
Figure BDA0002776605950000104
Piloting vehicle reachable set of vehicle i
(Pi)PLF={0},i=n (9)
Therefore, the traction matrix representation of the plant information flow topology is as follows
Figure BDA0002776605950000111
Because the vehicle queue is a pure electric vehicle, a motor model of the vehicle is constructed. The invention adopts a permanent magnet synchronous motor as a driving/braking motor of a vehicle, and the output power model is as follows:
Figure BDA0002776605950000112
wherein P ismIs the motor power, wmIs the motor speed, TmIn order to be the torque of the motor,
Figure BDA0002776605950000113
in order to achieve the driving efficiency of the motor,
Figure BDA0002776605950000114
the generating efficiency of the motor is obtained.
The inter-vehicle distance strategy is used for describing the geographical position relationship between adjacent vehicles in the queue, and generally, in the running process of the vehicle queue, the queue control aims to maintain the distance between the adjacent vehicles to be the expected inter-vehicle distance and keep the speed of the following vehicle consistent with that of the pilot vehicle, namely, the inter-vehicle distance strategy is used for describing the geographical position relationship between the adjacent vehicles in the queue, namely, the distance between the following vehicle and the pilot vehicle is maintained to be the expected inter-vehicle distance
Figure BDA0002776605950000115
Wherein d isi-1,i>0 represents the desired inter-vehicle distance between node i-1 and node i. The definition of the expected vehicle distance satisfies the following formula
Figure BDA0002776605950000116
The geometry of the train being determined by the desired vehicle spacing di-1,iIs determined by the specific selection of (a). For constant distance type of vehicle spacing, di-1,iIs a fixed constant, i.e.
di-1,i=d0,i∈n (14)
Wherein d is0Is a constant greater than zero. For constant-headway type vehicle spacing, di-1,iIs a linear function related to the vehicle speed, i.e.
di-1,i=thvi+d0,i∈n (15)
Wherein, thThe time interval for following the car. Since the platoon driving safety is closely related to the speed of the vehicles in the platoon, the higher the vehicle speed, the larger the minimum safety inter-vehicle distance required, and for non-linear distance inter-vehicle distances, di-1,iIs a non-linear function related to the vehicle speed, i.e.
di-1,i=g(vi),i∈n (16)
The goal of vehicle fleet control is not to require the following vehicle to be consistent with the lead vehicle speed, but rather to allow the distance between adjacent vehicles to fluctuate within a safe distance for better vehicle fleet economy, i.e., vehicle fleet economy
dmin≤di-1,i≤dmax (17)
Wherein d isminRepresenting the minimum allowable inter-vehicle distance, dmaxRepresenting the maximum allowable car-to-car distance.
Secondly, constructing a single vehicle dynamics model and a vehicle queue model to complete the establishment of a vehicle energy consumption objective function:
(1) dynamic model of single vehicle
The vehicle train consists of n +1 cars, where the lead car is manually controlled, numbered 0, and the entire vehicle train is numbered from 0 to n. Because all vehicles are pure electric vehicles and the motor has the characteristic of quick response of torque, the influence of inertial lag on subsequent vehicles is not considered.
The complete vehicle dynamics system is a nonlinear system, and the running state of the vehicle can be described more accurately by adopting an accurate vehicle model, however, the accurate model also increases the computational analysis burden of the vehicle system, and the required analysis result is difficult to quickly feed back, so the invention ignores the influence caused by the sliding of the vehicle tires and the vertical and transverse motion of the vehicle, and mainly studies the longitudinal motion of the vehicle. In which the vehicle longitudinal dynamics take into account air resistance, tire force, rolling resistance and tilting resistance. Will PiAnd ViIndicated as the position and speed of the ith vehicle in the queue. The longitudinal dynamics model of the ith vehicle can then be written as
Figure BDA0002776605950000121
Wherein m isiRepresenting vehicle mass, Fi,Ff,i,Fg,iAnd FA,iRespectively the resultant longitudinal tire force, rolling resistance, ramp inclination resistance and air resistance, Ff,i,Fg,iAnd FA,iCan be represented as:
Figure BDA0002776605950000122
wherein g is the acceleration of gravity; f is the rolling resistance coefficient; thetaiIs the road grade angle, and in practical cases, the road grade angle theta can be estimated by using some advanced positioning technology, such as Global Positioning System (GPS) and Geographic Information System (GIS)i(ii) a ρ is the air density; a. theiIs the cross-sectional area of the vehicle; cd,iIs the coefficient of air resistance, the magnitude of which depends on the inter-vehicle distance, Cd,iDistance d from vehicleiThe relationship of (a) to (b) is as follows:
Figure BDA0002776605950000131
wherein, CdIs the air resistance coefficient of the pilot vehicle,
Figure BDA0002776605950000132
is gamma1And gamma2Is the air resistance reduction of the parameter. Can be combined with FiExpressed as:
Fi=δmiui (21)
where δ is the quality conversion factor, uiIs an input to the vehicle system. The aforementioned longitudinal dynamics model can then be converted into:
Figure BDA0002776605950000133
(2) vehicle queue model
In this embodiment, the intelligent vehicle queue is composed of n +1 vehicles traveling from left to right, and is denoted by Pp=[P0,P1,…Pn]T,Vp=[V0,V1,…Vn]T,Fp=[F0,F1,…Fn]T,Ff,p=[Ff,0,Ff,1,…Ff,n]T,Fg,p=[Fg,0,Fg,1,…Fg,n]T,FA,p=[FA,0,FA,1,…FA,n]TThe kinetics of the cohort are as follows:
Figure BDA0002776605950000134
wherein m ispIs the mass of the vehicle, and is a uniform vehicle queue, so that m isp=miThe mass of each vehicle is the same. The mathematical structure of the queue can be described as follows:
Figure BDA0002776605950000135
wherein DdIs the desired vehicle spacing, LiIs the length of the vehicle and is,
Figure BDA0002776605950000136
is the error between the desired pitch and the actual pitch.
(3) Vehicle energy consumption model
The energy consumption of a vehicle depends on a number of factors, including motor torque, speed, efficiency, and gear ratio. The driving force equation of the electric vehicle can be calculated by the following equation.
Figure BDA0002776605950000137
Wherein M ist,iIs the combined torque of the motor torques transmitted to the tyre, MiIs the motor output torque, jiIs the speed ratio of the main reducer, etaiIs the mechanical transmission efficiency, riIs the wheel radius.
Motor power P required by ith vehiclem,iCan be expressed as:
Figure BDA0002776605950000141
wherein P isf,i=migfcos(θi)ViIs the power consumed by the vehicle to overcome the rolling resistance, Pg,i=migfcos(θi)ViIs the power consumed by the vehicle to overcome the grade resistance,
Figure BDA0002776605950000142
is the power consumed by the vehicle to overcome the air resistance,
Figure BDA0002776605950000143
is the power required for vehicle acceleration.
Then, the energy consumption of the ith car can be expressed as:
Figure BDA0002776605950000144
wherein
Figure BDA0002776605950000145
It is the efficiency of the motor, which is determined by the rotational speed and output torque of the motor. From the above, it can be seen that the ith vehicle in the queue has started from the initial time t0The energy consumption of the destination reached for time t is:
Figure BDA0002776605950000146
and thirdly, constructing a linear state feedback controller for the vehicles by using a feedback control strategy, and analyzing to obtain a control gain range of each vehicle according to the queue stability. This step proposes a distributed controller for vehicle queues that ensures the stability of its queue, i.e. that the transient errors do not spread gradually backwards along the queue. In addition, the value range of the control gain can be obtained according to calculation, and the control gain is optimized by taking improvement of the energy-saving efficiency of the vehicle queue as a guide.
The controller acting on the ith vehicle in the queue needs to apply all other vehicle information that it can receive to realize the control of the vehicle i and thus accomplish the macro driving goal of the whole queue. Wherein, all other vehicle information that the vehicle i can receive is defined as:
Ii=Ni∪Pi (27)
the design idea of the distributed controller is as follows:
Figure BDA0002776605950000147
wherein k isij,pAnd k isij,vReferring to the controller gain, the above equation is a general form of a linear controller.
The goal of the feedback control fleet control is to track the speed of the leading vehicle following the vehicle to maintain state consistency while satisfying the conditions in the following equation, which means that the vehicle spacing error and speed error in the fleet can be reduced to zero.
Figure BDA0002776605950000151
In order to achieve energy saving and simplify the queue control, the linear state feedback controller described above is used for each following vehicle.
Figure BDA0002776605950000152
Wherein k isj(j ═ 1,2,3,4) is the control gain;
Figure BDA0002776605950000153
is the desired distance between the lead vehicle and the ith following vehicle;
Figure BDA0002776605950000154
is the sum of all vehicle lengths between the lead vehicle and the ith following vehicle.
Here, a new tracking error ζ is defined for the ith following vehicleiComprises the following steps:
Figure BDA0002776605950000155
therefore, equation (30) can be rewritten as:
Figure BDA0002776605950000156
by combining equations (22) and (31), the following equation can be obtained:
Figure BDA0002776605950000157
wherein a is0Is the acceleration of the leading vehicle, defines xi=[ζiζi]Ti=[a0 cos(θi) sin(θi) Vi 2]TAs status and other information of the queue system. Therefore, equation (15) can be rewritten as
Figure BDA0002776605950000158
By combining equations (32) and (34), the model of the vehicle fleet may be represented by equation (35):
Figure BDA0002776605950000161
wherein x (t) ═ x1(t),x2(t),…,xn(t)]TRepresenting the state vector of each vehicle in the queue, [ psi (t) ]1(t),ψ2(t),…,ψn(t)]TRepresenting other information vectors, y (t) being control outputs
Figure BDA0002776605950000162
Q1,Q2Is a coefficient matrix represented by (36):
Figure BDA0002776605950000163
wherein Is(s ═ 2 or n) is an identity matrix of order s, the symbols
Figure BDA0002776605950000164
Represents the kronecker product, and KaAnd KbThen is a matrix representing the in-queue vehicle control gains:
Figure BDA0002776605950000165
in the above formula
Figure BDA0002776605950000166
The erroneous transfer of transient errors may lead to a breakdown of the vehicle train or to a collision accident, and therefore the train stability of the vehicle must be satisfied. The PLF workshop information flow topological structure is adopted, namely the inter-vehicle distance error of adjacent vehicles in a queue is measured by a radar, the state information of a pilot vehicle is transmitted by a V2X wireless communication technology, a vehicle controller is further designed according to the error information, and the acceleration of the vehicle is used as control input.
From equation (23) we can derive:
Figure BDA0002776605950000167
by combining equations (29) and (38), the following can be obtained:
Figure BDA0002776605950000168
by using the laplace transform, equation (39) can be transformed into:
Figure BDA0002776605950000171
based on the transfer function, for any range of values for which w >0 the control gain can be obtained, the following formula must be satisfied:
Figure BDA0002776605950000172
wherein
Figure BDA0002776605950000173
Because γ ≧ 0, if σ ≧ 0, then there is
Figure BDA0002776605950000174
I.e. the queue stability of the vehicle queue can be guaranteed and from this the control gain (k) can be derived1,k2,k3,k4) The ranges of (A) are as follows:
Figure BDA0002776605950000175
fourthly, optimizing control gain by applying a selected genetic algorithm, solving to obtain optimal control gain, and realizing the goals of queue stability and energy conservation;
genetic algorithm is a search algorithm used for solving the optimal result in computational mathematics, and for an optimization problem, the genetic algorithm is generally realized by providing a large number of candidate solutions through a computer and enabling the target to be optimized to better evolve so as to obtain the optimal solution. The genetic algorithm mainly uses the phenomena of heredity, mutation, natural selection, hybridization and the like contained in the biological population in the evolution process.
The basic operation process of the genetic algorithm is as follows, and the specific flow is shown in fig. 2:
a) and (3) initializing, namely setting an evolution algebra counter t to be 0, setting a maximum evolution algebra G, and randomly generating N individuals as an initial population P (0).
b) And (4) evaluating individuals, namely calculating the fitness of each individual in the population P (t).
c) And (4) selecting operation, namely acting a selection operator on the group. The purpose of selection is to inherit optimized individuals directly to the next generation or to generate new individuals by pairwise crossing and then to inherit them to the next generation. The selection operation is based on fitness evaluation of individuals in the population.
d) And (4) performing cross operation, namely applying a cross operator to the group. What plays a core role in genetic algorithms is the crossover operator.
e) And (4) mutation operation, namely acting mutation operators on the population. I.e., to vary the gene values at certain loci of the individual strings in the population. And (t) obtaining a next generation group P (t +1) after selection, crossing and mutation operations of the group P (t).
f) And (5) judging a termination condition, namely if t is G, outputting the individual with the maximum fitness obtained in the evolution process as an optimal solution, and terminating the calculation.
Since genetic algorithms start from a collection of problem solutions, rather than from a single solution, it is a great difference between genetic algorithms and traditional optimization algorithms. The traditional optimization algorithm is used for solving the optimal solution from a single initial value in an iteration mode, and the local optimal solution is easy to enter in a wrong mode. The genetic algorithm starts to search from an initial population, has large coverage and is beneficial to global preference.
Whether traveling on a flat road or on a slope, the vehicles in the fleet must track the speed of the lead vehicle. On a grade-changing highway, the speed of the lead vehicle may change with the grade of the downhill slope of the road, which may lead to unnecessary acceleration and deceleration of the following vehicle, and the unnecessary deceleration behavior may increase the energy consumption of the vehicle. Different control gains may cause the effect of following vehicle tracking in the queue to be different. Therefore, in this step, we will reduce the energy consumption of the vehicle by optimizing the control gain in the above-mentioned feedback controller.
The optimization goal of this step is to minimize vehicle energy consumption, which can be expressed as follows:
Figure BDA0002776605950000181
in the present application, Genetic Algorithms (GA) are selected for optimizing control gains, the implementation of GA is generally by computer simulation, and for an optimization problem, the objective to be optimized can be better evolved by abstract representation of a large number of candidate solutions. Here to control the gain kj(J ═ 1,2,3,4) as an argument, and energy consumption J of the vehicle fleet as a fitness function:
Figure BDA0002776605950000182
wherein M isminAnd MmaxRepresenting the minimum and maximum values of the motor torque. J. the design is a squarei(kj) Is the ith vehicle at control gain kj(j-1, 2,3,4) under control. In addition, since the controller is designed based on the distance error and the speed error between the vehicle and the adjacent front vehicle and the pilot vehicle in the queue, the control gain must be set to satisfy kj>0 (j-1, 2,3,4), and to ensure that the control input does not exceed the vehicle acceleration limit, the control gain should also be less than 20.

Claims (7)

1. An intelligent networking electric automobile queue control method giving consideration to both stability and energy conservation is characterized in that: the method comprises the following steps:
step 1: constructing a vehicle motor model and a vehicle distance strategy of an electric vehicle queue;
step 2: constructing a single vehicle dynamics model and a vehicle queue model to complete the establishment of a vehicle energy consumption objective function;
and step 3: constructing a linear state feedback controller for the vehicles by using a feedback control strategy, and simultaneously analyzing the control gain range of each vehicle according to the queue stability;
and 4, step 4: optimizing control gain by applying a selected genetic algorithm, taking a target function as a fitness function, solving to obtain optimal control gain, and realizing the goals of queue stability and energy conservation;
in step 1, the vehicle motor model is as follows:
Figure FDA0003288595100000011
wherein, PmIs the motor power, wmIs the motor speed, TmIn order to be the torque of the motor,
Figure FDA0003288595100000014
in order to achieve the driving efficiency of the motor,
Figure FDA0003288595100000015
generating efficiency for the motor;
in step 1, the inter-vehicle distance strategy is: during the vehicle queue running, the queue control aims at keeping the distance between adjacent vehicles at a desired inter-vehicle distance and keeping the speed of the following vehicle consistent with that of the pilot vehicle, namely
Figure FDA0003288595100000012
Wherein v isi(t)The speed of the ith following vehicle at time t; v. of0(t)The speed of the piloted vehicle at time t; p is a radical ofi-1(t)The motor power of the i-1 th following vehicle at the time t; p is a radical ofi(t)The motor power of the ith following vehicle at the time t; n is the number of following vehicles; di-1,iRepresenting the desired inter-vehicle distance between node i-1 and node i, di-1,i>0;
The definition of the expected vehicle distance satisfies the following operational expression:
Figure FDA0003288595100000013
the geometry of the train being determined by the desired vehicle spacing di-1,iThe specific selection decision of (2);
for constant distance type of vehicle spacing, di-1,iIs a fixed constant, i.e.
di-1,i=d0,i∈n
Wherein d is0Is a constant greater than zero;
for constant-headway type vehicle spacing, di-1,iIs a linear function related to the vehicle speed, i.e.
di-1,i=thvi+d0,i∈n
Wherein, thWhen the car is followingDistance; v. ofiThe speed of the ith vehicle is the speed of the ith vehicle;
for non-linear distance type inter-vehicle distance, di-1,iIs a non-linear function related to the vehicle speed, i.e.
di-1,i=g(vi),i∈n
The goals of vehicle fleet control are:
dmin≤di-1,i≤dmax
wherein d isminRepresenting the minimum allowable inter-vehicle distance, dmaxRepresenting the maximum allowable car-to-car distance.
2. The intelligent networked electric automobile queue control method with both stability and energy conservation as claimed in claim 1, wherein: in the step 1, a vehicle motor model and an inter-vehicle distance strategy of an electric vehicle queue are constructed according to a selected workshop information flow topological structure, wherein the selected workshop information flow topological structure is in a front vehicle-navigator following mode, namely a set of one navigator and n following vehicles is defined as the queue, and each vehicle i can receive information of the navigator and adjacent vehicles.
3. The intelligent networked electric automobile queue control method with both stability and energy conservation as claimed in claim 2, characterized in that: the plant information flow topology is described by a directed graph g, wherein the directed graph g represents the information flow topology between the following vehicles in the queuen+1Representing the information flow between the following vehicle and the pilot vehicle:
directed graph gn={vnn,AnV, in which the vertex sets vn1,2, …, n, and an edge set epsilonn=vn×vnAdjacent matrix An=[aij]∈Rn×nWherein a isijIs a non-negative contiguous element;
directed graph gn+1={vn+1,εn+1,An+1V, node collection vn+1={v0,v1,…,vn}, edge union εn+1=vn+1×vn+1Adjacent matrix An=[aij]∈R(n+1)×(n+1)
The topology of the information flow in the queue is represented by gnAnd gn+1Characterized as the following three matrices:
(1) adjacency matrix An
(2) Laplace matrix
Figure FDA0003288595100000031
(3) Traction matrix
Figure FDA0003288595100000032
Wherein A isn=[aij]∈Rn×nIs defined as follows
Figure FDA0003288595100000033
Wherein, aij1, namely representing that the ith vehicle can receive the state information from the jth vehicle; suppose this gnIn which no self-loop is present, i.e. all of aij0, i belongs to n; the information set of all vehicle state information that the vehicle i can receive is defined as:
Ni={j|aij=1}
the set represents a collection of all vehicles that can acquire information, in the following vehicles, by vehicle i through V2X communication or radar detection; the degree of entry of vehicle i is defined as
Figure FDA0003288595100000034
At the same time, the in-degree matrix is defined as
Figure FDA0003288595100000035
Corresponds to gnLaplacian matrix of
Figure FDA0003288595100000036
Is defined as
L=Dn-An
And corresponds to gn+1Traction matrix P ∈ Rn×nFor describing the case where the following vehicle acquires the relevant pilot vehicle state information, the following is defined as follows:
Figure FDA0003288595100000037
wherein if {0, i }. epsilon. [ epsilon ], [ epsilon ]n+1Then p isi0, otherwise piWhen the ith vehicle can acquire the relevant state information of the pilot vehicle, the value p is represented as 0i1 is ═ 1; at the moment, the ith vehicle is directly pulled by the pilot vehicle;
under the workshop information flow topological structure of the front vehicle-navigator following mode, the information set of the vehicle i is
Figure FDA0003288595100000038
The adjacency matrix and the Laplace matrix of the workshop information flow topological structure are as follows:
Figure FDA0003288595100000041
Figure FDA0003288595100000042
the piloted vehicle reachable set for vehicle i is:
(Pi)PLF={0}
therefore, the traction matrix of the plant information flow topology is represented as follows:
Figure FDA0003288595100000043
4. the intelligent networked electric automobile queue control method with both stability and energy conservation as claimed in claim 1, wherein: and 2, constructing a single vehicle dynamics model and a vehicle queue model to complete the establishment of a vehicle energy consumption objective function:
dynamic model of single vehicle
The vehicle queue consists of n +1 vehicle groups, wherein the pilot vehicle is manually controlled and is numbered as 0, and the number of the whole vehicle queue is from 0 to n;
the longitudinal dynamics model of the ith vehicle is:
Figure FDA0003288595100000044
wherein, ViIs the speed of the ith vehicle in the queue; δ is a mass transfer factor; u. ofiIs an input to a vehicle system; g is the acceleration of gravity; f is the rolling resistance coefficient; thetaiIs a road slope angle; ρ is the air density; a. theiIs the cross-sectional area of the vehicle; cd,iIs the air resistance coefficient; m isiIs the mass of the ith vehicle;
vehicle queue model
The intelligent vehicle fleet is represented as:
Pp=[P0,P1,…Pn]T,Vp=[V0,V1,…Vn]T,Fp=[F0,F1,…Fn]T,Ff,p=[Ff,0,Ff,1,…Ff,n]T,Fg,p=[Fg,0,Fg,1,…Fg,n]T,FA,p=[FA,0,FA,1,…FA,n]T
the dynamics of the cohort are as follows:
Figure FDA0003288595100000051
wherein, Pp、Vp、Fp、Ff,p、Fg,pAnd FA,pIs a collection of position, speed, resultant longitudinal tire force, rolling resistance, ramp inclination resistance, and air resistance of each vehicle; m ispThe mass of the vehicle, being a homogenous vehicle train, has mp=miThe mass of each vehicle is the same;
the mathematical structure of the queue is described as follows:
Figure FDA0003288595100000052
Figure FDA0003288595100000053
wherein D isdIs the desired vehicle spacing; l isiIs the length of the vehicle;
Figure FDA0003288595100000054
is the error between the desired pitch and the actual pitch;
Figure FDA0003288595100000055
is a pair of
Figure FDA0003288595100000056
Derivation is carried out; piThe position of the ith vehicle in the queue;
vehicle energy consumption model
The ith vehicle in the queue from the initial time t0The energy consumption of the destination reached for time t is:
Figure FDA0003288595100000057
wherein f isiFor the energy consumption of the ith vehicle:
Figure FDA0003288595100000058
wherein the content of the first and second substances,
Figure FDA0003288595100000059
is the efficiency of the motor; pm,iThe motor power required by the ith vehicle;
motor power P required by ith vehiclem,iComprises the following steps:
Figure FDA00032885951000000510
wherein, Pf,iIs the power consumed by the vehicle to overcome the grade resistance, Pf,i=migfcos(θi)Vi;Pg,iIs the power consumed by the vehicle to overcome the grade resistance, Pg,i=migfcos(θi)Vi;PA,iIs the power consumed by the vehicle to overcome the air resistance;
Figure FDA0003288595100000061
Pa,iis the power required for the acceleration of the vehicle,
Figure FDA0003288595100000062
ηiis the mechanical transmission efficiency.
5. The intelligent networked electric automobile queue control method considering stability and energy conservation as claimed in claim 4, wherein: in step 3, the transfer function of the linear state feedback controller is:
Figure FDA0003288595100000063
controlling gain k1,k2,k3,k4The ranges of (A) are as follows:
Figure FDA0003288595100000064
6. the intelligent networked electric automobile queue control method with both stability and energy conservation as claimed in claim 5, wherein: step 4, in the control gain range obtained in the step 3, optimizing the control gain by using a genetic algorithm, and solving the optimal control gain, wherein the steps are as follows:
the optimization objective is to minimize the vehicle energy consumption J, which is expressed as follows:
Figure FDA0003288595100000065
to control the gain kjIs an independent variable, j is 1,2,3, 4; taking the energy consumption J of the vehicle queue as a fitness function:
min.
Figure FDA0003288595100000066
s.t.
Figure FDA0003288595100000067
Mmin≤Mi≤Mmax,
k3 2+2k1k3≥0,
k4 2+2k1k4-2k1-2k3≥0,
k1>0,k2>0,k3>0,k4>0,
k1<20,k2<20,k3<20,k4<20
wherein M isminAnd MmaxRepresents a minimum value and a maximum value of the motor torque; j. the design is a squarei(kj) Is the ith vehicle at control gain kjEnergy consumption under control.
7. The intelligent networked electric automobile queue control method considering stability and energy conservation as claimed in claim 6, wherein: the basic operation process of the genetic algorithm is as follows:
a) initializing, namely setting an evolution algebra counter t to be 0, setting a maximum evolution algebra G, and randomly generating N individuals as an initial population P (0);
b) evaluating individuals, namely calculating the fitness of each individual in the population P (t);
c) selecting operation, namely acting the selecting operator on the group;
d) performing cross operation, namely acting a cross operator on the group;
e) mutation operation, namely acting mutation operators on the population; the group P (t) is subjected to selection, intersection and mutation operation to obtain a next generation group P (t + 1);
f) and (5) judging a termination condition, namely if t is G, outputting the individual with the maximum fitness obtained in the evolution process as an optimal solution, and terminating the calculation.
CN202011267689.6A 2020-11-13 2020-11-13 Intelligent networking electric automobile queue control method giving consideration to stability and energy conservation Active CN112477846B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011267689.6A CN112477846B (en) 2020-11-13 2020-11-13 Intelligent networking electric automobile queue control method giving consideration to stability and energy conservation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011267689.6A CN112477846B (en) 2020-11-13 2020-11-13 Intelligent networking electric automobile queue control method giving consideration to stability and energy conservation

Publications (2)

Publication Number Publication Date
CN112477846A CN112477846A (en) 2021-03-12
CN112477846B true CN112477846B (en) 2021-12-10

Family

ID=74930177

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011267689.6A Active CN112477846B (en) 2020-11-13 2020-11-13 Intelligent networking electric automobile queue control method giving consideration to stability and energy conservation

Country Status (1)

Country Link
CN (1) CN112477846B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113341722B (en) * 2021-06-17 2022-07-01 西北工业大学 Vehicle queue collaborative optimal control method under communication topology unconstrained condition
CN114842638B (en) * 2022-05-12 2023-04-04 北京主线科技有限公司 Method for remedying vehicle instability state, rescue method, device, equipment and medium
CN115547025B (en) * 2022-08-29 2023-05-05 东南大学 Heterogeneous vehicle queue stability control method for locomotive-following communication link
CN116469245A (en) * 2023-04-04 2023-07-21 北京工业大学 Network-connected hybrid driving formation integrated test system and method for multiple traffic simulation fusion

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101489298A (en) * 2009-01-08 2009-07-22 东南大学 Discrete speed cross-layer power distribution method based on mobile multicast system
CN102043846A (en) * 2010-12-16 2011-05-04 上海电机学院 Search method and device based on genetic algorithm
CN105205536A (en) * 2015-11-06 2015-12-30 天津津航计算技术研究所 1553B bus message transmission optimization method based on hybrid genetic algorithm
CN107016462A (en) * 2017-04-05 2017-08-04 张玉州 A kind of multirunway field flight landing cooperative optimization method based on genetic algorithm

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101489298A (en) * 2009-01-08 2009-07-22 东南大学 Discrete speed cross-layer power distribution method based on mobile multicast system
CN102043846A (en) * 2010-12-16 2011-05-04 上海电机学院 Search method and device based on genetic algorithm
CN105205536A (en) * 2015-11-06 2015-12-30 天津津航计算技术研究所 1553B bus message transmission optimization method based on hybrid genetic algorithm
CN107016462A (en) * 2017-04-05 2017-08-04 张玉州 A kind of multirunway field flight landing cooperative optimization method based on genetic algorithm

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
基于RNPI的动态时滞网络主动队列管理算法;钱艳平;《系统工程与电子技术》;20180531;全文 *
智能网联混合动力汽车队列分层优化控制方法研究;邱利宏;《中国博士学位论文全文数据库(电子期刊)》;20190228;第47-51,9-79,129-134页 *

Also Published As

Publication number Publication date
CN112477846A (en) 2021-03-12

Similar Documents

Publication Publication Date Title
CN112477846B (en) Intelligent networking electric automobile queue control method giving consideration to stability and energy conservation
He et al. An improved MPC-based energy management strategy for hybrid vehicles using V2V and V2I communications
Sciarretta et al. Energy-efficient driving of road vehicles
CN111439260B (en) Network-connected commercial diesel vehicle cruise running optimization control system oriented to individual requirements
CN103914985B (en) A kind of hybrid power passenger car following speed of a motor vehicle trajectory predictions method
CN108973998B (en) Heterogeneous vehicle queue distributed energy-saving control method based on MPC
CN107284441A (en) The energy-optimised management method of the adaptive plug-in hybrid-power automobile of real-time working condition
EP4273011A1 (en) New energy vehicle coasting control system and method based on intelligent networking information, and new energy vehicle
CN111332290B (en) Vehicle formation method and system based on feedforward-feedback control
CN113269963B (en) Internet vehicle signal lamp control intersection economic passing method based on reinforcement learning
Sakhdari et al. Ecological adaptive cruise control of a plug-in hybrid electric vehicle for urban driving
CN111532264A (en) Intelligent internet automobile cruising speed optimization method for variable-gradient and variable-speed-limit traffic scene
CN104656452B (en) A kind of subway train optimal control method discrete based on matrix and device
Vajedi et al. Intelligent power management of plug–in hybrid electric vehicles, part I: Real–time optimum SOC trajectory builder
CN112099349B (en) Optimal cooperative control method for vehicle queue
CN112907937B (en) Hybrid vehicle queue control method and system considering rear vehicle information
Liu et al. Economic adaptive cruise control for a power split hybrid electric vehicle
Yi et al. Energy aware driving: Optimal electric vehicle speed profiles for sustainability in transportation
Zhang et al. Optimal eco-driving control of autonomous and electric trucks in adaptation to highway topography: Energy minimization and battery life extension
CN116187161A (en) Intelligent energy management method and system for hybrid electric bus in intelligent networking environment
CN112255918A (en) Method and system for optimizing control of automobile queue
CN114783175B (en) Multi-signal lamp road condition internet-connected vehicle energy-saving driving control method based on pseudo-spectrum method
Vajedi Real-time optimal control of a plug-in hybrid electric vehicle using trip information
Zhu et al. Real-time co-optimization of vehicle route and speed using generic algorithm for improved fuel economy
CN114537420B (en) Urban bus rapid transit energy-saving driving control method based on dynamic planning

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