Relaxation of Conditions for Convergence of Dynamic Regressor Extension and Mixing Procedure
Anton Glushchenko, Konstantin Lastochkin

TL;DR
This paper generalizes the dynamic regressor extension and mixing procedure, ensuring faster convergence and exponential tracking error reduction under less restrictive excitation conditions.
Contribution
It introduces a generalized method that guarantees parameter error reduction and exponential convergence with relaxed excitation requirements.
Findings
Guarantees parameter error reduction with semi-finite excitation.
Ensures exponential convergence with semi-persistent excitation.
Applicable to regressors with rank one or higher.
Abstract
A generalization of the dynamic regressor extension and mixing procedure is proposed, which, unlike the original procedure, first, guarantees a reduction of the unknown parameter identification error if the requirement of regressor semi-finite excitation is met, and second, it ensures exponential convergence of the regression function (regressand) tracking error to zero when the regressor is semi-persistently exciting with a rank one or higher.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFault Detection and Control Systems · Control Systems and Identification · Target Tracking and Data Fusion in Sensor Networks
