arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2610.14285eess.SYcs.SYmath.OC
收藏

齐次超扭转算法的过零时间下界

Zero-Crossing Time Lower Bounds for the Homogeneous Super-Twisting Algorithm

IMSIA (UMR 9219), CNRS, EDF, CEA, ENSTA Paris, Institut Polytechnique de Paris(巴黎理工学院);ENSTA Paris(ENSTA巴黎学院)

Diego Gutiérrez-Oribio, Ioannis Stefanou

AI总结:

本文针对标量齐次超扭转算法,推导了其过零时间下界,明确了过零累积的条件,数值模拟验证了结果,为滑模控制中过零现象的分析提供了理论依据。

摘要:

高频切换与抖振是滑模控制中众所周知的问题。尽管超扭转算法能产生连续的控制输入,但滑模变量仍可能在滑模流形附近反复过零。本文研究标量齐次超扭转算法中这些过零现象的发生速度,以及它们是否会在有限时间内累积。推导了返回零所需时间的两个下界,以及完成一次完整偏移所需时间的界。这些结果给出了最小间隔时间,以及与超过规定振幅的偏移相关的过零次数的上界。尽管过零可能在有限时间内累积,但本文考虑的完整偏移的振幅必须趋于零并满足可和条件,因此,与超过任何规定非零振幅的偏移相关的过零不会在有限时间内累积。当扰动率界为零时,这些估计恢复齐次性施加的尺度;对于经典超扭转算法,该平方根尺度在非零扰动率界下也成立。数值模拟验证了这些结果。

英文摘要:

High-frequency switching and chattering are well-known problems in sliding-mode control. Although the super-twisting algorithm produces a continuous control input, the sliding variable may still cross zero repeatedly near the sliding manifold. This paper studies how fast these crossings can occur and whether they can accumulate in finite time for the scalar homogeneous super-twisting algorithm. Two lower bounds on the time required to return to zero are derived, together with a bound on the time needed to complete a full excursion. These results give minimum separation times and upper bounds on the number of crossings associated with excursions above a prescribed amplitude. Although zero crossings may accumulate in finite time, the amplitudes of the complete excursions considered here must vanish and satisfy a summability condition. Thus, crossings associated with excursions above any prescribed nonzero amplitude cannot accumulate in finite time. When the perturbation-rate bound is zero, the estimates recover the scaling imposed by homogeneity. For the classical super-twisting algorithm, the square-root scaling also holds for nonzero perturbation-rate bounds. Numerical simulations illustrate the results.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑