[论文解读] Decentralized Formation Control Part I: Geometric Aspects

Mohamed-Ali Belabbas|arXiv (Cornell University)|Jan 12, 2011

Distributed Control Multi-Agent Systems参考文献 14被引用 7

一句话总结

本文利用几何控制理论研究多智能体系统中的去中心化构型控制，表明具有有向信息流的最小刚性图无法保证全局稳定性，这是由于配置空间中的拓扑约束所致。研究建立n个智能体在平面上的构型空间微分同胚于CP(n−2) × (0,∞)，揭示了非平凡拓扑如何影响基于距离的控制及刚性变换下的不变性。

ABSTRACT

In this paper, we develop new methods for the analysis of decentralized control systems and we apply them to formation control problems. The basic set-up consists of a system with multiple agents corresponding to the nodes of a graph whose edges encode the information that is available to the agents. We address the question of whether the information flow defined by the graph is sufficient for the agents to accomplish a given task. Formation control is concerned with problems in which agents are required to stabilize at a given distance from other agents. In this context, the graph of a formation encodes both the information flow and the distance constraints, by fixing the lengths of the edges. A formation is said to be rigid if it cannot be continuously deformed with the distance constraints satisfied; a formation is minimally rigid if no distance constraint can be omitted without the formation losing its rigidity. Hence, the graph underlying minimally rigid formation provides just enough constraints to yield a rigid formation. An open question we will settle is whether the information flow afforded by a minimally rigid graph is sufficient to insure global stability. We show that the answer is negative in the case of directed information flow. In this first part, we establish basic properties of formation control in the plane. Formations and the associated control problems are defined modulo rigid transformations. This fact has strong implications on the geometry of the space of formations and on the feedback laws, since they need to respect this invariance. We study both aspects here. We show that the space of frameworks of n agents is CP(n-2) x (0,\infty). We then illustrate how the non-trivial topology of this space relates to the parametrization of the formation by inter-agent distances.

研究动机与目标

• 分析在去中心化信息流下多智能体系统构型控制空间的几何结构。
• 确定具有有向通信的最小刚性图是否能确保构型控制中的全局稳定性。
• 理解刚性变换下的不变性如何塑造配置空间并影响反馈设计。
• 利用复射影几何表征平面上n个智能体构型的空间。
• 识别阻止有向信息流环境下全局收敛的拓扑障碍。

提出的方法

• 将构型建模为图上的框架，其中边长代表智能体间距离约束。
• 使用微分几何证明n个智能体的配置空间微分同胚于CP(n−2) × (0,∞)。
• 分析刚性变换不变性对反馈控制律的影响，要求其在SO(2) × R²下保持不变。
• 应用优化与控制理论工具研究保持距离的动力学系统的稳定性。
• 使用拓扑论证证明有向最小刚性图无法确保全局收敛。
• 表征CP(n−2)中非平凡拓扑在阻碍有向信息流下全局稳定性中的作用。

实验结果

研究问题

• RQ1 具有有向信息流的最小刚性图能否在去中心化构型控制中保证全局稳定性？
• RQ2 在距离约束下，平面上n个智能体构型空间的拓扑结构是什么？
• RQ3 刚性变换下的不变性如何约束去中心化控制律的设计？
• RQ4 为何尽管约束充足，有向信息流仍无法保证全局收敛？
• RQ5 复射影空间CP(n−2)在参数化构型配置中起什么作用？

主要发现

• 平面上n个智能体构型的空间微分同胚于CP(n−2) × (0,∞)，揭示了非平凡的拓扑结构。
• CP(n−2)的非平凡拓扑在有向信息流下阻碍了构型控制的全局收敛。
• 即使满足所有距离约束，具有有向边的最小刚性图也无法确保全局稳定性。
• 反馈律必须尊重刚性变换下的不变性，这限制了其设计并削弱了全局收敛特性。
• 当n ≥ 4时，模去刚性运动的框架空间不是单连通的，导致拓扑障碍。
• 有向信息流无法在配置空间中提供足够的连通性以保证全局稳定性。