Abstract
In this section, we examine the problem of identifying the interaction geometry among a known number of agents, adopting a consensus-type algorithm for their coordination.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
M. Nabi-Abdolyousefi, M. Mesbahi, A sieve method for consensus-type network tomography. IET Control Theory Appl. 6(12), 1926–1932 (2012)
L.E. Dickson, History of the Theory of the Numbers, Volume II, Diophantine Analysis (Chelsea Publishing Company, New York, 1971)
M. Nabi-Abdolyousefi, M. Mesbahi, Network identification via node knock-out. IEEE Trans. Autom. Control 57(12), 3214–3219 (2012)
R.A. Horn, C.R. Johnson, Matrix Analysis (Cambridge University Press, Cambridge, 1994)
B. Craven, Complex symmetric matrices. J. Aust. Math. Soc. 10(3–4), 341–354 (1969)
N.J. Higham, Computing a nearest symmetric positive semidefinite matrix. Linear Algebra Appl. 103(6), 103–118 (1988)
N.J. Higham, Matrix Nearness Problems and Applications (Oxford University Press, Oxford, 1989)
G.W. Stewart, J. Sun, Matrix Perturbation Theory (Academic Press Inc, New York, 1990)
IBM ilog cplex optimization studio, http://www-01.ibm.com/software/integration/optimization/cplex-optimization-studio/
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Nabi-Abdolyousefi, M. (2014). Network Identification via Graph Realization. In: Controllability, Identification, and Randomness in Distributed Systems. Springer Theses. Springer, Cham. https://doi.org/10.1007/978-3-319-02429-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-02429-5_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-02428-8
Online ISBN: 978-3-319-02429-5
eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)