arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1412.6937eess.SYcs.SYmath.DS
收藏

基于三角化Laman图的编队控制

Formation Control with Triangulated Laman Graphs

University of Illinois at Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校)

Xudong Chen, M. -A. Belabbas, Tamer Basar

AI总结:

本文研究了基于三角化Laman图的编队控制问题,提出了一种控制方法,使得所有稳定平衡点均为目标配置,解决了编队控制中稳定平衡点问题。

摘要:

编队控制涉及设计去中心化的控制律以使智能体保持规定距离。我们称满足智能体间距离条件的配置为目标配置。已知当距离条件通过刚性图定义时,目标配置在模旋转和翻译下是有限的。因此,编队控制的目标可以重新表述为稳定一个或多个目标配置。主要问题是这些控制律也会有对应于不满足期望智能体间距离条件的平衡点,称为不期望的平衡点。如果这些不期望的平衡点也是稳定的,则会成为问题。设计去中心化的控制律,使其在一般刚性图情况下所有稳定的平衡点都是目标配置,仍是一个开放问题。本文提出了一种部分解决方案,通过展示一类刚性图和控制律,使得所有稳定的平衡点都是目标配置。

英文摘要:

Formation control deals with the design of decentralized control laws that stabilize agents at prescribed distances from each other. We call any configuration that satisfies the inter-agent distance conditions a target configuration. It is well known that when the distance conditions are defined via a rigid graph, there is a finite number of target configurations modulo rotations and translations. We can thus recast the objective of formation control as stabilizing one or many of the target configurations. A major issue is that such control laws will also have equilibria corresponding to configurations which do not meet the desired inter-agent distance conditions; we refer to these as undesired equilibria. The undesired equilibria become problematic if they are also stable. Designing decentralized control laws whose stable equilibria are all target configurations in the case of a general rigid graph is still an open problem. We propose here a partial solution to this problem by exhibiting a class of rigid graphs and control laws for which all stable equilibria are target configurations.

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

↑