TY - GEN

T1 - Design of distributed esitimators over arbitrary causal networks

AU - Mohan Vamsi, Andalam Satya

AU - Elia, Nicola

PY - 2011/12/1

Y1 - 2011/12/1

N2 - We consider the problem of designing distributed estimators that are realizable over a given causal communication network. We consider the following two cases - 1) Given an interconnected plant over a given network, we design a distributed estimator with sub-units interacting over the same network such that each sub-unit estimates the states of the corresponding sub-system of the plant; 2) Given a general plant, we design a distributed estimator on a given network such that each sub-unit estimates the whole state vector of the plant by exchanging information with other sub-units. In the first case, we model the problem as a special case of distributed controller design problem discussed in our previous work. In the second case, we use the structure of the distributed estimator to decompose the problem into n sub-problems which can be solved separately, given that the plant satisfies certain detectability assumptions. The solutions of these sub-problems are finally combined together to form a distributed estimator that is realizable over the given network.

AB - We consider the problem of designing distributed estimators that are realizable over a given causal communication network. We consider the following two cases - 1) Given an interconnected plant over a given network, we design a distributed estimator with sub-units interacting over the same network such that each sub-unit estimates the states of the corresponding sub-system of the plant; 2) Given a general plant, we design a distributed estimator on a given network such that each sub-unit estimates the whole state vector of the plant by exchanging information with other sub-units. In the first case, we model the problem as a special case of distributed controller design problem discussed in our previous work. In the second case, we use the structure of the distributed estimator to decompose the problem into n sub-problems which can be solved separately, given that the plant satisfies certain detectability assumptions. The solutions of these sub-problems are finally combined together to form a distributed estimator that is realizable over the given network.

KW - Distributed estimation

KW - H filtering

KW - Interconnected systems

KW - Network realizability

UR - http://www.scopus.com/inward/record.url?scp=84860672648&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84860672648&partnerID=8YFLogxK

U2 - 10.1109/CDC.2011.6161515

DO - 10.1109/CDC.2011.6161515

M3 - Conference contribution

AN - SCOPUS:84860672648

SN - 9781612848006

T3 - Proceedings of the IEEE Conference on Decision and Control

SP - 7305

EP - 7310

BT - 2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011

T2 - 2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011

Y2 - 12 December 2011 through 15 December 2011

ER -