The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Finite-Time Semistability and Consensus for Nonlinear Dynamical Networks
Abstract
This paper focuses on semistability and finite-time stability analysis and synthesis of systems having a continuum of equilibria. Semistability is the property whereby the solutions of a dynamical system converge to Lyapunov stable equilibrium points determined by the system initial conditions. In this paper, we merge the theories of semistability and finite-time stability to develop a rigorous framework for finite-time semistability. In particular, finite-time semistability for a continuum of equilibria of continuous autonomous systems is established. Continuity of the settling-time function as well as Lyapunov and converse Lyapunov theorems for semistability are also developed. In addition, necessary and sufficient conditions for finite-time semistability of homogeneous systems are addressed by exploiting the fact that a homogeneous system is finite-time semistable if and only if it is semistable and has a negative degree of homogeneity. Unlike previous work on homogeneous systems, our results involve homogeneity with respect to semistable dynamics, and require us to adopt a geometric description of homogeneity. Finally, we use these results to develop a general framework for designing semistable protocols in dynamical networks for achieving coordination tasks in finite time.
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
Coordination of groups of mobile autonomous agents using nearest neighbor rules
Jadbabaie, A., Lin, J., & Morse, A. S. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2003.812781 · Cited by 8,339
Cited by
Consensus Problems on Networks With Antagonistic Interactions
Altafini, C. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2224251 · Cited by 2,109
Yu, S., & Long, X. (2015) · Automatica · doi:10.1016/j.automatica.2015.02.001 · Cited by 494
Distributed Average Tracking of Multiple Time-Varying Reference Signals With Bounded Derivatives
Chen, F., Cao, Y., & Ren, W. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2199176 · Cited by 320
Distributed finite-time tracking control for multi-agent systems: An observer-based approach
Zhao, Y., Duan, Z., Wen, G., & Zhang, Y. (2013) · Systems & Control Letters · doi:10.1016/j.sysconle.2012.10.012 · Cited by 300
Metadata
- Authors
- Hui, Q., Haddad, W. M., & Bhat, S. P.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2008-09
- Volume
- 53
- Issue
- 8
- Pages
- 1887-1900
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2167677395
- Cited by
- 313
- References
- 2
- FWCI
- 26.89
- 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: Finite-Time Semistability and Consensus for Nonlinear Dynamical Networks. https://app.cochat.ai/papers/10.1109/tac.2008.929392
- The paper
- Hui, Q., Haddad, W. M., & Bhat, S. P. (2008). Finite-Time Semistability and Consensus for Nonlinear Dynamical Networks. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2008.929392
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.