Composite adaptive backstepping control considering computational complexity and relaxation of persistent excitation

Date published

2020-11

Free to read from

Supervisor/s

Journal Title

Journal ISSN

Volume Title

Publisher

Elsevier

Department

Type

Article

ISSN

2405-8963

Format

Citation

Jeon B-J, Shin H-Y, Tsourdos A. (2020) Composite adaptive backstepping control considering computational complexity and relaxation of persistent excitation. IFAC-PapersOnLine, Volume 53, Issue 2, pp. 3767-3772

Abstract

A new composite adaptive backstepping control is proposed in this paper, which achieves parameter estimation convergence without persistent excitation and reduces estimation problem dimension for less computational complexity. A composite adaptation law is utilized to improve estimation and tracking performance. Relaxation of the persistent excitation requirement for parameter convergence is accomplished by making information matrix full rank only with finite excitation. The adaptation law for the proposed composite adaptive backstepping control algorithm estimates parameters in each loop separately by taking an advantage from a cascade control structure of backstepping control. Comparing to the adaptation laws which estimate whole parameters of the dynamic system at once, the designed adaptation law deals with smaller estimation problems, resulting in reduced computational complexity.

Description

Software Description

Software Language

Github

Keywords

Backstepping Control, Composite Adaptive Control, Finite Excitation, Persistent Excitation, Cascade Control Structure, Computational Complexity

DOI

Rights

Attribution-NonCommercial-NoDerivatives 4.0 International

Relationships

Relationships

Supplements

Funder/s