Loading [a11y]/accessibility-menu.js
Continuous Twisting Algorithm | IEEE Conference Publication | IEEE Xplore

Continuous Twisting Algorithm


Abstract:

We propose a continuous homogeneous generalization of the Twisting Algorithm. The part of the algorithm ensuring the compensation of the perturbation has the structure of...Show More

Abstract:

We propose a continuous homogeneous generalization of the Twisting Algorithm. The part of the algorithm ensuring the compensation of the perturbation has the structure of the Twisting algorithm so that we call it Continuous Twisting Algorithm (CTA). For a system with relative degree two and a Lipschitz perturbation CTA provides finite-time convergence to the origin for the output and its first derivative. Moreover, CTA also guarantees the finite-time convergence of the control signal to the uncertainties. The convergence is proved using a smooth strict homogeneous Lyapunov function. The positiveness of the proposed Lyapunov function and the negativeness of its derivative are verified using a method based on Pólya's Theorem.
Date of Conference: 15-18 December 2015
Date Added to IEEE Xplore: 11 February 2016
ISBN Information:
Conference Location: Osaka, Japan

Contact IEEE to Subscribe

References

References is not available for this document.