Recursive nuclear norm based subspace identification

Conference Paper (2017)
Author(s)

B. Telsang (Student TU Delft)

S. T. Navalkar (TU Delft - Team Raf Van de Plas)

J.W. Wingerden (TU Delft - Team Jan-Willem van Wingerden)

Research Group
Team Jan-Willem van Wingerden
Copyright
© 2017 B. Telsang, S.T. Navalkar, J.W. van Wingerden
DOI related publication
https://doi.org/10.1016/j.ifacol.2017.08.1585
More Info
expand_more
Publication Year
2017
Language
English
Copyright
© 2017 B. Telsang, S.T. Navalkar, J.W. van Wingerden
Research Group
Team Jan-Willem van Wingerden
Volume number
50-1
Pages (from-to)
9490-9495
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Nuclear norm based subspace identification methods have recently gained importance due to their ability to find low rank solutions while maintaining accuracy through convex optimization. However, their heavy computational burden typically precludes the use in an online, recursive manner, such as may be required for adaptive control. This paper deals with the formulation of a recursive version of a nuclear norm based subspace identification method with an emphasis on reducing the computational complexity. The developed methodology is analyzed through simulations on Linear Time-Varying (LTV) systems particularly in terms of convergence rate, tracking speed and the accuracy of identification and it is shown to be computationally lighter and effective for such systems, with the considered rate of change of dynamics.

Files

License info not available