An online battery–state of charge estimation method using the varying forgetting factor recursive least square - unscented Kalman filter algorithm on electric vehicles
Accurate and fast estimation of the state of charge is important for the battery management system of electric vehicles. This paper proposes a method to estimate the state of charge of Lithium-ion batteries by the variable forgetting factor recursive least square (VFFRLS) – unscented Kalman filter (UKF) algorithm in real-time without the off-line battery testing data. Since the state observation requires an accurate model, an equivalent circuit model was constructed. Then, the VFFRLS algorithm is used to identify online the battery model parameters based on voltage and current measurements. An advantage of this algorithm is that it requires less initial information and shorter identification time than offline parameter identification. After the model parameters are well identified, the unscented Kalman filter estimates the state of charge and minimizes noise characteristics and uncertainty in the parameter identification process. The VFFRLS algorithm applied in this paper has shown a good result with the model output error of less than 1%, and the identification achieves real-time response. The state of charge obtained by the UKF algorithm has shown satisfactory estimation results with fast convergence speed and small errors. The UKF filter provides the results with a 1.5% error from the reference and converges after 10 cycles.
Collaboration network of the authors
2 authors ·
1 co-authorship link
· 1 across different organisations
Hover or tap a name to highlight its co-authors. Double-click to open the author's page.
Electric Power University
Hanoi University of Science and Technology
Different organisations
Same organisation
Affiliation unknown
Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-author
Organisation
Joint articles
Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.