Parameterized Energy-Optimal Regenerative Braking Strategy for Connected and Autonomous Electrified Vehicles: A Real-Time Dynamic Programming Approach
Dohee Kim, Jeong Soo Eo, Kwang-Ki K. Kim
IEEE Access · 2021
doi:10.1109/access.2021.3098807 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
This paper presents a vehicle speed planning system called the energy-optimal deceleration planning system (EDPS), which aims to maximize energy recuperation of regenerative braking of connected and autonomous electrified vehicles. A recuperation energy-optimal speed profile is computed based on the impending deceleration requirements for turning or stopping at an intersection. This is computed to maximize the regenerative braking energy while satisfying the physical limits of an electrified powertrain. To obtain smooth optimal deceleration speed profiles, optimal deceleration commands are determined by a parameterized polynomial-based deceleration model that is obtained by regression analyses with real vehicle driving test data. The design parameters are dependent on preview information such as residual time and distance as well as target speed. The key design parameter is deceleration time, which determines the deceleration speed profile to satisfy the residual time and distance constraints as well as the target speed requirement. The time-varying bounds of deceleration commands corresponding to the physical limits of the powertrain are deduced from realistic deceleration test driving. For validation and comparisons of the EDPS with different preview distances, driving simulation tests with a virtual road environment and vehicle-to-infrastructure connectivity are presented. It is shown that the longer preview distance in the EDPS, the more energy-recuperation. In comparison with driver-in-the-loop simulation tests, EDPS-based autonomous driving shows improvements in energy recuperation and reduction in trip time.
Abstract licence: CC BY-NC-ND
References18
18 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.