基于类二次型Lyapunov函数的Super-twisting算法收敛性分析  

Convergence of Super-twisting algorithm based on quadratic-like Lyapunov function

作　　者：李鹏[1] 郑志强[1] 

机构地区：[1]国防科技大学机电工程与自动化学院,长沙410073

出　　处：《控制与决策》2011年第6期949-952,共4页Control and Decision

基　　金：国家自然科学基金项目(60374006)

摘　　要：基于非光滑的类二次型Lyapunov函数,对二阶滑模Super-twisting算法的有限时间收敛性进行了分析.当系统受常值干扰时,通过Lyapunov方程证明了该算法有限时间收敛,并给出了收敛时间的最优估计;当系统受时变干扰时,通过求解代数Riccati方程得出了一组保证该算法有限时间收敛的参数取值范围,并给出了收敛时间的估计值.仿真算例表明了理论分析的正确性.The finite time convergence of the second order sliding Super-twisting algorithm is analyzed by using a non- smooth quadratic-like Lyapunov function. For the constant disturbance, the finite time convergence is proved through Lyapunov equation, and the optimal estimation of the convergence time is presented. For the time varying disturbance, the finite time convergence of Super-twisting is guaranteed when the parameters satisfy the algebraic Riccati equation, and the estimation of the convergence time is provided. Finally, simulation results show the correction of the theoretical analysis.

关 键 词：类二次型Lyapunov函数 Super-twisting算法 有限时间收敛 

分 类 号：TP273[自动化与计算机技术—检测技术与自动化装置]