The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Consensus Disturbance Rejection With Disturbance Observers
Open accessAbstract
This paper deals with consensus disturbance rejection of network-connected dynamic systems using disturbance observers. The control objective of consensus disturbance rejection is to achieve a common state trajectory for the network-connected subsystems that are under deterministic disturbances. The difference from the existing disturbance rejection methods is that only the relative state information is used for disturbance rejection, and as a consequence of using the relative state information, only the part of the disturbances that affect the common trajectories will be rejected. The conditions for designing disturbance observers for consensus control are identified for networked-connected multiagent systems. Certain features of the individual subsystems are analyzed for possible implementation of disturbance-observer-based rejection, and the disturbance observers are designed based on the relative state information obtained from the neighboring subsystems under different network connections. When the network connectivity is available for the disturbance observer design, consensus disturbance rejection is achieved for a directed network with a spanning tree. A fully distributed consensus disturbance rejection design is presented for an undirected network with the use of adaptive parameters for the estimation of the unknown network connectivity. Disturbance observers are also proposed for disturbance rejection in the leader-follower consensus control.
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
Consensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522 · cited 1×
“The important progress in consensus control was due to the application of graph theory, particularly, the Laplacian matrix of the network connection, to the control design of interconnected dynamic systems [24], [26]–[29].”
BackgroundThe internal model principle of control theory
Francis, B. A., & Wonham, W. M. (1976) · Automatica · doi:10.1016/0005-1098(76)90006-6 · Cited by 2,874
The Linear Multivariable Regulator Problem
Francis, B. A. (1977) · SIAM Journal on Control and Optimization · doi:10.1137/0315033 · Cited by 1,092
Cited by
Fixed-Time Consensus Tracking for Multiagent Systems With High-Order Integrator Dynamics
Zuo, Z., Tian, B., Defoort, M., & Ding, Z. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2729502 · Cited by 782
Self-citation
Metadata
- Authors
- Ding, Z.
- Venue
- IEEE Transactions on Industrial Electronics
- Published
- 2015-09
- Volume
- 62
- Issue
- 9
- Pages
- 5829-5837
- ISSN
- 0278-0046 (ISSN-L)
- 1557-9948
- OpenAlex
- W1885224416
- Cited by
- 229
- References
- 4
- FWCI
- 23.41
- 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.