arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.09143eess.SYcs.SYmath.OC
收藏

通过子控制李雅普诺夫函数降低实时复杂度:从理论到实验

Reducing real-time complexity via sub-control Lyapunov functions: from theory to experiments

Huu-Thinh Do, Franco Blanchini, Stefano Miani, Ionela Prodan

AI总结:

本文提出子控制李雅普诺夫函数(SCLF)方法,通过离线线性规划求解替代反馈,在保证稳定性的同时大幅降低在线实时计算复杂度,并以无人机控制仿真与实验验证其有效性。

摘要:

设计控制李雅普诺夫函数(CLF)以及适当的镇定反馈(可能在存在约束的情况下)的技术,往往提供的控制律过于复杂,难以在线正确实现,尤其是在涉及优化问题时。在这项工作中,我们展示了如何获得一种替代性的、计算上更具吸引力的反馈。给定一个标称 CLF 和一个标称状态反馈,如果另一个正定函数的李雅普诺夫导数负定,并且以标称函数在标称控制下的李雅普诺夫导数为上界,则我们称该正定函数为子控制李雅普诺夫函数(SCLF)。结果表明,如果我们考虑一组基函数,那么可以通过具有无限多个约束的线性规划来计算 SCLF。其思想是,尽管获得新控制器并求解该线性规划的离线计算负担相当大,但在线计算负担却大幅降低。我们在无人机控制上进行了全面的仿真和实验,以证明该研究的有效性。

英文摘要:

The techniques to design control Lyapunov functions (CLF), along with a proper stabilizing feedback, possibly in the presence of constraints, often provide control laws that are too complex for proper implementation online, especially when an optimization problem is involved. In this work, we show how to acquire an alternative, computationally attractive feedback. Given a nominal CLF and a nominal state feedback, we say that a different positive definite function is a Sub-control Lyapunov function (SCLF) if its Lyapunov derivative is negative-definite and bounded above by the Lyapunov derivative of the nominal function with the nominal control. It turns out that if we consider a family of basis functions, then a SCLF can be computed by linear programming, with an infinite number of constraints. The idea is that although the offline computational burden to achieve the new controller and solve the linear program is considerable, the online computational burden is drastically reduced. Comprehensive simulations and experiments on drone control are conducted to demonstrate the effectiveness of the study.

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

↑