The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Prescribed-Time Consensus and Containment Control of Networked Multiagent Systems
Abstract
In this paper, we present a new prescribed-time distributed control method for consensus and containment of networked multiple systems. Different from both regular finite-time control (where the finite settling time is not uniform in initial conditions) and the fixed-time control (where the settling time cannot be preassigned arbitrarily), the proposed one is built upon a novel scaling function, resulting in prespecifiable convergence time (the settling time can be preassigned as needed within any physically allowable range). Furthermore, the developed control scheme not only ensures that all the agents reach the average consensus in prescribed finite time under undirected connected topology, but also ensures that all the agents reach a prescribed-time consensus with the root's state being the group decision value under the directed topology containing a spanning tree with the root as the leader. In addition, we extend the result to prescribed-time containment control involving multiple leaders under directed communication topology. Numerical examples are provided to verify the effectiveness and the superiority of the proposed control.
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
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 2×
“Clearly, protocol (2) covers several different cases: when αij = 1, it reduces to the typical asymptotical consensus protocol studied in [29]; when αij = 0, it reduces to the finite-time protocol established in [2]–[6], which is discontinuous due to the using of the signum function; when 0 < αij < 1, it corresponds to…”
Cited by
Prescribed-Time Control and Its Latest Developments
Song, Y., Ye, H., & Lewis, F. L. (2023) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2023.3240751 · Cited by 419
Self-citationDistributed fixed-time consensus for nonlinear heterogeneous multi-agent systems
Du, H., Wen, G., Wu, D., Cheng, Y., & Lü, J. (2020) · Automatica · doi:10.1016/j.automatica.2019.108797 · Cited by 391
Fixed/Preassigned-Time Synchronization of Complex Networks via Improving Fixed-Time Stability
Hu, C., He, H., & Jiang, H. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.2977934 · Cited by 388
Fixed-Time Leader–Follower Consensus of Networked Nonlinear Systems via Event/Self-Triggered Control
Liu, J., Zhang, Y., Yu, Y., & Sun, C. (2020) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2019.2957069 · Cited by 266
Zhang, R., Choi, H.-S., Jung, D., Cho, H., Anh, P. H. N., & Vu, M. T. (2024) · Applied Sciences · doi:10.3390/app142210096 · Cited by 2
Metadata
- Authors
- Wang, Y., Song, Y., Hill, D. J., & Krstic, M.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2019-04
- Volume
- 49
- Issue
- 4
- Pages
- 1138-1147
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2789268314
- Cited by
- 748
- References
- 1
- FWCI
- 18.52
- 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: Prescribed-Time Consensus and Containment Control of Networked Multiagent Systems. https://app.cochat.ai/papers/10.1109/tcyb.2017.2788874
- The paper
- Wang, Y., Song, Y., Hill, D. J., & Krstic, M. (2019). Prescribed-Time Consensus and Containment Control of Networked Multiagent Systems. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2017.2788874
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.