Abstract

Accurate remaining useful life (RUL) prediction under the noisy environment is a big challenge for the health management of modern industrial systems since the extraction of the accurate data structure from heavily corrupted data is difficult. In recent years, the kernel adaptive filter (KAF) has been widely adopted to solve the robust regression problem due to its low-complexity and high-approximation capability and robustness while the applications in battery RUL prediction are still few and far between. Thus, this paper is concerned with long-term RUL prediction using the KAF method. At first, concretely speaking, a robust KAF algorithm is derived based on the double-Gaussian-mixture (DGM) cost function, which is used to learn the capacity degradation mechanism from contaminated capacity data and so as to build the long-term prediction model. Second, a robust unscented Kalman filter (UKF) algorithm employing the DGM-based cost function is developed, which is then combined with the KAF-based prediction model to realize a more accurate and reliable prediction. Under the hybrid prognostic framework, the proposed UKF algorithm is applied to filter the noisy observations. When the observation data are inaccessible, the predicted data from the off-line trained KAF-based prediction model are adopted as the approximated value of the real observations for the UKF algorithm to optimize the prediction results and to provide the uncertainty representation. The experimental results reveal that the proposed method has great robustness when the measurements contain noise and large outliers, which makes it possible to get satisfactory prediction performance without preprocessing the data manually.

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.