On state-dependent dynamic graphs and their controllability properties

被引：102

作者：

Mesbahi, M ^{[1
]}

机构：

[1] Univ Washington, Dept Aeronaut & Astronaut, Seattle, WA 98195 USA

来源：

IEEE TRANSACTIONS ON AUTOMATIC CONTROL | 2005年 / 50卷 / 03期

关键词：

dynamic graphs; graph controllability; state-dependent graphs; Szemeredi's regularity;

D O I：

10.1109/TAC.2005.843858

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We consider distributed dynamic systems operating over a graph or a network. The geometry of the network is assumed to be a function of the underling system's states-giving it a unique dynamic character. Certain aspects of the resulting abstract structure, having a mixture of combinatorial and system theoretic features, are then studied. In this venue, we will explore an interplay between notions from extremal graph theory and system theory by considering a controllability framework for such state-dependent dynamic graphs.

引用

页码：387 / 392

页数：6

共 19 条

[1] AIZERMAN MA, 1987, TOPICS GEN THEORY ST
[2] BEARD RW, 1998, IEEE T CONTR SYST T, V6, P777
[3] Bollobas B., 1986, Combinatorics: set systems, hypergraphs, families of vectors, and combinatorial probability
[4] Bollobas B., 1998, Modern graph theory
[5] Boyd S., 1994, LINEAR MATRIX INEQUA
[6] Diestel R., 2000, GRAPH THEORY
[7] Erdos P., 1936, J LOND MATH SOC, V11, P261
[8] Information flow and cooperative control of vehicle formations
Fax, JA
Murray, RM
[J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2004, 49 (09) : 1465 - 1476
[9] Godsil C., 2001, ALGEBRAIC GRAPH THEO
[10] Graham R.L., 1995, Handbook of Combinatorics, VVolume 2

← 1 2 →