Papers › Eigenvalue Mapping-based Discretization of the Generalized Super-Twisting Algorithm

Eigenvalue Mapping-based Discretization of the Generalized Super-Twisting Algorithm

8 Sep 2022arXiv:2209.03825archive 2025-07-28

Ningning Ding

In this paper, an eigenvalue mapping-based discretization method is applied to discretize the generalized super-twisting algorithm. The existing eigenvalue mapping is extended to the complex domain which greatly enlarges the range of parameter selection. Furthermore, we present the clue to find new eigenvalue mapping functions (EMFs). One new hybrid EMF and three brand-new EMFs are proposed in this paper. In contrast to the conventional methods, the proposed discretization method totally avoids the discretization chattering and the control precision is enhanced in terms of the steady-state error. Besides, the control precision is insensitive to the overestimation of the control gains, which benefits the gain tuning of the controller in practice. Simulation examples verify the effectiveness and superiority of the proposed discretization methodology.

PaperPDFCode

Code

hmx2013/gsta-discretization officialmentioned in papermentioned on GitHub report
hmx2013/semi-implicit-of-gsta officialmentioned in papermentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections