Containment control of linear multi‐agent systems with multiple leaders of bounded inputs using distributed continuous controllers
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Summary: This paper considers the containment control problem for multi‐agent systems with general linear dynamics and multiple leaders whose control inputs are possibly nonzero and time varying. Based on the relative states of neighboring agents, a distributed static continuous controller is designed, under which the containment error is uniformly ultimately bounded and the upper bound of the containment error can be made arbitrarily small, if the subgraph associated with the followers is undirected and, for each follower, there exists at least one leader that has a directed path to that follower. It is noted that the design of the static controller requires the knowledge of the eigenvalues of the Laplacian matrix and the upper bounds of the leaders’ control inputs. In order to remove these requirements, a distributed adaptive continuous controller is further proposed, which can be designed and implemented by each follower in a fully distributed fashion. Extensions to the case where only local output information is available and to the case of multi‐agent systems with matching uncertainties are also discussed. Copyright © 2014 John Wiley & Sons, Ltd.
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 1×
“For recent advances of the consensus problem, readers are referred to [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11] and references therein.”
On the spectra of nonsymmetric Laplacian matrices
Agaev, R., & Chebotarev, P. (2005) · Linear Algebra and its Applications · doi:10.1016/j.laa.2004.09.003 · Cited by 177 · cited 1×
“Furthermore, zero is a simple eigenvalue of L if and only if G has a directed spanning tree [22, 23].”
Metadata
- Authors
- Li, Z., Duan, Z., Ren, W., & Feng, G.
- Venue
- International Journal of Robust and Nonlinear Control
- Publisher
- Wiley
- Published
- 2014-05-27
- Volume
- 25
- Issue
- 13
- Pages
- 2101-2121
- ISSN
- 1049-8923 (ISSN-L)
- 1099-1239
- OpenAlex
- W2963784270
- Cited by
- 185
- References
- 2
- FWCI
- 16.95
- 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.