On the reachability and observability of path and cycle graphs

IEEE Transactions on Automatic Control

Volumn 57, Issue 3, 2012, Pages 743-748

  Parlangeli, Gianfranco ^a   Notarstefano, Giuseppe ^a  

^a UNIVERSITY OF SALENTO   (Italy)

Author keywords

Consensus; controllability; Laplacian; observability

Indexed keywords

A-LAPLACIAN; AVERAGE CONSENSUS; CLOSED-FORM EXPRESSION; COMMUNICATION GRAPHS; CONSENSUS; CYCLE GRAPHS; EIGENVALUES; LAPLACIANS; NETWORK SYSTEMS; PATH GRAPHS; POWER-OF-TWO; PRIME NUMBER; REACHABILITY; SIMPLE RULES; SUFFICIENT CONDITIONS; TECHNICAL NOTES; UNOBSERVABLE;

CONTROLLABILITY; EIGENVALUES AND EIGENFUNCTIONS; LAPLACE TRANSFORMS; NUMBER THEORY; OBSERVABILITY;

GRAPH THEORY;

EID: 84857701201     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2011.2168912     Document Type: Article

References (19)

1. R. Olfati-Saber, J. A. Fax, and R. M. Murray, "Consensus and cooperation in networked multi-agent systems," Proc. IEEE, vol. 95, no. 1, pp. 215-233, Jan. 2007.
2. M. Mesbahi and M. Egerstedt, Graph Theoretic Methods in Multiagent Networks. Princeton, NJ: Princeton Univ. Press, 2010.
3. V. Gupta, "Distributed Estimation and Control in Networked Systems," Ph.D. dissertation, California Inst. Technol, Pasadena, 2006.
4. M. Farina, G. Ferrari-Trecate, and R. Scattolini, "A moving horizon scheme for distributed state estimation," in Proc. IEEE Conf. Decision Control, Shanghai, China, Dec. 2009, pp. 1818-1823.
5. F. Pasqualetti, A. Bicchi, and F. Bullo, "Consensus computation in unreliable networks: A system theoretic approach," IEEE Trans. Autom. Control, vol. 57, no. 1, pp. 90-104, Jan. 2012.
6. S. Sundaram and C. N. Hadjicostis, "Distributed function calculation via linear iterative strategies in the presence of malicious agents," IEEE Trans. Autom. Control, vol. 56, no. 7, pp. 1495-1508, Jul. 2011.
7. H. G. Tanner, "On the controllability of nearest neighbor interconnections," in Proc. IEEE Conf. Decision Control, Dec. 2004, pp. 2467-2472. (Pubitemid 40287154)
8. A. Rahmani, M. Ji, M. Mesbahi, and M. Egerstedt, "Controllability of multi-agent systems from a graph-theoretic perspective," SIAM J. Control Optim., vol. 48, no. 1, pp. 162-186, Feb. 2009.
9. S. Martini, M. Egerstedt, and A. Bicchi, "Controllability analysis of networked systems using equitable partitions," Int. J. Syst., Control Commun., vol. 2, no. 1-3, pp. 100-121, 2010.
10. M. Ji and M. Egerstedt, "Observability and estimation in distributed sensor networks," in Proc. IEEE Conf. Decision Control, Dec. 2007, pp. 4221-4226. (Pubitemid 351277807)
11. B. Liu, T. Chu, L. Wang, and G. Xie, "Controllability of a leader-follower dynamic network with switching topology," IEEE Trans. Autom. Control, vol. 53, no. 4, pp. 1009-1013, May 2008. (Pubitemid 351795861)
12. Z. Ji, Z. Wang, H. Lin, and Z. Wang, "Controllability of multi-agent systems with time-delay in state and switching topology," Int. J. Control, vol. 83, no. 2, pp. 371-386, Feb. 2010.
13. D. Zelazo and M. Mesbahi, "On the observability properties of homogeneous and heterogeneous networked dynamic systems," in Proc. IEEE Conf. Decision Control, Dec. 2008, pp. 2997-3002.
14. S. Sundaram and C. N. Hadjicostis, "Distributed function calculation and consensus using linear iterative strategies," IEEE J. Selected Areas Commun.: Issue Control Comm., vol. 26, no. 4, pp. 650-660, May 2008. (Pubitemid 351658780)
15. G. Parlangeli and G. Notarstefano, "On the observability of path and cycle graphs," in Proc. IEEE Conf. Decision Control, Atlanta, GA, Dec. 2010, pp. 1492-1497.
16. P. J. Antsaklis and A. N. Michel, Linear Systems. New York: Mc-Graw-Hill, 1997.
17. W. C. Yueh, "Eigenvalues of several tridiagonal matrices," Appl. Math. E-Notes, vol. 5, pp. 66-74, 2005.
18. G. Parlangeli and G. Notarstefano, "Graph reduction based observability conditions for network systems running average consensus algorithms," in Proc. Mediterranean Conf. Control Autom., Marrakesh, Morocco, Jun. 2010, pp. 689-694.
19. P. J. Davis, Circulant matrices. New York: Chelsea, 1994.