Vehicle sliding method and device based on cloud high-precision map and vehicle
Through cloud-based high-precision maps and dynamic planning technology, the economic speed gear sequence of commercial vehicles is planned, solving the problem of underutilization of slope impact and achieving more efficient fuel economy and real-time gliding control.
Patent Information
- Application Number
- CN202410984634.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-22
- Publication Date
- 2024-11-08
AI Technical Summary
The existing commercial vehicle scooter planning methods fail to fully consider the impact of road slope on vehicle driving economy, resulting in low fuel economy, large computing resources, and poor real-time performance.
Using a vehicle sliding method based on cloud-based high-precision map, by obtaining vehicle driving status and slope information, combining vehicle model parameters, using forward/reverse dynamic planning to build optimization problems, planning economic vehicle speed gear sequences, and realizing that the vehicle is in the appropriate position Skip in neutral and drive in gear at the right speed.
It improves the fuel economy and driving efficiency of the vehicle, reduces the calculation amount of speed solving during economic scoring, reduces the consumption of storage resources, and improves the real-time algorithm and the traffic efficiency of the vehicle.
Smart Images

Figure CN118907097A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of vehicle technology, and in particular to a vehicle gliding method, device and vehicle based on a cloud-based high-precision map. Background Art
[0002] In the related art, there are mainly two methods for planning the neutral coasting of commercial vehicles: a rule-based commercial vehicle coasting control method and a commercial vehicle coasting control method based on optimization theory.
[0003] The rule-based economical gliding method usually makes gliding decisions based on the slope information of the current road on which the vehicle is located and the vehicle's operating status, or adopts neutral gear driving on a relatively gentle downhill slope based on the average slope of a section of road ahead. Although this method is easy to understand and occupies less computing resources on the vehicle side, the rule-based gliding method does not consider the impact of the vehicle's driving speed when it is in gear on the vehicle's gliding decision, and does not plan the vehicle's driving speed in gear in advance to make the vehicle drive in neutral gear at an appropriate position. At the same time, the rules do not take into account the road slope conditions comprehensively, and can only design the threshold conditions for starting gliding based on experience, which cannot fully tap the potential of economical gliding. Therefore, fuel economy is bound to suffer a certain loss.
[0004] The commercial vehicle coasting planning method based on optimization theory determines the optimal speed curve based on the engine's MAP diagram, then accelerates the vehicle along the optimal speed curve to the maximum speed, and then puts the vehicle in neutral for coasting. This method fails to fully consider the impact of road slope on vehicle driving economy when solving the calculation, and the acceleration speed curve is too fixed, resulting in poor fuel saving effect on highways with actual slope fluctuations. The commercial vehicle economic coasting based on global dynamic planning will cause the algorithm to occupy too much storage space and the algorithm is not real-time. Summary of the invention
[0005] The present application provides a vehicle coasting method, device and vehicle based on a cloud-based high-precision map, so as to solve the problems that the economical coasting method in the related art does not fully consider the influence of the road slope on the vehicle's driving economy and the influence of the vehicle's driving speed when in gear on the vehicle's coasting decision, resulting in low vehicle fuel economy.
[0006] The first aspect of the present application provides a vehicle coasting method based on a cloud-based high-precision map, comprising the following steps: obtaining driving status information and position information of a target vehicle; determining the slope information in the driving direction of the target vehicle based on the position information and the high-precision map; obtaining a vehicle model of the target vehicle, and setting vehicle model parameters of the target vehicle; planning an economic speed gear sequence of the target vehicle based on the driving status information, the slope information, and the vehicle model parameters, determining a target speed and a target gear of the target vehicle based on the economic speed gear sequence, and controlling the coasting of the target vehicle based on the target speed and the target gear.
[0007] Optionally, planning the economical speed gear sequence of the target vehicle according to the driving state information, the slope information and the vehicle model parameters includes: searching for a feasible domain for starting or stopping coasting according to at least one of the driving state information, the slope information and the vehicle model parameters; performing forward dynamic planning or reverse dynamic planning on at least one coasting scheme in the feasible domain; and determining the economical speed gear sequence of the target vehicle according to the planning results of each coasting scheme.
[0008] Optionally, the search of the feasible domain includes at least one of the following situations: the vehicle starts to glide at an initial speed at an initial waypoint; the vehicle glides to a terminal point and the final speed is a set cruising speed; the vehicle starts to glide at an intermediate waypoint, and the starting speed of the glide is selected based on the discrete state space of dynamic programming.
[0009] Optionally, the forward dynamic programming and reverse dynamic programming of at least one gliding scheme in the feasible domain include: establishing an objective function of fuel saving and driving efficiency; determining a target road segment number relationship among multiple planned roads in the driving direction of the target vehicle; and solving the objective function by forward dynamic programming or reverse dynamic programming using the target road segment number relationship as a constraint of the objective function.
[0010] Optionally, the forward dynamic programming is the same as the reverse dynamic programming, wherein the forward dynamic programming includes: planning the number of discrete speeds for each stage according to discrete preset speed intervals; obtaining the cost of the initial waypoint and the cost of the terminal waypoint, and calculating the minimum cost of reaching the waypoint state of the current stage from the initial waypoint in each stage according to the discrete speed number; calculating the minimum transfer cost between two waypoint states, and generating a cost matrix according to the cost of the initial waypoint, the cost of the terminal waypoint, the minimum cost of reaching the waypoint state of the current stage from the initial waypoint, and the minimum transfer cost; and solving the objective function according to the cost matrix.
[0011] Optionally, the objective function includes:
[0012]
[0013] Among them, w1 is the weight of fuel economy, w2 is the weight of driving efficiency, Δt i is the travel time of the vehicle between two waypoints, b e (T e,i , n e,i ) is the instantaneous fuel consumption of the vehicle during driving, n e,i is the engine speed at the i-th road point, T e,i is the engine output torque at the i-th road point, is the instantaneous fuel consumption of the engine at idle speed, Δs i is the length of the i-th road section, v i is the vehicle speed at the i-th waypoint, v i-1 is the vehicle speed at the i-1th waypoint;
[0014] The constraints are:
[0015] V min ≤v i ≤v max , i∈{1, 2, 3...N},
[0016] Among them, v i is the vehicle speed at the i-th road point, V min is the minimum speed of the vehicle, V max is the maximum speed of the vehicle;
[0017] a min ≤a i ≤a max , i∈{1, 2, 3...N},
[0018] Among them, a i is the vehicle acceleration at the ith road point, a min is the minimum acceleration of the vehicle, a max is the maximum acceleration of the vehicle;
[0019] T e,min ≤T e,i ≤T e,max , i∈{1, 2, 3...N},
[0020] Among them, T e,i is the engine output torque at the i-th road point, T e,min is the minimum output torque of the engine, T e,max is the maximum output torque of the engine;
[0021] z i ={0, 1}, i∈{1, 2, 3...N}
[0022] Among them, z i is the vehicle gear position signal at the i-th road point. When the vehicle transmission gear is in the highest gear, z i =0, when the vehicle transmission gear is in neutral i =1;
[0023]
[0024] in,
[0025]
[0026] Among them, z i is the vehicle gear position signal at the i-th road point, z i+ 1 is the vehicle gear position signal at the i+1th waypoint;
[0027] The target road segment number relationship includes:
[0028]
[0029] Among them, n i is the number of small road sections contained in the re-divided large road section, and N is the planned road.
[0030] Optionally, the at least one taxiing scheme includes first to fourth taxiing schemes, wherein:
[0031] The first taxiing plan includes:
[0032] Determine the end position and end state of coasting according to at least one planning scheme of forward dynamic programming; calculate the cost of any two waypoints before the end position according to the end position and the end state, and calculate the cost value of the speed gear sequence from the start position to the end position of coasting according to the cost of the any two waypoints; select the speed gear sequence with the smallest cost value as the economic speed gear sequence of the target vehicle;
[0033] The second taxiing option includes:
[0034] Determine the sliding starting point position and the starting state according to at least one planning scheme of reverse dynamic programming;
[0035] Calculating the cost of the speed gear sequence from the starting position to the end position of the coasting according to the cost of the arbitrary two waypoints, and selecting the speed gear sequence with the smallest cost as the economical speed gear sequence of the target vehicle;
[0036] The third taxiing option includes:
[0037] Determine the terminal position and terminal state of coasting according to at least one planning scheme of forward dynamic programming, and calculate the cost value of the first stage vehicle speed gear sequence from the starting position to the terminal position of coasting according to the cost of any two waypoints of the forward dynamic programming; determine the starting position and starting state of coasting according to at least one planning scheme of reverse dynamic programming, and calculate the cost value of the third stage vehicle speed gear sequence from the starting position to the terminal position of coasting according to the cost of any two waypoints of the reverse dynamic programming; calculate the cost value of the vehicle speed gear sequence of the second stage according to the uniform acceleration state of the vehicle; calculate the cost value of the vehicle speed gear sequence from the first stage to the third stage, and select the vehicle speed gear sequence with the smallest cost value as the economical vehicle speed gear sequence of the target vehicle;
[0038] The fourth taxiing plan includes:
[0039] The terminal position and terminal state of the coasting are determined according to at least one planning scheme of forward dynamic programming; the starting position and initial state of the coasting are determined according to at least one planning scheme of reverse dynamic programming, and the cost of the speed gear sequence of the third stage from the starting position to the terminal position of the coasting is calculated according to the cost of any two waypoints, and the speed gear sequence with the smallest cost value is selected as the economical speed gear sequence of the target vehicle.
[0040] Optionally, the vehicle model includes at least one of a vehicle longitudinal dynamics model, an energy conservation model for the vehicle in neutral coasting, and a vehicle engine fuel consumption model, and the vehicle model parameters include model parameters for the vehicle in non-neutral driving and model parameters for the vehicle in neutral coasting.
[0041] The second aspect of the present application provides a vehicle sliding device based on a cloud-based high-precision map, including: an acquisition module for acquiring driving status information and position information of a target vehicle; a determination module for determining the slope information in the driving direction of the target vehicle based on the position information and the high-precision map; a setting module for acquiring a vehicle model of the target vehicle and setting vehicle model parameters of the target vehicle; a planning module for planning an economic speed gear sequence of the target vehicle based on the driving status information, the slope information and the vehicle model parameters, determining a target speed and a target gear of the target vehicle based on the economic speed gear sequence, and controlling the sliding of the target vehicle based on the target speed and the target gear.
[0042] The third aspect of the present application provides a vehicle, comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the vehicle gliding method based on a cloud-based high-precision map as described in any one of claims 1 to 5.
[0043] Therefore, this application has at least the following beneficial effects:
[0044] (1) The embodiment of the present application is based on a commercial vehicle economical gliding method using a cloud-based high-precision map. According to the vehicle's driving state and the slope of the road ahead, the vehicle speed and gear are selected as control variables, corresponding constraints are established, and an optimization problem is constructed. The optimal control problem is solved through rolling iterative dynamic programming to obtain a speed and gear sequence that takes into account both economy and driving efficiency.
[0045] (2) The embodiment of the present application utilizes a forward / reverse dynamic programming method with no aftereffects to solve economical coasting planning. First, the cost matrices of each full-time in-gear driving are calculated and saved through forward dynamic programming and reverse dynamic programming. Then, through a feasible domain search, all possible situations that satisfy the constraints are searched in advance. The dynamic programming has no aftereffects to solve the economical vehicle speed sequence and cost in the in-gear portion, thereby reducing the amount of calculation required to solve the vehicle speed in the in-gear portion during economical coasting.
[0046] Additional aspects and advantages of the present application will be given in part in the description below, and in part will become apparent from the description below, or will be learned through the practice of the present application. BRIEF DESCRIPTION OF THE DRAWINGS
[0047] The above and / or additional aspects and advantages of the present application will become apparent and easily understood from the following description of the embodiments in conjunction with the accompanying drawings, in which:
[0048] Figure 1 A flowchart of a vehicle gliding method based on a cloud-based high-precision map provided according to an embodiment of the present application;
[0049] Figure 2 An economical taxiing system architecture for commercial vehicles based on a cloud control system provided according to an embodiment of the present application;
[0050] Figure 3 The specific technical framework and technical principles provided according to the embodiments of the present application;
[0051] Figure 4 A schematic diagram of longitudinal force of a vehicle provided according to an embodiment of the present application;
[0052] Figure 5 A schematic diagram of energy conservation during neutral coasting of a vehicle provided according to an embodiment of the present application;
[0053] Figure 6 A schematic diagram of forward dynamic programming provided according to an embodiment of the present application;
[0054] Figure 7 A cost calculation method for the EN solution provided according to an embodiment of the present application;
[0055] Figure 8 A method for calculating the cost of a NE solution provided according to an embodiment of the present application;
[0056] Fig. 9 A cost calculation method for the ENE solution provided according to an embodiment of the present application;
[0057] Fig.10 A method for calculating the cost of the NEN solution provided in an embodiment of the present application;
[0058] Fig.11 This is an example diagram of a vehicle sliding device based on a cloud-based high-precision map provided according to an embodiment of the present application;
[0059] Fig.12 It is a schematic diagram of the structure of a vehicle provided according to an embodiment of the present application. DETAILED DESCRIPTION
[0060] The embodiments of the present application are described in detail below, and examples of the embodiments are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements having the same or similar functions. The embodiments described below with reference to the accompanying drawings are exemplary and are intended to be used to explain the present application, and should not be construed as limiting the present application.
[0061] Intelligent assisted driving technology for commercial vehicles is crucial to improving the traffic efficiency and fuel economy of commercial vehicles. Predictive cruise control, as an intelligent assisted driving technology, can plan the vehicle's driving speed in advance through the road information (such as slope) ahead, so that the vehicle can drive according to the rule of "appropriate deceleration on uphill and acceleration on downhill", improving the vehicle's fuel economy. However, in the predictive cruise control of commercial vehicles, there is still a phenomenon of engine drag on the downhill, which will cause the vehicle's kinetic energy to be converted into heat energy of the transmission system and dissipated, resulting in a certain loss of vehicle economy. Since commercial vehicles are generally equipped with automatic mechanical transmissions (AMT), the vehicle can be placed in neutral on suitable roads to eliminate the engine drag, further improving the conversion efficiency between the vehicle's gravitational potential energy and kinetic energy.
[0062] There are two main ways to achieve neutral coasting of commercial vehicles in the prior art: a rule-based coasting control method and a coasting control method based on optimization theory.
[0063] The rule-based coasting control method usually formulates the rules for vehicle coasting in advance. When the vehicle driving conditions (such as vehicle speed, engine output torque, etc.) and the slope of the road the vehicle is currently driving on meet the conditions of the rules, the vehicle starts to coast. When the conditions are no longer met, the vehicle resumes driving in the gear. Some rule-based coasting control methods can also make simple rule constraints based on the slope of the road ahead, so that the vehicle can coast in neutral gear on a relatively gentle downhill section.
[0064] The rule-based economical gliding method usually makes gliding decisions based on the slope information of the current road on which the vehicle is located and the vehicle's operating status, or adopts neutral gear driving on a relatively gentle downhill slope based on the average slope of a section of road ahead. Although this method is easy to understand and occupies less computing resources on the vehicle side, the rule-based gliding method does not consider the impact of the vehicle's driving speed when it is in gear on the vehicle's gliding decision, and does not plan the vehicle's driving speed in gear in advance to make the vehicle drive in neutral gear at an appropriate position. At the same time, the rules do not take into account the road slope conditions comprehensively, and can only design the threshold conditions for starting gliding based on experience, which cannot fully tap the potential of economical gliding. Therefore, fuel economy is bound to suffer a certain loss.
[0065] Some coasting control methods based on optimization theory determine the optimal economic speed curve through the vehicle engine MAP diagram, and make the vehicle accelerate from the lowest speed along the optimal economic speed curve to the highest speed each time, then put the vehicle into neutral gear for coasting, so that the vehicle starts to coast until the vehicle speed drops to the lowest speed and then resumes driving in gear and accelerates again along the optimal speed curve, and repeats the cycle. Some coasting control methods based on optimization theory also plan the vehicle speed and gear sequence in the future long-distance domain through global dynamic planning, and make the vehicle execute according to the planned speed and gear sequence during driving.
[0066] The commercial vehicle coasting planning method based on optimization theory determines the optimal speed curve based on the engine's MAP diagram, then accelerates the vehicle along the optimal speed curve to the maximum speed, and then puts the vehicle in neutral for coasting. This method fails to fully consider the impact of road slope on vehicle driving economy when solving the calculation, and the acceleration speed curve is too fixed, resulting in poor fuel saving effect on highways with actual slope fluctuations. The commercial vehicle economic coasting based on global dynamic planning will cause the algorithm to occupy too much storage space and the algorithm is not real-time.
[0067] In order to address the deficiencies in the prior art, the purpose of this application is to propose a new commercial vehicle economical gliding system architecture based on cloud-based high-precision maps, and to propose a new commercial vehicle economical gliding planning algorithm based on forward / reverse dynamic programming. Through the high-precision map in the cloud control platform, the slope information of a section of the road ahead of the vehicle is obtained in real time, and the vehicle speed and gear sequence are reasonably planned in the cloud according to the slope information of the road ahead, so that the vehicle starts to glide in neutral at a suitable position and at a suitable speed, and stops glide at a suitable position, thereby realizing the economical gliding of the vehicle and further improving the fuel economy of the vehicle.
[0068] The following describes the vehicle taxiing method, device and vehicle based on cloud-based high-precision maps in the embodiments of the present application with reference to the accompanying drawings. Specifically, Figure 1 A flowchart of a vehicle coasting method based on a cloud-based high-precision map provided in an embodiment of the present application.
[0069] like Figure 1 As shown, the vehicle gliding method based on cloud high-precision map includes the following steps:
[0070] In step S101, the driving state information and position information of the target vehicle are obtained.
[0071] The driving status information includes the speed and gear position of the target vehicle, and the location information includes the longitude and latitude of the target vehicle.
[0072] It can be understood that the embodiments of the present application can obtain the driving status information and position information of the target vehicle, so as to subsequently determine the slope information in the driving direction of the target vehicle based on the position information and the high-precision map.
[0073] It should be noted that the vehicle-side communication unit obtains the vehicle driving status information, such as vehicle speed and gear, through the CAN bus, and obtains the current vehicle position status information, such as the longitude and latitude of the vehicle's location, through the GPS module in the communication unit, and then packages the vehicle status information and uploads it to the cloud at a fixed frequency.
[0074] In step S102, the slope information of the target vehicle in the driving direction is determined based on the position information and the high-precision map.
[0075] It can be understood that the embodiments of the present application can determine the slope information in the driving direction of the target vehicle based on the position information and the high-precision map, so as to subsequently plan the economic speed gear sequence of the target vehicle based on the driving status information, slope information and vehicle model parameters.
[0076] It should be noted that the cloud calls the cloud high-precision map application to obtain the slope information of the road ahead of the vehicle based on the acquired vehicle location information.
[0077] In step S103, a vehicle model of the target vehicle is acquired, and vehicle model parameters of the target vehicle are set.
[0078] Among them, the vehicle model includes at least one of a vehicle longitudinal dynamics model, an energy conservation model when the vehicle is coasting in neutral gear, and a vehicle engine fuel consumption model, and the vehicle model parameters include model parameters when the vehicle is in non-neutral driving and model parameters when the vehicle is coasting in neutral gear.
[0079] It can be understood that the embodiments of the present application can obtain the vehicle model of the target vehicle and set the vehicle model parameters of the target vehicle, so as to plan the economic speed gear sequence of the target vehicle according to the driving status information, slope information and vehicle model parameters.
[0080] It should be noted that the vehicle model includes a vehicle longitudinal dynamics model when the vehicle is driving in gear, an energy conservation model when the vehicle is coasting in neutral gear, and a vehicle engine fuel consumption model.
[0081] Among them, the above vehicle models are all used to calculate the vehicle's driving speed. When the vehicle is in gear, the vehicle's longitudinal speed can be controlled by the accelerator pedal; when the vehicle is in neutral and gliding, the vehicle's longitudinal speed cannot be controlled at this time, so the speed of the vehicle at a certain position can only be calculated by the energy conservation formula.
[0082] Specifically, (1) Figure 4 As shown in Figure 2, the longitudinal force balance equation of the vehicle is:
[0083]
[0084] Among them, F t For the driving force of the car, T e is the engine output torque, i g is the current gear ratio of the gearbox, i o is the main reducer transmission ratio, η is the mechanical efficiency of the transmission system, r w is the wheel radius; F w is the air resistance, C D is the vehicle drag coefficient, A is the vehicle frontal area, ρ is the air density, and v is the vehicle speed; F i is the slope resistance, F i = mgsin(θ), m is the mass of the vehicle, g is the acceleration of gravity, and θ is the road slope; F f is the rolling resistance, F f =mgfcos(θ), where f is the rolling resistance coefficient.
[0085] (2) Figure 5As shown in the figure, when the vehicle is in a gliding state, the gearbox is in neutral, the power between the engine and the wheels is cut off, and in order to reduce fuel consumption, the driver will not step on the accelerator pedal, the engine speed gradually decreases to the idle state, and the driver tries to avoid stepping on the brake pedal while ensuring safety. At this time, the longitudinal movement of the vehicle is not affected by the driver, and the vehicle slides freely on the road under the combined effect of gravity and external resistance. However, the vehicle still follows the law of conservation of energy, so the speed of the vehicle at any position during gliding can still be obtained by calculation.
[0086]
[0087] Among them, v1 and v2 are the speeds of the vehicle when it starts and stops sliding respectively; h1 and h2 are the altitudes of the road when the vehicle starts and stops sliding respectively; s1 and s2 are the positions of the vehicle when it starts and stops sliding respectively.
[0088] Since the algorithm in actual situations is based on sampling for discrete calculation, in order to be applicable to actual working conditions, the formula (2) is discretized by the Euler method. When the vehicle's starting sliding speed v1 is known, the ending sliding speed v2 is obtained:
[0089]
[0090] Where Δs=s2-s1.
[0091]
[0092] When the vehicle's end-slip speed v2 is known, the starting-slip speed v1 is
[0093]
[0094] (3) The vehicle engine fuel consumption model is used to fit and calculate the instantaneous fuel consumption of the vehicle during driving. A fuel consumption polynomial model of the engine instantaneous fuel consumption with respect to the engine output torque and engine speed is constructed, and its expression is as follows.
[0095]
[0096] where ξ i,j are the coefficients of the polynomial, n e is the engine speed, and its relationship with the vehicle speed is shown in formula (2-7)
[0097]
[0098] In step S104, an economical speed gear sequence of the target vehicle is planned according to the driving state information, slope information and vehicle model parameters, a target speed and a target gear of the target vehicle are determined according to the economical speed gear sequence, and the target vehicle is controlled to coast based on the target speed and the target gear.
[0099] It can be understood that the embodiments of the present application can plan the economic speed gear sequence of the target vehicle according to the driving status information, slope information and vehicle model parameters, determine the target speed and target gear of the target vehicle according to the economic speed gear sequence, and control the gliding of the target vehicle based on the target speed and target gear, fully considering the influence of the slope information on the economic speed, and the global dynamic planning has good real-time performance and small storage resource occupancy, thereby improving the fuel economy of the vehicle.
[0100] It should be noted that the slope information of the road ahead and the vehicle driving status information are used in the commercial vehicle economical gliding algorithm. The algorithm solves the optimization problem based on the constraints to obtain the economical vehicle speed and gear sequence. The cloud sends the economical vehicle speed and gear sequence to the vehicle-side communication unit. After the command is parsed, the vehicle speed and gear sequence are sent to the VCU (Vehicle Control Unit) through the CAN bus. The vehicle VCU controls the vehicle engine and transmission respectively according to the recommended speed and gear sequence received, thereby controlling the vehicle's driving speed and gear, thereby achieving economical gliding control of the vehicle.
[0101] In an embodiment of the present application, an economical speed gear sequence of a target vehicle is planned according to driving state information, slope information and vehicle model parameters, including: searching for a feasible domain for starting or stopping coasting according to at least one of the driving state information, slope information and vehicle model parameters; performing forward dynamic planning or reverse dynamic planning on at least one coasting scheme in the feasible domain; and determining the economical speed gear sequence of the target vehicle according to the planning results of each coasting scheme.
[0102] It can be understood that the embodiments of the present application can search for a feasible domain for starting or stopping coasting based on at least one of the driving state information, slope information and vehicle model parameters, so as to screen out a suitable waypoint to start or stop coasting, and then perform forward dynamic programming or reverse dynamic programming on at least one coasting scheme in the feasible domain, solve the planning results of each coasting scheme to obtain the optimal result, and determine the economic speed gear sequence of the target vehicle, thereby improving the fuel economy of the vehicle.
[0103] In an embodiment of the present application, the search of the feasible domain includes at least one of the following situations: the vehicle starts to glide at an initial speed at an initial waypoint; the vehicle glides to the final waypoint and the final speed is a set cruising speed; the vehicle starts to glide at an intermediate waypoint, and the starting speed of the glide is selected based on the discrete state space of dynamic programming.
[0104] It should be noted that there are two main situations for searching the feasible domain: 1. The vehicle starts to glide at the initial speed v0 at the initial waypoint or the vehicle glides to the final waypoint and the final speed is the set cruising speed v cc ; Second, the vehicle starts to slide at the middle waypoint. The starting speed of the slide can be calculated in the dynamic programming discrete state space v min ~v max The waypoint position where the sliding stops needs to be calculated.
[0105] For case 1: The above formula (4) can be used to calculate the speed of the subsequent waypoints starting from the initial waypoint v0, until the sliding speed does not meet the constraint condition v min ≤v i ≤v max Until then, record all the waypoints where the vehicle can stop sliding; by using formula (6), we can calculate the waypoints before the end point and the speed is exactly v cc The speed at the waypoint until the start of sliding does not meet the constraint condition v min ≤v i ≤v max So far, record the positions of all the waypoints where you can start sliding.
[0106] For case 2: Formula (4) can be used to calculate the sliding speed of subsequent waypoints after starting from a certain speed at the intermediate waypoint until the constraint condition v is not satisfied. min ≤v i ≤v max Record the position of the waypoint where you can start gliding and the corresponding starting gliding speed, as well as the corresponding sequence of waypoints where you can stop gliding.
[0107] After searching the feasible domain, you can start solving four solutions: in gear-neutral-in gear (ENE), neutral-in gear-neutral (NEN), neutral-in gear (NE), and in gear-neutral (EN), each with its own corresponding minimum cost and corresponding vehicle speed gear sequence.
[0108] In an embodiment of the present application, forward dynamic programming and reverse dynamic programming are performed on at least one gliding scheme in a feasible domain, including: establishing an objective function of fuel saving and driving efficiency; determining a target road segment number relationship for multiple planned roads in the driving direction of the target vehicle; using the target road segment number relationship as a constraint of the objective function, and solving the objective function by forward dynamic programming or reverse dynamic programming.
[0109] Among them, the objective function includes:
[0110]
[0111] Among them, w1 is the weight of fuel economy, w2 is the weight of driving efficiency, Δt i is the travel time of the vehicle between two waypoints, b e (T e,i , n e,i ) is the instantaneous fuel consumption of the vehicle during driving, n e,i is the engine speed at the i-th road point, T e,i is the engine output torque at the i-th road point, is the instantaneous fuel consumption of the engine at idle speed. In this application, it is assumed that the vehicle is traveling between two waypoints in a state close to a uniform acceleration state, so the driving time can be calculated by the following formula:
[0112]
[0113] Among them, Δs i is the length of the i-th road section, v i is the vehicle speed at the i-th waypoint, v i-1 is the vehicle speed at the i-1th waypoint;
[0114] The constraints are:
[0115] v min ≤v i ≤v max , i∈{1, 2, 3...N},
[0116] Among them, v i is the vehicle speed at the i-th waypoint, v min is the minimum speed of the vehicle, v max is the maximum speed of the vehicle;
[0117] a min ≤a i ≤a max , i∈{1, 2, 3...N},
[0118] Among them, a i is the vehicle acceleration at the ith road point, a min is the minimum acceleration of the vehicle, amax is the maximum acceleration of the vehicle;
[0119] T e,min ≤T e,i ≤T e,max , i∈{1, 2, 3...N},
[0120] Among them, T e,i is the engine output torque at the i-th road point, T e,min is the minimum output torque of the engine, T e,max is the maximum output torque of the engine;
[0121] z i ={0, 1}, i∈{1, 2, 3...N}
[0122] Among them, z i is the vehicle gear position signal at the i-th road point. When the vehicle transmission gear is in the highest gear, z i =0, when the vehicle transmission gear is in neutral i =1;
[0123]
[0124] in,
[0125]
[0126] Among them, z i is the vehicle gear position signal at the i-th road point, z i+1 is the vehicle gear position signal of the i+1th waypoint; too many gear shifts during driving will cause the vehicle clutch to wear out faster, and the impact during gear shifting will also affect driving comfort. Therefore, it is necessary to limit the number of gear shifts in each planning. In this application, the maximum number of gear shifts in one planning is two;
[0127] Under the constraint of the number of gear switching, there are at most two gear switching states in one planning, which is equivalent to further dividing the planned N sections of road into three major sections. The relationship between the number of road sections contained in each major section satisfies the following conditions, that is, the relationship between the number of target road sections includes:
[0128]
[0129] Among them, n i is the number of small road sections contained in the re-divided large road section, and N is the planned road.
[0130] It can be understood that the embodiments of the present application can establish an objective function of fuel saving and driving efficiency; determine the target road segment number relationship of multiple planned roads in the driving direction of the target vehicle; use the target road segment number relationship as a constraint of the objective function, and solve the objective function by forward dynamic programming or reverse dynamic programming, thereby realizing economical gliding driving of the vehicle.
[0131] It should be noted that this application chooses to plan ten waypoints in the future at a time, that is, N = 10, and the road length is approximately 2km. The PCC planning module uses forward dynamic programming and directional dynamic programming to solve the problem of being in gear throughout the entire process at the same time, and calculates it twice; forward dynamic programming is similar to reverse dynamic programming, both of which can solve optimization problems, and for the same PCC planning, the economic speed sequences planned by the two are exactly the same. However, the cost matrices of the two are slightly different, so after calculating the forward / reverse dynamic programming, it is necessary to save the cost matrices of the forward dynamic programming and the reverse dynamic programming, and simplify the calculation of the subsequent economic sliding planning module by utilizing the non-aftereffect of dynamic programming to avoid wasting storage space.
[0132] In an embodiment of the present application, forward dynamic programming is the same as reverse dynamic programming, wherein the forward dynamic programming includes: planning the number of discrete speeds for each stage according to discrete preset speed intervals; obtaining the cost of the initial waypoint and the cost of the final waypoint, and calculating the minimum cost of reaching the waypoint state of the current stage from the initial waypoint in each stage according to the number of discrete speeds; calculating the minimum transfer cost between two waypoint states, and generating a cost matrix according to the cost of the initial waypoint, the cost of the final waypoint, the minimum cost of reaching the waypoint state of the current stage from the initial waypoint, and the minimum transfer cost; and solving the objective function according to the cost matrix.
[0133] Among them, the preset speed interval can be determined according to actual conditions and is not specifically limited.
[0134] It can be understood that the embodiment of the present application calculates the minimum cost of reaching the waypoint state of the current stage from the initial waypoint in each stage according to the number of discrete speeds; calculates the minimum transfer cost between two waypoint states, and generates a cost matrix according to the cost of the initial waypoint, the cost of the terminal waypoint, the minimum cost of reaching the waypoint state of the current stage from the initial waypoint, and the minimum transfer cost; solves the objective function according to the cost matrix, thereby realizing economical gliding driving of the vehicle.
[0135] Specifically, this application selects the number of discrete speeds in each stage of dynamic programming as M;
[0136]
[0137] Where Δv is the discrete speed interval. Figure 6As shown in the figure, J0 is the cost of the initial waypoint, which is set to 0; J N The price for the end point; is the minimum cost from the initial waypoint to the Mth state in the kth waypoint; is the minimum transfer cost between two waypoint states.
[0138] In the embodiment of the present application, at least one sliding scheme includes first to fourth sliding schemes, wherein:
[0139] The first coasting scheme includes: determining the end position and end state of the coasting according to at least one planning scheme of the forward dynamic programming; calculating the cost of any two waypoints before the end position according to the end position and the end state, and calculating the cost value of the speed gear sequence from the start position to the end position of the coasting according to the cost of the any two waypoints; selecting the speed gear sequence with the smallest cost value as the economic speed gear sequence of the target vehicle;
[0140] The second sliding scheme includes: determining the sliding starting point and the starting state according to at least one planning scheme of reverse dynamic programming; calculating the cost value of the speed gear sequence from the starting position to the end position of the sliding according to the cost of any two waypoints, and selecting the speed gear sequence with the smallest cost value as the economic speed gear sequence of the target vehicle;
[0141] The third taxiing option includes:
[0142] Determine the terminal position and terminal state of coasting according to at least one planning scheme of forward dynamic programming, and calculate the cost value of the first stage vehicle speed gear sequence from the starting position to the terminal position of coasting according to the cost of any two waypoints of forward dynamic programming; determine the starting position and starting state of coasting according to at least one planning scheme of reverse dynamic programming, and calculate the cost value of the third stage vehicle speed gear sequence from the starting position to the terminal position of coasting according to the cost of any two waypoints of reverse dynamic programming; calculate the cost value of the vehicle speed gear sequence of the second stage according to the uniform acceleration state of the vehicle; calculate the cost value of the vehicle speed gear sequence from the first stage to the third stage, and select the vehicle speed gear sequence with the smallest cost value as the economical vehicle speed gear sequence of the target vehicle;
[0143] The fourth coasting plan includes: determining the end position and end state of the coasting according to at least one planning plan of forward dynamic programming; determining the starting position and starting state of the coasting according to at least one planning plan of reverse dynamic programming, calculating the cost value of the speed gear sequence of the third stage from the starting position to the end position of the coasting according to the cost of any two waypoints, and selecting the speed gear sequence with the smallest cost value as the economical speed gear sequence of the target vehicle.
[0144] Among them, the first to fourth gliding schemes are respectively "in gear + neutral", "neutral + in gear", "in gear - neutral - in gear", and "neutral - in gear - neutral".
[0145] It is understandable that the embodiment of the present application can start solving the minimum cost and the corresponding vehicle speed gear sequence corresponding to each of the four solutions after searching the feasible domain, so as to control the vehicle to perform corresponding operations according to the vehicle speed gear sequence.
[0146] It should be noted that each section of road can be driven in gear or in neutral, with E representing gear and N representing neutral. There are five driving mode options in one planning: all-in-gear, i.e. PCC; in-gear-neutral-in-gear (ENE); neutral-in-gear-neutral (NEN); neutral-in-gear (NE); in-gear-neutral (EN). This application does not consider the situation of all-in-gear because it is difficult for the vehicle to reach the speed of v at the last position by gliding due to external resistance. cc .
[0147] Specifically, the economical speed gear sequence planning is described in detail as follows:
[0148] (1) "In gear + neutral" solution: The key issue is to confirm the waypoint k where the sliding starts, without confirming the speed v at which the sliding starts. k , because the speed constraint of the final state of the last waypoint is v 10 =v cc According to formula (6), the speed v from the last waypoint can be calculated from the previous waypoint in reverse. cc The starting sliding speed v k Therefore, it is necessary to screen out all possible waypoints k where sliding can begin in advance.
[0149] The cost calculation method of this sliding scheme is as follows Figure 7 In the figure, blue indicates reset status points or paths that need to be recalculated, and orange indicates unchanged status points or paths that do not need to be recalculated; solid lines indicate paths between adjacent waypoints, and dotted lines indicate paths between non-adjacent waypoints; curved lines indicate that the vehicle is in neutral, and straight lines indicate that the vehicle is in gear.
[0150] Assume that the sliding starts from the kth waypoint, and the initial sliding speed is v k. Because the initial state v0 has not changed, we only need to modify the end position and final state of the forward dynamic programming, recalculate the cost from the k-1th waypoint to the kth waypoint, and we can get the minimum cost of the first part in gear. The cost calculation method for the second part of gliding is the same as above. Adding the costs of the two parts together can get the minimum cost for this choice. Then compare the minimum costs of all possible situations in the "EN" mode, find the minimum cost corresponding to the "EN" mode, and the corresponding speed sequence and gear sequence.
[0151] (2) Neutral + In Gear: The key issue is to confirm the waypoint p where the vehicle stops sliding, without confirming the speed v at which the vehicle stops sliding. p , because the initial speed of the first waypoint is the current vehicle speed v0, the final sliding speed v when sliding to a certain waypoint can be calculated according to formula (4) p .
[0152] The cost calculation method of this sliding scheme is as follows Figure 8 Assume that the vehicle stops sliding from the pth point and the speed at which the vehicle ends sliding is v p . Because the final state has not changed, we only need to modify the starting position and initial state of the reverse dynamic programming, recalculate the cost from the pth waypoint to the p+1 waypoint, and we can get the minimum cost of the second part in gear and the corresponding speed sequence. The cost calculation method for the first part of the sliding is the same as above. By adding the costs of the two parts, we can get the minimum cost under this choice, as well as the corresponding speed sequence and gear sequence.
[0153] Then compare the minimum costs of all possible situations in the "NE" mode, find the minimum cost corresponding to the "NE" mode, and the corresponding speed sequence and gear sequence.
[0154] (3) “In gear + neutral + in gear” solution: The key issue is to determine the waypoint k at which the sliding starts and the speed v at which the sliding starts k , and the waypoint p where the sliding stops. The reason why the speed v for stopping the sliding is not set p , because of formula (4), when the three are determined, the speed v of stopping sliding p It can already be found.
[0155] The cost calculation method of this sliding scheme is as follows Fig. 9 As shown. All possible situations are calculated, and the cost of each situation is divided into three sections, namely "driving in gear in the first section", "driving in neutral gear in the second section", and "driving in gear in the third section". In the first section, the initial state does not change, only the final state changes (the number of waypoints and the final speed change). Assume that the vehicle travels to the kth waypoint of the original route in the first section, and the speed at the kth waypoint is v kDue to the lack of aftereffect of forward dynamic programming, the cost matrix of the first k-1 waypoints does not need to be recalculated at this time, but only the state of the kth waypoint needs to be changed to v k , and only the cost from k-1 waypoint to k waypoint needs to be recalculated to find the minimum cost of the first section of in-gear driving and the corresponding speed sequence in this case.
[0156] The cost calculation of the second neutral gear is relatively simple. During the neutral gear gliding, the distance between each two waypoints is considered to be a uniform acceleration of the vehicle. Therefore, the driving time can be calculated by formula (9). According to assumption 1, the fuel consumption of the second neutral gear gliding can also be calculated. Then, according to the weight in the cost function, the cost of the second neutral gear is calculated by weight. At the same time, it is assumed that the speed of gliding to the pth waypoint and the end of gliding is v p , the starting planned speed of the third section in gear is the speed at the end of the second section of neutral sliding. Similarly, the minimum cost of the third section in gear and the corresponding speed sequence can be obtained by recalculating the cost from the pth waypoint to the p+1th waypoint of the reverse dynamic planning.
[0157] The minimum cost of this choice, as well as the corresponding speed sequence and gear sequence, can be obtained by adding up the costs of the three parts. Then, the minimum cost of all possible situations in the "ENE" mode is compared to find the minimum cost corresponding to the "ENE" mode, as well as the corresponding speed sequence and gear sequence.
[0158] (4) Neutral + In gear + Neutral: In this mode, it is necessary to determine the waypoint k where the first neutral section of coasting stops, and the waypoint p where the third neutral section of coasting starts. It is not necessary to determine the end speed v of the first neutral section of coasting. k This is because when the end point of the first glide segment is determined, the end speed is determined by formula (4); there is no need to confirm the glide speed v at the start of the third glide segment. p This is because after the starting point of the third sliding section is determined, the speed at the beginning of sliding can also be calculated by formula (6).
[0159] The cost calculation method of this sliding scheme is as follows Fig.10 In this scheme, since the starting position, starting state, ending position and ending state of the second part in the gear cannot be determined in advance, the optimal speed sequence in the gear link can only be obtained by recalculating the dynamic programming in full, which occupies relatively large computing resources.
[0160] After the minimum cost is calculated by dynamic programming, the cost of the two neutral parts is added to get the minimum cost in this case. Then the minimum cost of all possible situations in the "NEN" mode is compared to find the minimum cost corresponding to the "NEN" mode, as well as the corresponding speed sequence and gear sequence.
[0161] At this point, the minimum cost of each of the four gliding schemes of the economic gliding planning algorithm and the corresponding vehicle speed gear sequence have been calculated.
[0162] According to the vehicle coasting method based on cloud-based high-precision maps proposed in the embodiments of the present application, the slope information in the driving direction of the target vehicle is determined according to the position information and the high-precision map, the economic speed gear sequence of the target vehicle is planned according to the driving state information, the slope information and the vehicle model parameters, the target speed and target gear of the target vehicle are determined according to the economic speed gear sequence, the coasting of the target vehicle is controlled based on the target speed and the target gear, and the road slope is fully utilized to plan the coasting of the vehicle, so that the vehicle can start neutral coasting at a suitable speed at a suitable place, and then stop neutral coasting at a suitable place and resume driving in gear, thereby realizing economical coasting of the vehicle.
[0163] The following will be combined Figures 2 to 10 The specific operation scenario of the vehicle gliding method based on the cloud high-precision map in this application is described in detail as follows:
[0164] like Figure 2 As shown, the commercial vehicle economical gliding algorithm is turned on while the vehicle is driving, and the vehicle-side communication unit obtains the vehicle driving status information, such as vehicle speed and gear, through the CAN bus, and obtains the current vehicle position status information, such as the longitude and latitude of the vehicle's location, through the GPS module in the communication unit, and then packages the vehicle status information and uploads it to the cloud at a fixed frequency.
[0165] Based on the acquired vehicle position information, the cloud calls the cloud high-precision map application to obtain the slope information of the road ahead of the vehicle. The slope information of the road ahead and the vehicle driving status information are then used in the commercial vehicle economical gliding algorithm. The algorithm solves the optimization problem based on the constraints to obtain the economic vehicle speed and gear sequence. The cloud sends the economic vehicle speed and gear sequence to the vehicle-side communication unit. After command parsing, the vehicle speed and gear sequence are sent to the vehicle control unit through the CAN bus.
[0166] The vehicle control unit controls the vehicle engine and transmission respectively according to the recommended vehicle speed and gear sequence received, thereby controlling the vehicle's driving speed and gear, thereby achieving economical gliding control of the vehicle.
[0167] Specific technical framework and technical principles such as Figure 3 As shown, the commercial vehicle economical gliding algorithm based on cloud-based high-precision maps is arranged in the cloud 11, which mainly includes cloud-based map services 111, vehicle model parameter settings 112, and economical gliding planning algorithms 113.
[0168] After receiving the vehicle position information uploaded by the vehicle end 12, the cloud 11 calls the high-precision map to obtain the slope information of the road ahead according to the vehicle positioning module. At the same time, the cloud contains the vehicle model parameter setting 112, which can provide vehicle parameter information and vehicle model for solving various auxiliary driving algorithms. Then the economic sliding planning algorithm 113 performs economic sliding planning based on the slope information of the road ahead provided by the cloud map service 111 and the vehicle model parameters provided by the vehicle model parameter setting 112, obtains the optimal speed gear sequence, and sends it to the vehicle end 12.
[0169] After the vehicle end 12 receives the vehicle speed gear sequence, it parses the command through the T-BOX and then transmits it to the VCU. The VCU sends the vehicle speed gear control command to the transmission and engine to perform gear speed control.
[0170] The following specifically introduces the vehicle models used in the vehicle model parameter setting 112: the vehicle longitudinal dynamics model when the vehicle is traveling in gear, the energy conservation model when the vehicle is coasting in neutral gear, and the vehicle engine fuel consumption model.
[0171] These models are all used to calculate the vehicle's driving speed. When the vehicle is in gear, the vehicle's longitudinal speed can be controlled by the accelerator pedal; when the vehicle is in neutral and gliding, the vehicle's longitudinal speed cannot be controlled at this time, so the speed of the vehicle at a certain position can only be calculated using the energy conservation formula.
[0172] (1) Figure 4 As shown in Figure 2, the longitudinal force balance equation of the vehicle is:
[0173]
[0174] Among them, F t For the driving force of the car, T e is the engine output torque, i g is the current gear ratio of the gearbox, i o is the main reducer transmission ratio, η is the mechanical efficiency of the transmission system, r w is the wheel radius; F w is the air resistance, C D is the vehicle drag coefficient, A is the vehicle frontal area, p is the air density, v is the vehicle speed; Fi is the slope resistance, F i = mgsin(θ), m is the mass of the vehicle, g is the acceleration of gravity, and θ is the road slope; F f is the rolling resistance, F f =mgfcos(θ), where f is the rolling resistance coefficient.
[0175] (2) Figure 5As shown in the figure, when the vehicle is in a gliding state, the gearbox is in neutral, the power between the engine and the wheels is cut off, and in order to reduce fuel consumption, the driver will not step on the accelerator pedal, the engine speed gradually decreases to the idle state, and the driver tries to avoid stepping on the brake pedal while ensuring safety. At this time, the longitudinal movement of the vehicle is not affected by the driver, and the vehicle slides freely on the road under the combined effect of gravity and external resistance. However, the vehicle still follows the law of conservation of energy, so the speed of the vehicle at any position during gliding can still be obtained by calculation.
[0176]
[0177] Among them, v1 and v2 are the speeds of the vehicle when it starts and stops sliding respectively; h1 and h2 are the altitudes of the road when the vehicle starts and stops sliding respectively; s1 and s2 are the positions of the vehicle when it starts and stops sliding respectively.
[0178] Since the algorithm in actual situations is based on sampling for discrete calculation, in order to be applicable to actual working conditions, the formula (2) is discretized by the Euler method. When the vehicle's starting sliding speed v1 is known, the ending sliding speed v2 is obtained:
[0179]
[0180] Where Δs=s2-s1.
[0181]
[0182] When the vehicle's end-slip speed v2 is known, the starting-slip speed v1 is
[0183]
[0184] (3) The vehicle engine fuel consumption model is used to fit and calculate the instantaneous fuel consumption of the vehicle during driving. A fuel consumption polynomial model of the engine instantaneous fuel consumption with respect to the engine output torque and engine speed is constructed, and its expression is as follows.
[0185]
[0186] where ξ i,j are the coefficients of the polynomial, n e is the engine speed, and its relationship with the vehicle speed is shown in formula (2-7)
[0187]
[0188] The following will introduce how the economical coasting planning algorithm 113 performs economical vehicle speed gear sequence planning.
[0189] In order to achieve economical gliding of the vehicle, the control variables are selected as the vehicle speed and the transmission gear. In order to save fuel and ensure the driving efficiency of the vehicle during economic gliding, the following objective function is established:
[0190]
[0191] Among them, w1 is the weight of fuel economy, w2 is the weight of driving efficiency, Δt i is the travel time of the vehicle between two waypoints, b e (T e,i , n e,i ) is the instantaneous fuel consumption of the vehicle during driving, n e,i is the engine speed at the i-th road point, T e,i is the engine output torque at the i-th road point, is the instantaneous fuel consumption of the engine at idle speed. In this application, it is assumed that the vehicle is traveling between two waypoints in a state close to a uniform acceleration state, so the driving time can be calculated by the following formula:
[0192]
[0193] Among them, Δs i is the length of the i-th road section, v i is the vehicle speed at the i-th waypoint, v i-1 is the vehicle speed at the i-1th waypoint;
[0194] The constraints are:
[0195] v min ≤v i ≤v max , i∈{1, 2, 3...N},
[0196] Among them, v i is the vehicle speed at the i-th waypoint, v min is the minimum speed of the vehicle, v max is the maximum speed of the vehicle;
[0197] a min ≤a i ≤a max , i∈{1, 2, 3...N},
[0198] Among them, a i is the vehicle acceleration at the ith road point, a min is the minimum acceleration of the vehicle, a max is the maximum acceleration of the vehicle;
[0199] T e,min ≤T e,i ≤T e,max, i∈{1, 2, 3...N},
[0200] Among them, T e,i is the engine output torque at the i-th road point, T e,min is the minimum output torque of the engine, T e,max is the maximum output torque of the engine;
[0201] z i ={0, 1}, i∈{1, 2, 3...N}
[0202] Among them, z i is the vehicle gear position signal at the i-th road point. When the vehicle transmission gear is in the highest gear, z i =0, when the vehicle transmission gear is in neutral i =1;
[0203]
[0204] in,
[0205]
[0206] Among them, z i is the vehicle gear position signal at the i-th road point, z i+1 is the vehicle gear position signal of the i+1th waypoint; too many gear shifts during driving will cause the vehicle clutch to wear out faster, and the impact during gear shifting will also affect driving comfort. Therefore, it is necessary to limit the number of gear shifts in each planning. In this application, the maximum number of gear shifts in one planning is two;
[0207] Under the constraint of the number of gear switching, there are at most two gear switching states in one planning, which is equivalent to further dividing the planned N sections of road into three major sections. The relationship between the number of road sections contained in each major section satisfies the following conditions, that is, the relationship between the number of target road sections includes:
[0208]
[0209] Among them, n i is the number of small road sections contained in the re-divided large road section, and N is the planned road.
[0210] Each section of road can be driven in gear or in neutral, with E representing transmission engaged and N representing neutral. There are five driving modes in one planning: full gear, i.e. PCC; gear-neutral-gear (ENE); neutral-gear-neutral (NEN); neutral-gear (NE); gear-neutral (EN). This application does not consider the full neutral situation because it is difficult for the vehicle to reach the speed of v at the last position by gliding due to external resistance. cc .
[0211] In this application, ten future waypoints are selected for planning at one time, that is, N=10, and the road length is approximately 2 km.
[0212] The PCC planning module 1131 in the economical gliding planning algorithm 113 is responsible for calculating the cost of being in gear throughout the entire process and the corresponding vehicle speed sequence. Usually, the PCC calculation only needs to be calculated once using dynamic programming (DP), but in this application, the PCC planning module 1131 uses forward dynamic programming and directional dynamic programming to solve the problem of being in gear throughout the entire process at the same time, and calculates it twice.
[0213] This application chooses the number of discrete speeds in each stage of dynamic programming to be M;
[0214]
[0215] Where Δv is the discrete speed interval. Figure 6 As shown in the figure, J0 is the cost of the initial waypoint, which is set to 0; J N The price for the end point; is the minimum cost from the initial waypoint to the Mth state in the kth waypoint; is the minimum transfer cost between two waypoint states.
[0216] The forward dynamic programming is similar to the reverse dynamic programming, and both can solve the optimization problem. For the same PCC planning, the economic speed sequences planned by the two are completely consistent. However, the cost matrices of the two are slightly different. Therefore, after calculating the forward / reverse dynamic programming, it is necessary to save the cost matrices of the forward dynamic programming and the reverse dynamic programming. By utilizing the non-aftereffect of the dynamic programming, the calculation of the subsequent economic taxiing planning module 1132 is simplified to avoid the waste of storage space.
[0217] In the economic taxiing planning module 1132, a feasible domain search is first performed. The purpose of this step is to select a suitable waypoint to start or stop taxiing.
[0218] There are two main situations for searching the feasible domain: 1. The vehicle starts to glide at the initial speed v0 at the initial waypoint or the vehicle glides to the final waypoint and the final speed is the set cruising speed v cc ; Second, the vehicle starts to slide at the middle waypoint. The starting speed of the slide can be calculated in the dynamic programming discrete state space v min ~v max The waypoint position where the sliding stops needs to be calculated.
[0219] For case 1: Formula (4) can be used to calculate the speed of the subsequent waypoints starting from the initial waypoint v0, until the sliding speed does not meet the constraint condition v min ≤v i ≤v max Until then, record all the waypoints where the vehicle can stop sliding; by using formula (6), we can calculate the waypoints before the end point and the speed is exactly v cc The speed at the waypoint until the start of sliding does not meet the constraint condition v min ≤v i ≤v max So far, record the positions of all the waypoints where you can start sliding.
[0220] For case 2: Formula (4) can be used to calculate the sliding speed of subsequent waypoints after starting from a certain speed at the intermediate waypoint until the constraint condition v is not satisfied. min ≤v i ≤v max Record the position of the waypoint where you can start gliding and the corresponding starting gliding speed, as well as the corresponding sequence of waypoints where you can stop gliding.
[0221] After searching the feasible domain, you can start solving four solutions: in gear-neutral-in gear (ENE), neutral-in gear-neutral (NEN), neutral-in gear (NE), and in gear-neutral (EN), each with its own corresponding minimum cost and corresponding vehicle speed gear sequence.
[0222] The following will introduce the calculation methods corresponding to the four sliding schemes, and how to use the no-aftereffect property of dynamic programming to simplify the calculation.
[0223] ① "In gear + neutral" solution: The key issue is to confirm the waypoint k where the sliding starts, without confirming the speed v at which the sliding starts k , because the speed constraint of the final state of the last waypoint is v 10 =v cc According to formula (6), the speed v from the last waypoint can be calculated from the previous waypoint in reverse. cc The starting sliding speed v kTherefore, it is necessary to screen out all possible waypoints k where sliding can begin in advance.
[0224] The cost calculation method of this sliding scheme is as follows Figure 6 In the figure, blue indicates reset status points or paths that need to be recalculated, and orange indicates unchanged status points or paths that do not need to be recalculated; solid lines indicate paths between adjacent waypoints, and dotted lines indicate paths between non-adjacent waypoints; curved lines indicate that the vehicle is in neutral, and straight lines indicate that the vehicle is in gear.
[0225] Assume that the sliding starts from the kth waypoint, and the initial sliding speed is v k . Because the initial state v0 has not changed, we only need to modify the end position and final state of the forward dynamic programming, recalculate the cost from the k-1th waypoint to the kth waypoint, and we can get the minimum cost of the first part in gear. The cost calculation method for the second part of gliding is the same as above. Adding the costs of the two parts together can get the minimum cost for this choice. Then compare the minimum costs of all possible situations in the "EN" mode, find the minimum cost corresponding to the "EN" mode, and the corresponding speed sequence and gear sequence.
[0226] ② "Neutral + In Gear" solution: The key issue is to confirm the waypoint p for stopping the sliding, without confirming the speed v for stopping the sliding p , because the initial speed of the first waypoint is the current vehicle speed v0, the final sliding speed v when sliding to a certain waypoint can be calculated according to formula (4) p .
[0227] The cost calculation method of this sliding scheme is as follows Figure 7 Assume that the vehicle stops sliding from the pth point and the speed at which the vehicle ends sliding is v p . Because the final state has not changed, we only need to modify the starting position and initial state of the reverse dynamic programming, recalculate the cost from the pth waypoint to the p+1 waypoint, and we can get the minimum cost of the second part in gear and the corresponding speed sequence. The cost calculation method for the first part of the sliding is the same as above. By adding the costs of the two parts, we can get the minimum cost under this choice, as well as the corresponding speed sequence and gear sequence.
[0228] Then compare the minimum costs of all possible situations in the "NE" mode, find the minimum cost corresponding to the "NE" mode, and the corresponding speed sequence and gear sequence.
[0229] ③ "In gear + neutral + in gear" solution: The key issue is to confirm the waypoint k where the sliding starts and the speed v at which the sliding starts k , and the waypoint p where the sliding stops. The reason why the speed v for stopping the sliding is not set p, because of formula (4), when the three are determined, the speed v of stopping sliding p It can already be found.
[0230] The cost calculation method of this sliding scheme is as follows Figure 8 As shown. All possible situations are calculated, and the cost of each situation is divided into three sections, namely "driving in gear in the first section", "driving in neutral gear in the second section", and "driving in gear in the third section". In the first section, the initial state does not change, only the final state changes (the number of waypoints and the final speed change). Assume that the vehicle travels to the kth waypoint of the original route in the first section, and the speed at the kth waypoint is v k Due to the lack of aftereffect of forward dynamic programming, the cost matrix of the first k-1 waypoints does not need to be recalculated at this time, but only the state of the kth waypoint needs to be changed to v k , and only the cost from k-1 waypoint to k waypoint needs to be recalculated to find the minimum cost of the first section of in-gear driving and the corresponding speed sequence in this case.
[0231] The cost calculation of the second neutral gear is relatively simple. During the neutral gear gliding, the distance between each two waypoints is considered to be a uniform acceleration of the vehicle. Therefore, the driving time can be calculated by formula (9). According to assumption 1, the fuel consumption of the second neutral gear gliding can also be calculated. Then, according to the weight in the cost function, the cost of the second neutral gear is calculated by weight. At the same time, it is assumed that the speed of gliding to the pth waypoint and the end of gliding is v p , the starting planned speed of the third section in gear is the speed at the end of the second section of neutral sliding. Similarly, the minimum cost of the third section in gear and the corresponding speed sequence can be obtained by recalculating the cost from the pth waypoint to the p+1th waypoint of the reverse dynamic planning.
[0232] The minimum cost of this choice, as well as the corresponding speed sequence and gear sequence, can be obtained by adding up the costs of the three parts. Then, the minimum cost of all possible situations in the "ENE" mode is compared to find the minimum cost corresponding to the "ENE" mode, as well as the corresponding speed sequence and gear sequence.
[0233] ④ Neutral + In gear + Neutral: In this mode, it is necessary to determine the waypoint k where the first neutral slide stops, and the waypoint p where the third neutral slide starts. It is not necessary to determine the end speed v of the first neutral slide. k This is because when the end point of the first glide segment is determined, the end speed is determined by formula (4); there is no need to confirm the glide speed v at the start of the third glide segment. p This is because after the starting point of the third sliding section is determined, the speed at the beginning of sliding can also be calculated by formula (6).
[0234] The cost calculation method of this sliding scheme is as follows Fig. 9 In this scheme, since the starting position, starting state, ending position and ending state of the second part in the gear cannot be determined in advance, the optimal speed sequence in the gear link can only be obtained by recalculating the dynamic programming in full, which occupies relatively large computing resources.
[0235] After the minimum cost is calculated by dynamic programming, the cost of the two neutral parts is added to get the minimum cost in this case. Then the minimum cost of all possible situations in the "NEN" mode is compared to find the minimum cost corresponding to the "NEN" mode, as well as the corresponding speed sequence and gear sequence.
[0236] At this point, the minimum cost of each of the four gliding schemes of the economic gliding planning algorithm and the corresponding vehicle speed gear sequence have been calculated.
[0237] After that, the screening module 1133 performs cost comparison screening, and selects the plan with the lowest cost among the five plans of full-time in gear (PCC), EN, NE, ENE, and NEN as the final driving plan, and sends its corresponding gear sequence of vehicle speed to the vehicle end 12 for execution, so as to realize the economical gliding of the vehicle.
[0238] When the vehicle passes the first waypoint in the planning range, the algorithm is updated and iterated, and the economical gliding algorithm is replanned according to the vehicle status.
[0239] In summary, (1) the present application proposes, under the background of cloud-based high-precision map technology, that the cloud control platform can store high-precision maps and provide the vehicle with the precise slope of the road ahead. Based on cloud-based high-precision map technology, the present application proposes a vehicle economical gliding planning algorithm based on cloud-based high-precision maps, and designs a commercial vehicle economical gliding system architecture based on cloud-based high-precision maps. The architecture realizes that the vehicle-side status is continuously uploaded to the cloud at a fixed frequency through a communication unit, and obtains the slope information of the road ahead of the current vehicle by calling the high-precision map in the cloud. The obtained road slope information is then used to perform economical gliding planning for commercial vehicles, and the economical speed gear sequence is solved and sent to the vehicle side. The vehicle controls the vehicle speed and transmission gear according to the received speed gear sequence. This solves the problem that the rule-based economic gliding method does not make full use of the road slope to plan vehicle gliding, resulting in a certain loss in vehicle economy.
[0240] (2) This application designs an economical gliding planning algorithm for commercial vehicles based on forward / reverse dynamic programming. By constructing a cost function with fuel consumption and driving efficiency as the target, the actual constraints of the vehicle are comprehensively considered, and an optimization problem is established. The characteristic of dynamic programming without aftereffect is used to solve the optimization problem, and the economical vehicle driving speed and gear sequence are obtained, so that the vehicle can start neutral gliding at a suitable speed in a suitable place, and then stop neutral gliding at a suitable position and resume driving in gear, so as to realize the economical gliding driving of the vehicle. The problem of poor real-time performance and large storage resource occupation of global dynamic programming in the existing method is solved, and the problem of insufficient consideration of the influence of slope information on economic vehicle speed when performing economic gliding according to the optimal speed curve is solved.
[0241] Next, a vehicle sliding device based on a cloud-based high-precision map proposed in accordance with an embodiment of the present application will be described with reference to the accompanying drawings.
[0242] Fig.11 It is a block diagram of a vehicle sliding device based on a cloud-based high-precision map according to an embodiment of the present application.
[0243] like Fig.11 As shown, the vehicle sliding device 10 based on cloud-based high-precision maps includes: an acquisition module 100, a determination module 200, a setting module 300 and a planning module 400.
[0244] Among them, the acquisition module 100 is used to obtain the driving status information and position information of the target vehicle; the determination module 200 is used to determine the slope information in the driving direction of the target vehicle based on the position information and the high-precision map; the setting module 300 is used to obtain the vehicle model of the target vehicle and set the vehicle model parameters of the target vehicle; the planning module 400 is used to plan the economic speed gear sequence of the target vehicle according to the driving status information, slope information and vehicle model parameters, determine the target speed and target gear of the target vehicle according to the economic speed gear sequence, and control the sliding of the target vehicle based on the target speed and target gear.
[0245] It should be noted that the aforementioned explanation of the embodiment of the vehicle sliding method based on cloud-based high-precision maps is also applicable to the vehicle sliding device based on cloud-based high-precision maps in this embodiment, and will not be repeated here.
[0246] According to the vehicle sliding device based on cloud-based high-precision map proposed in the embodiment of the present application, the slope information in the driving direction of the target vehicle is determined according to the position information and the high-precision map, the economic speed gear sequence of the target vehicle is planned according to the driving state information, the slope information and the vehicle model parameters, the target speed and target gear of the target vehicle are determined according to the economic speed gear sequence, the sliding of the target vehicle is controlled based on the target speed and the target gear, and the road slope is fully utilized to plan the sliding of the vehicle, so that the vehicle can start neutral sliding at a suitable speed at a suitable place, and then stop neutral sliding at a suitable place and resume driving in gear, thereby realizing economic sliding of the vehicle.
[0247] Fig.12 A schematic diagram of the structure of a vehicle provided in an embodiment of the present application. The vehicle may include:
[0248] A memory 1201 , a processor 1202 , and a computer program stored in the memory 1201 and executable on the processor 1202 .
[0249] When the processor 1202 executes the program, the vehicle gliding method based on the cloud high-precision map provided in the above embodiment is implemented.
[0250] Furthermore, the vehicle also includes:
[0251] The communication interface 1203 is used for communication between the memory 1201 and the processor 1202 .
[0252] The memory 1201 is used to store computer programs that can be executed on the processor 1202 .
[0253] The memory 1201 may include a high-speed RAM (Random Access Memory) memory, and may also include a non-volatile memory, such as at least one disk memory.
[0254] If the memory 1201, the processor 1202 and the communication interface 1203 are implemented independently, the communication interface 1203, the memory 1201 and the processor 1202 can be connected to each other through a bus and communicate with each other. The bus can be an ISA (Industry Standard Architecture) bus, a PCI (Peripheral Component Interconnect) bus or an EISA (Extended Industry Standard Architecture) bus, etc. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Fig.12 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.
[0255] Optionally, in a specific implementation, if the memory 1201, the processor 1202 and the communication interface 1203 are integrated on a chip, the memory 1201, the processor 1202 and the communication interface 1203 can communicate with each other through an internal interface.
[0256] The processor 1202 may be a CPU (Central Processing Unit), or an ASIC (Application Specific Integrated Circuit), or one or more integrated circuits configured to implement the embodiments of the present application.
[0257] In the description of this specification, the description with reference to the terms "one embodiment", "some embodiments", "example", "specific example", or "some examples" etc. means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present application. In this specification, the schematic representations of the above terms are not necessarily directed to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or N embodiments or examples in a suitable manner. In addition, those skilled in the art may combine and combine the different embodiments or examples described in this specification and the features of the different embodiments or examples, without contradiction.
[0258] In addition, the terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Therefore, a feature defined as "first" or "second" may explicitly or implicitly include at least one of the features. In the description of this application, "N" means at least two, such as two, three, etc., unless otherwise clearly and specifically defined.
[0259] Any process or method description in a flowchart or otherwise described herein may be understood to represent a module, fragment or portion of code comprising one or more executable instructions for implementing the steps of a custom logical function or process, and the scope of the preferred embodiments of the present application includes alternative implementations in which functions may not be performed in the order shown or discussed, including performing functions in a substantially simultaneous manner or in reverse order depending on the functions involved, which should be understood by technicians in the technical field to which the embodiments of the present application belong.
[0260] It should be understood that the various parts of the present application can be implemented by hardware, software, firmware or a combination thereof. In the above-mentioned embodiment, the N steps or methods can be implemented by software or firmware stored in a memory and executed by a suitable instruction execution system. For example, if implemented by hardware, as in another embodiment, it can be implemented by any one of the following technologies known in the art or their combination: a discrete logic circuit having a logic gate circuit for implementing a logic function for a data signal, a dedicated integrated circuit having a suitable combination of logic gate circuits, a programmable gate array, a field programmable gate array, etc.
[0261] A person skilled in the art may understand that all or part of the steps in the method for implementing the above-mentioned embodiment may be completed by instructing related hardware through a program, and the program may be stored in a computer-readable storage medium, which, when executed, includes one or a combination of the steps of the method embodiment.
Claims
1. A vehicle gliding method based on cloud-based high-precision maps, characterized in that: The following steps are involved: Obtaining driving status information and location information of the target vehicle; Determine the slope information of the target vehicle in the driving direction according to the position information and the high-precision map; Acquire a vehicle model of the target vehicle and set vehicle model parameters of the target vehicle; An economical speed gear sequence of the target vehicle is planned according to the driving state information, the slope information and the vehicle model parameters, a target speed and a target gear of the target vehicle are determined according to the economical speed gear sequence, and the target vehicle is controlled to glide based on the target speed and the target gear.
2. The vehicle gliding method based on cloud-based high-precision maps according to claim 1 is characterized in that: The planning of the economical speed gear sequence of the target vehicle according to the driving state information, the slope information and the vehicle model parameters includes: Searching a feasible domain for starting or stopping coasting according to at least one of the driving state information, the slope information, and the vehicle model parameter; Performing forward dynamic programming or reverse dynamic programming on at least one taxiing scheme in the feasible domain; The economical speed gear sequence of the target vehicle is determined according to the planning result of each coasting scheme.
3. According to the vehicle gliding method based on cloud-based high-precision maps in claim 2, the search of the feasible domain includes at least one of the following situations: The vehicle starts to slide at the initial waypoint with the initial speed; The vehicle glides to the final point and the final speed is the set cruising speed; The vehicle starts to slide at the intermediate waypoint, and the starting speed of the slide is selected based on the discrete state space of dynamic programming.
4. The vehicle gliding method based on cloud-based high-precision maps according to claim 2, wherein the forward dynamic programming and the reverse dynamic programming of at least one gliding scheme in the feasible domain include: Establish the objective function of fuel saving and driving efficiency; Determine the relationship between the number of target road sections of the plurality of planned roads in the driving direction of the target vehicle; The target road segment number relationship is used as a constraint of the objective function, and the objective function is solved by forward dynamic programming or reverse dynamic programming.
5. According to the vehicle gliding method based on cloud-based high-precision maps in claim 4, the forward dynamic programming is the same as the reverse dynamic programming, wherein: The forward dynamic programming includes: The discrete number of speeds in each phase is planned according to discrete preset speed intervals; Obtaining the cost of the initial waypoint and the cost of the final waypoint, and calculating the minimum cost of reaching the waypoint state of the current stage from the initial waypoint in each stage according to the discrete speed quantity; Calculating the minimum transfer cost between two waypoint states, generating a cost matrix according to the cost of the initial waypoint, the cost of the final waypoint, the minimum cost of reaching the waypoint state at the current stage from the initial waypoint, and the minimum transfer cost; The objective function is solved according to the cost matrix.
6. The vehicle gliding method based on cloud-based high-precision maps according to claim 4 is characterized in that: The objective function includes: Among them, w1 is the weight of fuel economy, w2 is the weight of driving efficiency, Δt i is the travel time of the vehicle between two waypoints, b e (T e,i , n e,i ) is the instantaneous fuel consumption of the vehicle during driving, n e,i is the engine speed at the i-th road point, T e,i is the engine output torque at the i-th road point, is the instantaneous fuel consumption of the engine at idle speed, Δs i is the length of the i-th road section, v i is the vehicle speed at the i-th waypoint, v i-1 is the vehicle speed at the i-1th waypoint; The constraints are: v min ≤v i ≤v max ,i∈{1,2,3...N}, Among them, v i is the vehicle speed at the i-th waypoint, v min is the minimum speed of the vehicle, v max is the maximum speed of the vehicle; a min ≤a i ≤a max ,i∈{1,2,3...N}, Among them, a i is the vehicle acceleration at the ith road point, a min is the minimum acceleration of the vehicle, a max is the maximum acceleration of the vehicle; T e,min ≤T e,i ≤T e,max ,i∈{1,2,3...N}, Among them, T e,i is the engine output torque at the i-th road point, T e,min is the minimum output torque of the engine, T e,max is the maximum output torque of the engine; z i ={0,1},i∈{1,2,3...N} Among them, z i is the vehicle gear position signal at the i-th road point. When the vehicle transmission gear is in the highest gear, z i =0, when the vehicle transmission gear is in neutral i =1; in, Among them, z i is the vehicle gear position signal at the i-th road point, z i+ 1 is the vehicle gear position signal at the i+1th waypoint; The target road segment number relationship includes: Among them, n i is the number of small road sections contained in the re-divided large road section, and N is the planned road.
7. The vehicle gliding method based on cloud-based high-precision maps according to claim 2, characterized in that: The at least one taxiing scheme includes first to fourth taxiing schemes, wherein: The first taxiing plan includes: Determine the terminal position and terminal state of the taxiing according to at least one planning scheme of the forward dynamic programming; Calculating the cost of any two waypoints before the end position according to the end position and the end state, and calculating the cost of the vehicle speed gear sequence from the start position to the end position of the coasting according to the cost of the any two waypoints; Selecting a speed gear sequence with the smallest cost value as the economical speed gear sequence of the target vehicle; The second taxiing option includes: Determine the sliding starting point position and the starting state according to at least one planning scheme of reverse dynamic programming; Calculating the cost of the speed gear sequence from the starting position to the end position of the coasting according to the cost of the arbitrary two waypoints, and selecting the speed gear sequence with the smallest cost as the economical speed gear sequence of the target vehicle; The third taxiing option includes: Determine the end position and end state of coasting according to at least one planning scheme of forward dynamic programming, and calculate the cost value of the vehicle speed gear sequence of the first stage from the start position to the end position of coasting according to the cost of any two waypoints of the forward dynamic programming; Determine the starting position and the starting state of the coasting according to at least one planning scheme of the reverse dynamic programming, and calculate the cost value of the vehicle speed gear sequence of the third stage from the starting position to the end position of the coasting according to the cost of any two waypoints of the reverse dynamic programming; Calculating a cost value of a vehicle speed gear sequence of a second stage according to the uniform acceleration state of the vehicle; Calculating the cost values of the vehicle speed gear sequences from the first stage to the third stage, and selecting the vehicle speed gear sequence with the smallest cost value as the economical vehicle speed gear sequence of the target vehicle; The fourth taxiing plan includes: Determine the terminal position and terminal state of the taxiing according to at least one planning scheme of the forward dynamic programming; Determine the starting position and the initial state of the sliding according to at least one planning scheme of the reverse dynamic programming, The cost of the vehicle speed gear sequence of the third stage from the start position to the end position of the coasting is calculated according to the cost of any two waypoints, and the vehicle speed gear sequence with the smallest cost is selected as the economical vehicle speed gear sequence of the target vehicle.
8. The vehicle gliding method based on cloud-based high-precision maps according to claim 1, characterized in that: The vehicle model includes at least one of a vehicle longitudinal dynamics model, an energy conservation model when the vehicle is in neutral coasting, and a vehicle engine fuel consumption model. The vehicle model parameters include model parameters when the vehicle is in non-neutral driving and model parameters when the vehicle is in neutral coasting.
9. A vehicle sliding device based on cloud-based high-precision maps, characterized in that: include: An acquisition module, used to acquire the driving status information and location information of the target vehicle; A determination module, used to determine the slope information in the driving direction of the target vehicle according to the position information and the high-precision map; A setting module, used for obtaining a vehicle model of the target vehicle and setting vehicle model parameters of the target vehicle; A planning module is used to plan an economic speed gear sequence of the target vehicle according to the driving state information, the slope information and the vehicle model parameters, determine a target speed and a target gear of the target vehicle according to the economic speed gear sequence, and control the glide of the target vehicle based on the target speed and the target gear.
10. A vehicle, characterized in that: include: A memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the vehicle gliding method based on a cloud-based high-precision map as described in any one of claims 1 to 8.
