Pith. sign in

REVIEW

Nonlinear Discrete-time System Identification without Persistence of Excitation: Finite-time Concurrent Learning Methods

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2112.07765 v2 pith:W3SYKVUZ submitted 2021-12-14 eess.SY cs.LGcs.SYmath.OC

classification eess.SYcs.LGcs.SYmath.OC
keywords finite-timediscrete-timelearningmethodsconcurrentdataexcitationnonlinear
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

This paper deals with the problem of finite-time learning for unknown discrete-time nonlinear systems' dynamics, without the requirement of the persistence of excitation. Two finite-time concurrent learning methods are presented to approximate the uncertainties of the discrete-time nonlinear systems in an online fashion by employing current data along with recorded experienced data satisfying an easy-to-check rank condition on the richness of the recorded data which is less restrictive in comparison with persistence of excitation condition. For the proposed finite-time concurrent learning methods, rigorous proofs guarantee the finite-time convergence of the estimated parameters to their optimal values based on the discrete-time Lyapunov analysis. Compared with the existing work in the literature, simulation results illustrate that the proposed methods can timely and precisely approximate the uncertainties.

Discussion (0). Continue with ORCID to comment.

Pith tools