Sparsity penalties in dynamical system estimation

—In this work we address the problem of state estimation in dynamical systems using recent developments in compressive sensing and sparse approximation. We formulate the traditional Kalman filter as a one-step update optimization procedure which leads us to a more unified framework, useful for incorporating sparsity constraints. We introduce three combinations of two sparsity conditions (sparsity in the state and sparsity in the innovations) and write recursive optimization programs to estimate the state for each model. This paper is meant as an overview of different methods for incorporating sparsity into the dynamic model, a presentation of algorithms that unify the support and coefficient estimation, and a demonstration that these suboptimal schemes can actually show some performance improvements (either in estimation error or convergence time) over standard optimal methods that use an impoverished model.

• Type: Journal
• Year: 2011
• Where: CISS
• Authors: Adam Charles, Muhammad Salman Asif, Justin K. Romberg, Christopher Rozell
• Keywords: CISS 2011, Information Technology, Optimization Programs, Sparse Approximation, State Estimation