Super-twisting-like algorithm in discrete time nonlinear systems

I. Salgado, S. Kamal, I. Chairez, B. Bandyopadhyay, L. Fridman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

29 Scopus citations

Abstract

A new discrete time super-twisting-like second order sliding mode algorithm (DSTA) is proposed. The stability proof of the suggested scheme is analyzed in terms of the discrete Lyapunov approach and Linear Matrix Inequalities (LMI) theory. Using these two tools it is proved that, system state trajectory is ultimately bounded in finite time. The state estimation problem for a class of second order discrete time system has been proposed to show the positive settings obtained from the algorithm introduced here. Also, the ultimate boundedness of the estimation error is demonstrated despite the presence of bounded perturbations. Simulation results illustrates the efficacy of this new discrete-time algorithm.

Original languageEnglish
Title of host publication2011 International Conference on Advanced Mechatronic Systems, ICAMechS 2011 - Final Program
Pages497-502
Number of pages6
StatePublished - 2011
Event2011 International Conference on Advanced Mechatronic Systems, ICAMechS 2011 - Zhengzhou, China
Duration: 11 Aug 201113 Aug 2011

Publication series

Name2011 International Conference on Advanced Mechatronic Systems, ICAMechS 2011 - Final Program

Conference

Conference2011 International Conference on Advanced Mechatronic Systems, ICAMechS 2011
Country/TerritoryChina
CityZhengzhou
Period11/08/1113/08/11

Keywords

  • Discrete-time super-twisting algorithm
  • discrete sliding mode
  • quasi-sliding mode

Fingerprint

Dive into the research topics of 'Super-twisting-like algorithm in discrete time nonlinear systems'. Together they form a unique fingerprint.

Cite this