The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A Simple Approach to Distributed Observer Design for Linear Systems
Open accessAbstract
This note investigates the distributed estimation problem for continuous-time linear time-invariant (LTI) systems observed by a network of observers. Our starting point is a given LTI system whose full state vector we want to estimate, based on the measured output of the system. We will call this the observed system. 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. Each observer in the network has state dimension equal to that of the observed plant.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
Olfati-Saber, R., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834113 · Cited by 12,788 · cited 3×
“This auxiliary graph is obtained by balancing the original graph and then taking the mirror of this balanced graph, see [19].”
BackgroundMethod
Cited by
Deng, C., Wen, C., Huang, J., Zhang, X.-M., & Zou, Y. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3090739 · Cited by 310
Metadata
- Authors
- Han, W., Trentelman, H. L., Wang, Z., & Shen, Y.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2019-01
- Volume
- 64
- Issue
- 1
- Pages
- 329-336
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- 2334-3303
- OpenAlex
- W2744543204
- Cited by
- 244
- References
- 1
- FWCI
- 11.05
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.