pith. sign in

arxiv: 1708.01459 · v1 · pith:3W6S6XVRnew · submitted 2017-08-04 · 🧮 math.OC

A simple approach to distributed observer design for linear systems

classification 🧮 math.OC
keywords networkobserverdistributedgraphobservedlinearapproachdesign
0
0 comments X
read the original abstract

This note investigates the distributed estimation problem for continuous-time linear time-invariant (LTI) systems observed by a network of observers. Each observer in the network has access to only part of the output of the observed system, and communicates with its neighbors according to a given network graph. In this note we recover the known result that if the observed system is observable and the network graph is a strongly connected digraph, then a distributed observer exists. Moreover, the estimation error can be made to converge to zero at any a priori given decay rate. Our approach leads to a relatively straightforward proof of this result, using the mirror of the balanced graph associated with the original network graph. The numerical design of our distributed observer is reduced to solving linear matrix inequalities (LMI's). Each observer in the network has state dimension equal to that of the observed plant.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.