基于模板提升的路径完备李雅普诺夫函数比较
Comparison of Path-Complete Lyapunov Functions via Template-Dependent Lifts
摘要:
本文研究了离散时间切换系统中路径完全稳定性证明的比较问题。我们介绍和研究抽象操作的路径完全图,称为电梯,这使我们能够恢复以前的结果在一个一般的框架。此外,这种方法突出了所选择的一组候选李雅普诺夫函数(模板)的分析性质和某些升降机的容许性之间的现有关系。这提供了一种新的方法,当选择一个特定的模板的路径完全李雅普诺夫函数的顺序关系的标准的表征。我们将我们的研究结果应用到特定的模板,特别是原始和双重的共同规范,提供新的稳定性证书的积极切换系统。这些工具最后说明的目的是数值例子。
英文摘要:
This paper investigates, in the context of discrete-time switching systems, the problem of comparison for path-complete stability certificates. We introduce and study abstract operations on path-complete graphs, called lifts, which allow us to recover previous results in a general framework. Moreover, this approach highlights the existing relations between the analytical properties of the chosen set of candidate Lyapunov functions (the template) and the admissibility of certain lifts. This provides a new methodology for the characterization of the order relation of path-complete Lyapunov functions criteria, when a particular template is chosen. We apply our results to specific templates, notably the sets of primal and dual copositive norms, providing new stability certificates for positive switching systems. These tools are finally illustrated with the aim of numerical examples.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。