Abstract
The chapter presents an analysis framework for a class of dynamic composite networks. These networks are formed from smaller factor networks via graph Cartesian products. We provide a composition method for extending the controllability and observability of the factor networks to that of the composite network. We then delve into the effectiveness of designing control and estimation algorithms for the composite network via symmetry in the network. Examples and applications are provided throughout the chapter to demonstrate the results including a distributed output feedback stabilizer and a social network application.
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
Notes
- 1.
Here we assume that if there is no edge \(\left (i,j\right ) \in E\) then w ji = 0.
References
M. Mesbahi and M. Egerstedt, Graph Theoretic Methods in Multiagent Networks. Princeton: Princeton University Press, 2010.
C. Godsil, “Controllability on networks,” 2009. [Online]. Available: http://quoll.uwaterloo.ca/mine/Talks/control.pdf
C. Godsil, “Quantum physics and graph spectra,” 2009. [Online]. Available: http://quoll.uwaterloo.ca/mine/Talks/bristol.pdf
H. Tanner, “On the controllability of nearest neighbor interconnections,” in 43rd IEEE Conference on Decision and Control, 2004, pp. 2467–2472.
M. Nabi-Abdolyousefi and M. Mesbahi, “On the controllability properties of circulant networks,” IEEE Transactions on Automatic Control, vol. 58, no. 12, pp. 3179–3184, 2013.
G. Parlangeli and G. Notarstefano, “Observability and reachability of grid graphs via reduction and symmetries,” in Proc. 50th IEEE Conference on Decision and Control, 2011, pp. 5923–5928.
M. Nabi-Abdolyousefi and M. Mesbahi, “System theory over random consensus networks: controllability and optimality properties,” in Proc. 50th IEEE Conference on Decision and Control, 2011, pp. 2323–2328.
S. Zhang, M. Camlibel, and M. Cao, “Controllability of diffusively-coupled multi-agent systems with general and distance regular coupling topologies,” in Proc. 50th IEEE Conference on Decision and Control, 2011, pp. 759–764.
Y.-Y. Liu, J.-J. Slotine, and A.-L. Barabási, “Controllability of complex networks,” Nature, vol. 473, no. 7346, pp. 167–73, May 2011.
T. Kailath, Linear Systems. Upper Saddle River: Prentice Hall, 1979.
D. L. Boutin, “The determining number of a Cartesian product,” Journal of Graph Theory, vol. 61, no. 2, pp. 77–87, Jun. 2009.
N. E. Friedkin and E. C. Johnson, “Influence networks and opinion change,” Advances in Group Processes, vol. 16, no. 1, pp. 1–29, 1999.
J. F. Padgett, “Marriage and elite structure in renaissance Florence, 1282–1500,” in Paper delivered to the Social Science History Association, 1994.
A. Chapman, M. Nabi-Abdolyousefi, and M. Mesbahi, “Identification and infiltration in consensus-type networks,” in 1st IFAC Workshop on Estimation and Control of Networked Systems, 2009, pp. 84–89.
A. Chapman, M. Nabi-Abdolyousefi, and M. Mesbahi, “Controllability and observability of networks-of-networks via Cartesian products,” IEEE Transactions on Automatic Control, vol. 59, no. 10, pp. 2668–2679, 2014.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Chapman, A. (2015). Controllability and Observability of Cartesian Product Networks. In: Semi-Autonomous Networks. Springer Theses. Springer, Cham. https://doi.org/10.1007/978-3-319-15010-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-15010-9_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15009-3
Online ISBN: 978-3-319-15010-9
eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)