The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Finite-time consensus for multi-agent networks with unknown inherent nonlinear dynamics
Open accessAbstract
The objective of this paper is to analyze the finite-time convergence of a nonlinear but continuous consensus algorithm for multi-agent networks with unknown inherent nonlinear dynamics. Due to the existence of the unknown inherent nonlinear dynamics, the stability analysis and the finite-time convergence analysis are more challenging than those under the well-studied consensus algorithms for known linear systems. For this purpose, we propose a novel comparison based tool. By using this tool, it is shown that the proposed nonlinear consensus algorithm can guarantee finite-time convergence if the directed switching interaction graph has a directed spanning tree at each time interval. Specifically, the finite-time convergence is shown by comparing the closed-loop system under the proposed consensus algorithm with some well-designed closed-loop system whose stability properties are easier to obtain. Moreover, the stability and the finite-time convergence of the closed-loop system using the proposed consensus algorithm under a (general) directed switching interaction graph can even be guaranteed by the stability and the finite-time convergence of some well-designed nonlinear closed-loop system under some special directed switching interaction graph. This provides a stimulating example for the potential applications of the proposed comparison based tool in the stability analysis of linear/nonlinear closed-loop systems by making use of known results in linear/nonlinear systems.
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 1×
“Consensus has been investigated under various scenarios, including a deterministic interaction setting [1]–[4], a stochastic interaction setting [5]–[8], a sampled-data setting [9]–[12], an asynchronous setting [3], [4], [13], a quantization effect [14], [15], and finite-time convergence [16]–[22].”
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
Distributed 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
Metadata
- Authors
- Cao, Y., & Ren, W.
- Venue
- Automatica
- Publisher
- Elsevier BV
- Published
- 2014-10
- Volume
- 50
- Issue
- 10
- Pages
- 2648-2656
- ISSN
- 0005-1098 (ISSN-L)
- OpenAlex
- W1970811568
- Cited by
- 192
- References
- 1
- FWCI
- 23.11
- 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.