Graph reduction based observability conditions for network systems running average consensus algorithms

@article{Parlangeli2010GraphRB,
  title={Graph reduction based observability conditions for network systems running average consensus algorithms},
  author={Gianfranco Parlangeli and Giuseppe Notarstefano},
  journal={18th Mediterranean Conference on Control and Automation, MED'10},
  year={2010},
  pages={689-694}
}
This paper represents a preliminary step toward the solution of the observability problem for a network system running an average consensus algorithm by use of algebraic graph tools. We introduce a mathematical framework that, in our opinion, is suitable to model a wide class of estimation and diagnostic problems. We provide preliminary results to reduce the complexity of the observability problem by looking at suitable subgraphs of the original communication graph. In particular we provide a… CONTINUE READING

Figures and Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 11 REFERENCES

Controllability analysis of networked systems using equitable partitions.

  • S. Martini, M. Egerstedt, A. Bicchi
  • International Journal of Systems, Control and…
  • 2009
3 Excerpts

Similar Papers

Loading similar papers…