Show simple item record

Certifying the Optimality of a Distributed State Estimation System via Majorization Theory

dc.contributor.advisorMartins, Nuno
dc.contributor.authorLipsa, Gabriel
dc.contributor.authorMartins, Nuno
dc.date.accessioned2009-11-03T14:47:05Z
dc.date.available2009-11-03T14:47:05Z
dc.date.issued2009
dc.identifier.urihttp://hdl.handle.net/1903/9696
dc.description.abstractConsider a first order linear time-invariant discrete time system driven by process noise, a pre-processor that accepts causal measurements of the state of the system, and a state estimator. The pre-processor and the state estimator are not co-located, and, at every time-step, the pre-processor transmits either a real number or an erasure symbol to the estimator. We seek the pre-processor and the estimator that jointly minimize a cost that combines two terms; the expected squared state estimation error and a communication cost. In our formulation, the transmission of a real number from the pre-processor to the estimator incurs a positive cost while erasures induce zero cost. This paper is the first to prove analytically that a symmetric threshold policy at the pre-processor and a Kalman-like filter at the estimator, which updates its estimate linearly in the presence of erasures, are jointly optimal for our problem.en
dc.format.extent452512 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.relation.ispartofseriesTR_2009-19en
dc.subjectDistributeden
dc.subjectEstimationen
dc.titleCertifying the Optimality of a Distributed State Estimation System via Majorization Theoryen
dc.typeArticleen
dc.relation.isAvailableAtInstitute for Systems Researchen_us
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_us
dc.relation.isAvailableAtUniversity of Maryland (College Park, MD)en_us


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record