Referenced Items are not available for this document.
In this technical note we consider the problem of distributed discrete-time state estimation over sensor networks. Given a graph that represents the sensor communications, we derive the optimal estimation algorithm at each sensor. We further provide a closed-form expression for the steady-state error covariance matrices when the communication graph reduces to a directed tree. We then apply the developed theoretical tools to compare the performance of two sensor trees and convert a random packet-delay model to a random packet-dropping model. Examples are provided throughout the technical note to support the theory.
Published in:
Automatic Control, IEEE Transactions on
(Volume:54
,
Issue:
9
)
Date of Publication: Sept. 2009
- Page(s):
- 2230 - 2234
- ISSN :
- 0018-9286
- INSPEC Accession Number:
- 10890334
- Digital Object Identifier :
- 10.1109/TAC.2009.2026851
- Product Type:
- Journals & Magazines
- Date of Publication :
- 11 August 2009
- Date of Current Version :
- 04 September 2009
- Issue Date :
- Sept. 2009
- Sponsored by :
- IEEE Control Systems Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
