The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Designing Distributed Specified-Time Consensus Protocols for Linear Multiagent Systems Over Directed Graphs
Abstract
This technical note addresses the distributed specified-time consensus protocol design problem for multiagent systems with general linear dynamics over directed graphs. By using motion planning approaches, a novel class of distributed consensus protocols are developed. With a prespecified settling time, the proposed protocols solve the consensus problem of linear multiagent systems over directed graphs containing a directed spanning tree. In particular, the settling time can be offline prespecified, according to task requirements. Compared with the existing results for multiagent systems, to our best knowledge, this is the first time specified-time consensus problems are raised and solved for general linear multiagent systems over directed graphs. Extensions to the specified-time formation flying are further studied for multiple satellites described by Hill equations.
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×
“Over the past few years, the coordinative control problems of multiagent systems have been of great interest to various scientific and engineering communities [1]–[6] due to the broad applications in such fields as spacecraft formation flying, distributed sensor networks, automated highway systems, and so forth [7]–[1…”
BackgroundGodsil, C., & Royle, G. (2001) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0163-9 · Cited by 8,154
Cited by
Prescribed-Time Consensus and Containment Control of Networked Multiagent Systems
Wang, Y., Song, Y., Hill, D. J., & Krstic, M. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2788874 · Cited by 748
Ning, B., Han, Q.-L., Zuo, Z., Ding, L., Lu, Q., & Ge, X. (2023) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2022.3201589 · Cited by 340
Ning, B., Han, Q.-L., & Zuo, Z. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.3008125 · Cited by 266
Metadata
- Authors
- Zhao, Y., Liu, Y., Wen, G., Ren, W., & Chen, G.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2019-07
- Volume
- 64
- Issue
- 7
- Pages
- 2945-2952
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- 2334-3303
- OpenAlex
- W2963127789
- Cited by
- 209
- References
- 2
- FWCI
- 20.24
- 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
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.