2022
DOI: 10.48550/arxiv.2203.16438
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Accelerated Performance and Accelerated Learning with Discrete-Time High-Order Tuners

Abstract: We consider two algorithms that have been shown to have accelerated performance, Polyak's heavy ball method and Nesterov's acceleration method. In the context of adaptive control, we show that both algorithms will present accelerated learning phenomenon under persistent excitation. Simulation results show that the two algorithms have very similar behavior and are both faster than normalized gradient descent.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 6 publications
(10 reference statements)
0
2
0
Order By: Relevance
“…To the authors' knowledge, ours is the first paper to apply a high-order tuner to adaptive control in discrete time. Our paper complements [19], which establishes parameter learning for identification problems in discrete-time dynamical systems with persistent excitation.…”
Section: Introductionmentioning
confidence: 91%
See 1 more Smart Citation
“…To the authors' knowledge, ours is the first paper to apply a high-order tuner to adaptive control in discrete time. Our paper complements [19], which establishes parameter learning for identification problems in discrete-time dynamical systems with persistent excitation.…”
Section: Introductionmentioning
confidence: 91%
“…In the remainder of this section, we propose a new general algorithm for this adaptive control problem, based on results in [13] for system identification. In Section IV, we then propose the addition of the high-order tuner developed in [8], [19] as a particular adaptive law.…”
Section: Problem Settingmentioning
confidence: 99%