Homeomorphism Mapping Based Neural Networks for Finite Time Constraint Control of a Class of Nonaffine Pure-Feedback Nonlinear Systems

Complexity 2019:1-11 (2019)
  Copy   BIBTEX

Abstract

In this study, an accurate convergence time of the supertwisting algorithm 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 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.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,888

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2019-05-14

Downloads
21 (#1,004,296)

6 months
5 (#1,038,502)

Historical graph of downloads
How can I increase my downloads?