Abstract

Accurate and reliable model parameters are not only a prerequisite for model-based estimation but also a significant part of battery operating characteristics. However, the measurement signal inevitably contains noise, which brings great challenges to model identification. This paper focuses on the noise immunity performance of model identification based on two-swarm cooperative particle swarm optimization. An adaptive dynamic sliding window based on the current rate criterion and the identification results feedback is designed to avoid data redundancy and improve the robustness of model identification. The model parameters are obtained using two-swarm cooperative particle swarm optimization based on the adaptive dynamic sliding window. The proposed method effectively improves the accuracy and speed of parameter identification through optimization of data fragments and particle update rules. Compared with two existing parameter identification methods, simulation studies illustrate that the average mean square deviation of the proposed method is reduced by at least 35 dB. The proposed method is superior to existing parameter identification methods in noise immunity performance, parameter identification reliability, and state-of-charge estimation accuracy. By employing the proposed method, the maximum errors of state-of-charge estimation are limited within 1% under experimental verification. The experiment results verify that the proposed method has the potential to extract reliable model features online.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.