Convergence Time Calculation for Supertwisting Algorithm and Application for Nonaffine Nonlinear Systems

Jianhua Zhang, Quanmin Zhu and Yang Li

Complexity, 2019, vol. 2019, 1-15

Abstract:

In this study, an accurate convergence time of the supertwisting algorithm (STA) is proposed to build up a framework for nonaffine nonlinear systems’ finite-time control. The convergence time of the STA is provided by calculating the solution of a differential equation instead of constructing Lyapunov function. Therefore, precise convergence time is presented instead of estimation of the upper bound of the algorithm’s reaching time. Regardless of affine or nonaffine nonlinear systems, supertwisting control (STC) provides a general solution based on virtual control law skill ensuring the output of the systems converges to the origin point at exact time. Benchmark tests are simulated to demonstrate the effectiveness and efficiency of the algorithm.

Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2019/6235190.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2019/6235190.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:6235190

DOI: 10.1155/2019/6235190

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().