Observability and reachability of simple grid and torus graphs

IFAC Proceedings Volumes (IFAC-PapersOnline)

Volumn 44, Issue 1 PART 1, 2011, Pages 13912-13917

  Notarstefano, Giuseppe ^a   Parlangeli, Gianfranco ^a  

^a UNIVERSITY OF SALENTO   (Italy)

Author keywords

Consensus; Controllability; Laplacian eigenvectors; Observability

Indexed keywords

CONTROLLABILITY; GRAPH ALGORITHMS; LAPLACE TRANSFORMS; NUMBER THEORY; OBSERVABILITY;

AVERAGE CONSENSUS; CLOSED-FORM EXPRESSION; COMMUNICATION GRAPHS; CONSENSUS; LAPLACIAN EIGENVECTORS; NETWORK SYSTEMS; SUITABLE CONDITIONS; UNOBSERVABLE;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 84866757849     PISSN: 14746670     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3182/20110828-6-IT-1002.03618     Document Type: Conference Paper

References (15)

1. P. J. Antsaklis and A. N. Michel. Linear Systems. McGraw-Hill, New York, 1997.
2. M. Ji, A. Muhammad, and M. Egerstedt. Leader-based multi-agent coordination: Controllability and optimal control. In Proc CDC, pages 5594-5599, New Orleans, LA, December 2007.
3. Meng Ji and M. Egerstedt. Observability and estimation in distributed sensor networks. In Proc CDC, pages 4221-4226, December 2007.
4. S. Martini, M. Egerstedt, and A. Bicchi. Controllability analysis of networked systems using equitable partitions. Int. Journal of Systems, Control and Communications, 2(1-3):100-121, 2010.
5. R. Merris. Laplacian graph eigenvectors. Linear Algebra and its Applications, 278:221-236, 1998.
6. M. Mesbahi and M. Egerstedt. Graph Theoretic Methods in Multiagent Networks. Princeton University Press, 2010. ISBN 978-1-4008-3535-5.
7. R. Olfati-Saber, J. A. Fax, and R. M. Murray. Consensus and cooperation in networked multi-agent systems. Proceedings of the IEEE, 95(1):215-233, January 2007.
8. G. Parlangeli and G. Notarstefano. Graph reduction based observability conditions for network systems running average consensus algorithms. In Proc. MED, Marrakesh, June 2010a.
9. G. Parlangeli and G. Notarstefano. On the observability of path and cycle graphs. In Proc CDC, Atlanta, GA, USA, December 2010b.
10. G. Parlangeli and G. Notarstefano. On the reachability and observability of path and cycle graphs. IEEE Transactions on Automatic Control, 2010c. Conditionally accepted as technical note.
11. A. Pasqualetti, A. Bicchi, and F. Bullo. Consensus computation in unreliable networks: A system theoretic approach. IEEE Transactions on Automatic Control, 2011. to appear.
12. F. Pasqualetti, R. Carli, A. Bicchi, and F. Bullo. Identifying cyber attacks under local model information. In Proc CDC, Atlanta, GA, USA, December 2010.
13. A. Rahmani, M. Ji, M. Mesbahi, and M. Egerstedt. Controllability of multi-agent systems from a graph- theoretic perspective. SIAM Journal on Control and Optimization, 48(1):162-186, Feb 2009.
14. S. Sundaram and C. N. Hadjicostis. Distributed function calculation and consensus using linear iterative strategies. IEEE Journal on Selected Areas in Communications: Issue on Control and Communications, 26(4): 650-660, May 2008.
15. Herbert G. Tanner. On the controllability of nearest neighbor interconnections. In Proc CDC, pages 2467-2472, December 2004.