© The Institution of Engineering and Technology
In this note, the authors examine the problem of identifying the interaction geometry among a known number of agents, adopting a consensus-type algorithm for their coordination. The proposed identification process is facilitated by introducing ‘ports’ for stimulating a subset of network vertices via an appropriately defined interface and observing the network’s response at another set of vertices. It is first noted that under the assumption of controllability and observability of corresponding steered-and-observed network, the proposed procedure identifies a number of important features of the network using the spectrum of the graph Laplacian. The authors then proceed to use degree-based graph reconstruction methods to propose a sieve method for further characterisation of the underlying network. An example demonstrates the application of the proposed method.
References
-
-
1)
-
M. Mesbahi ,
M. Egerstedt
.
(2010)
Graph theoretic methods for multi-agent networks.
-
2)
-
C.I.D. Genio ,
H. Kim ,
Z. Toroczkai ,
K.E. Bassler
.
(2010)
Efficient and exact sampling of simple graphs with given arbitrary degree sequence.
-
3)
-
P.L. Erdos ,
I. Miklos ,
Z. Toroczkai
.
(2010)
A simple Havel–Hakimi type algorithm to realize graphical degree sequences of directed graphs.
-
4)
-
R. Horn ,
C. Johnson
.
(1985)
Matrix analysis.
-
5)
-
D.B. West
.
(1996)
Introduction to graph theory.
-
6)
-
Nabi-Abdolyousefi, M., Mesbahi, M.: `Network identification via node knock-out (can one hear the shape of the coordination?', Forty-ninth IEEE Conf. Decision, December 2010, Atlanta.
-
7)
-
E.B. Curtis ,
J.A. Morrow
.
(2000)
Inverse problems for electrical networks.
-
8)
-
B. Mohar
.
The Laplacian spectrum of graphs.
Graph Theory Comb. Appl.
,
871 -
898
-
9)
-
M. Kac
.
Can one hear the shape of a drum?.
Am. Math. Mon.
,
4 ,
1 -
23
-
10)
-
L.E. Dickson
.
(1971)
History of the theory of the numbers, volume II, diophantine analysis.
-
11)
-
M. Bona
.
(2002)
A walk through combinatorics.
-
12)
-
Godsil, C.D.: “Controllability on networks”, http://quoll.uwaterloo.ca/.
-
13)
-
H. Kim ,
Z. Toroczkai ,
P.L. Erdos ,
I. Miklos ,
L.A. Szekely
.
Degree-based graph construction.
J. Phys. A, Math. Theor.
,
39
-
14)
-
S. Babaeizadeh ,
D. Brooks ,
D. Isaacson
.
3-d electrical impedance tomography for piecewise constant domains with known internal boundaries.
IEEE Trans. Biomed. Eng.
,
1 ,
2 -
10
-
15)
-
J. Mueller ,
S. Siltanen ,
D. Isaacson
.
A direct reconstruction algorithm for electrical impedance tomography.
IEEE Trans. Med. Imaging
,
6 ,
555 -
559
-
16)
-
T.C. Hsia
.
(1977)
System identification.
-
17)
-
Marques, O., Drummond, T., Vasco, D.: `A computational strategy for the solution of large linear inverse problems in geophysics', Parallel and Distributed Processing Symp., April 2003, p. 22–26.
-
18)
-
E.M. Reingold ,
J. Nievergelt ,
N. Deo
.
(1977)
Combinatorial algorithms: theory and practice.
-
19)
-
B. Gutkin ,
U. Smilansky
.
Can one hear the shape of a graph?.
J. Phys. A, Math. Gen.
,
6061 -
6068
-
20)
-
Y. Teranishi
.
The Hoffman number of a graph.
Discrete Math.
,
255 -
265
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-cta.2011.0096
Related content
content/journals/10.1049/iet-cta.2011.0096
pub_keyword,iet_inspecKeyword,pub_concept
6
6