The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Distributed Control Design for Systems Interconnected Over an Arbitrary Graph
Abstract
We consider the problem of synthesizing a distributed dynamic output feedback controller achieving H/sub /spl infin// performance for a system composed of different interconnected sub-units, when the topology of the underlying graph is arbitrary. First, using tools inspired by dissipativity theory, we derive sufficient conditions in the form of finite-dimensional linear matrix inequalities when the interconnections are assumed to be ideal. These inequalities are coupled in a way that reflects the spatial structure of the problem and can be exploited to design distributed synthesis algorithms. We then investigate the case of lossy interconnection links and derive similar results for systems whose interconnection relations can be captured by a class of integral quadratic constraints that includes constant delays.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Cited by
Networked control system: a brief survey
Yang, T. C. (2006) · IEE Proceedings - Control Theory and Applications · doi:10.1049/ip-cta:20050178 · Cited by 698
Intelligent Infrastructure for Energy Efficiency
Gershenfeld, N., Samouhos, S., & Nordman, B. (2010) · Science · doi:10.1126/science.1174082 · Cited by 71
Metadata
- Authors
- Langbort, C., Chandra, R. S., & D'Andrea, R.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2004-09
- Volume
- 49
- Issue
- 9
- Pages
- 1502-1519
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2169488608
- Cited by
- 458
- References
- 1
- FWCI
- 33.54
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Distributed Control Design for Systems Interconnected Over an Arbitrary Graph. https://app.cochat.ai/papers/10.1109/tac.2004.834123
- The paper
- Langbort, C., Chandra, R. S., & D'Andrea, R. (2004). Distributed Control Design for Systems Interconnected Over an Arbitrary Graph. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2004.834123
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.
