arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.03430math.OC
收藏

基于组合学的双线性系统可控性表征方法

Combinatorics-Based Approaches to Controllability Characterization for Bilinear Systems

Washington University, St. Louis(华盛顿大学)

Gong Cheng, Wei Zhang, Jr-Shin Li

AI总结:

针对双线性系统可控性分析多依赖李代数秩条件的问题,提出基于组合学的表征方法,通过置换、图表示向量场与李括号,结合李代数分解与表示论,实现半单、约化李代数下双线性系统的可控性表征。

摘要:

数十年来,双线性系统的控制因其在科学与工程各学科的广泛应用,在系统与控制领域受到了广泛关注。尽管已有大量工作分析可控性性质,但最常用的工具仍是李代数秩条件。本文提出基于组合学理论与技术的替代方法,用于研究双线性系统的可控性。该方法的核心思想是用置换或图表示双线性系统的向量场,从而将李括号分别表示为置换乘法或图运算。基于这些表示,我们推导了双线性系统可控性的组合学表征,进而为对称群和图论在控制理论中的应用提供了新方向。此外,所提出的组合学方法与李代数分解(包括Cartan分解和非交织分解)兼容。这种兼容性使得可以利用表示论分析可控性,从而让我们能够表征由半单李代数和约化李代数支配的双线性系统的可控性性质。

英文摘要:

The control of bilinear systems has attracted considerable attention in the field of systems and control for decades, owing to their prevalence in diverse applications across science and engineering disciplines. Although much work has been conducted on analyzing controllability properties, the mostly used tool remains the Lie algebra rank condition. In this paper, we develop alternative approaches based on theory and techniques in combinatorics to study controllability of bilinear systems. The core idea of our methodology is to represent vector fields of a bilinear system by permutations or graphs, so that Lie brackets are represented by permutation multiplications or graph operations, respectively. Following these representations, we derive combinatorial characterization of controllability for bilinear systems, which consequently provides novel applications of symmetric group and graph theory to control theory. Moreover, the developed combinatorial approaches are compatible with Lie algebra decompositions, including the Cartan and non-intertwining decomposition. This compatibility enables the exploitation of representation theory for analyzing controllability, which allows us to characterize controllability properties of bilinear systems governed by semisimple and reductive Lie algebras.

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

↑