skip to main content


Title: A Bayesian optimized framework for successful application of unscented Kalman filter in parameter identification of MDOF structures
The success of the unscented Kalman filter can be jeopardized if the required initial parameters are not identified carefully. These parameters include the initial guesses and the levels of uncertainty in the target parameters and the process and measurement noise parameters. While a set of appropriate initial target parameters give the unscented Kalman filter a head start, the uncertainty levels and noise parameters set the rate of convergence in the process. Therefore, due to the coupling effect of these parameters, an inclusive approach is desired to maintain the chance of convergence for expensive experimental tests. In this paper, a framework is proposed that, via a virtual emulation prior to the experiment, determines a set of initial conditions to ensure a successful application of the online parameter identification. A Bayesian optimization method is proposed, which considers the level of confidence in the initial guesses for the target parameters to suggest the appropriate noise covariance matrices. The methodology is validated on a five-story shear frame tested on a shake table. The results indicate that, indeed, a trade-off can be made between the robustness of the online updating and the final parameter accuracy.  more » « less
Award ID(s):
1839833
NSF-PAR ID:
10309685
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Journal of Low Frequency Noise, Vibration and Active Control
Volume:
40
Issue:
4
ISSN:
1461-3484
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. This article presents an online parameter identification scheme for advection-diffusion processes using data collected by a mobile sensor network. The advection-diffusion equation is incorporated into the information dynamics associated with the trajectories of the mobile sensors. A constrained cooperative Kalman filter is developed to provide estimates of the field values and gradients along the trajectories of the mobile sensors so that the temporal variations in the field values can be estimated. This leads to a co-design scheme for state estimation and parameter identification for advection-diffusion processes that is different from comparable schemes using sensors installed at fixed spatial locations. Using state estimates from the constrained cooperative Kalman filter, a recursive least-square (RLS) algorithm is designed to estimate unknown model parameters of the advection-diffusion processes. Theoretical justifications are provided for the convergence of the proposed cooperative Kalman filter by deriving a set of sufficient conditions regarding the formation shape and the motion of the mobile sensor network. Simulation and experimental results show satisfactory performance and demonstrate the robustness of the algorithm under realistic uncertainties and disturbances. 
    more » « less
  2. In this paper, a constrained cooperative Kalman filter is developed to estimate field values and gradients along trajectories of mobile robots collecting measurements. We assume the underlying field is generated by a polynomial partial differential equation with unknown time-varying parameters. A long short-term memory (LSTM) based Kalman filter, is applied for the parameter estimation leveraging the updated state estimates from the constrained cooperative Kalman filter. Convergence for the constrained cooperative Kalman filter has been justified. Simulation results in a 2-dimensional field are provided to validate the proposed method. 
    more » « less
  3. To perform power system monitoring and control using synchrophasor measurements, various dynamic state estimators have been proposed in the literature, including the extended Kalman filter (EKF) and the unscented Kalman filter (UKF). However, they are unable to handle system model parameter errors and any type of outliers, precluding them from being adopted for power system real-time applications. In this paper, we develop a robust iterated extended Kalman filter based on the generalized maximum likelihood approach (termed GM-IEKF) for dynamic state estimation. The proposed GM-IEKF can effectively suppress observation and innovation outliers, which may be induced by model parameter gross errors and cyber attacks. We assess its robustness by carrying out extensive simulations on the IEEE 39-bus test system. From the results, we find that the GM-IEKF is able to cope with at least 25% outliers, including in position of leverage. 
    more » « less
  4. null (Ed.)
    We discuss a novel method to train a neural network from noisy data, using Optimal Transport based filtering. We show a comparative study of this methodology with three other filters: the Extended Kalman filter, the Ensemble Kalman filter, and the Unscented Kalman filter, that can also be used for the purpose of training a neural network. We empirically establish that Optimal Transport based filter performs better than the other three filters with respect to root mean square error measure, for non-Gaussian noise in the output. We demonstrate the efficacy of utilizing the Optimal Transport based filtering for neural network training in the context of predicting Mackey-Glass chaotic time series data. 
    more » « less
  5. Motivated by real-world applications with intermittent sensor data, an extended Kalman filter is formulated as a hybrid system and constructive conditions on its parameters guaranteeing an asymptotic stability property are provided. The dynamical properties of the estimation error are first characterized infinitesimally so to yield bounds on the rate of convergence and overshoot that depend on the parameters. By recasting the problem as the stabilization of a compact set, robustness properties of the proposed algorithm in the presence of disturbances in the system dynamics as well as measurement noise in the output are established. The proposed strategy is applied to spacecraft relative motion control with position-only measurements. 
    more » « less