关联矩阵
数学
图形
多智能体系统
基质(化学分析)
入射(几何)
控制系统
状态空间
树(集合论)
控制(管理)
控制理论(社会学)
计算机科学
拓扑(电路)
离散数学
组合数学
人工智能
物理
工程类
电气工程
材料科学
复合材料
几何学
量子力学
统计
节点(物理)
作者
Dimos V. Dimarogonas,Karl Henrik Johansson
出处
期刊:Automatica
[Elsevier]
日期:2010-04-01
卷期号:46 (4): 695-700
被引量:241
标识
DOI:10.1016/j.automatica.2010.01.012
摘要
The spectral properties of the incidence matrix of the communication graph are exploited to provide solutions to two multi-agent control problems. In particular, we consider the problem of state agreement with quantized communication and the problem of distance-based formation control. In both cases, stabilizing control laws are provided when the communication graph is a tree. It is shown how the relation between tree graphs and the null space of the corresponding incidence matrix encode fundamental properties for these two multi-agent control problems.
科研通智能强力驱动
Strongly Powered by AbleSci AI