The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Nonsmooth Finite-Time Synchronization of Switched Coupled Neural Networks
Abstract
This paper is concerned with the finite-time synchronization (FTS) issue of switched coupled neural networks with discontinuous or continuous activations. Based on the framework of nonsmooth analysis, some discontinuous or continuous controllers are designed to force the coupled networks to synchronize to an isolated neural network. Some sufficient conditions are derived to ensure the FTS by utilizing the well-known finite-time stability theorem for nonlinear systems. Compared with the previous literatures, such synchronization objective will be realized when the activations and the controllers are both discontinuous. The obtained results in this paper include and extend the earlier works on the synchronization issue of coupled networks with Lipschitz continuous conditions. Moreover, an upper bound of the settling time for synchronization is estimated. Finally, numerical simulations are given to demonstrate the effectiveness of the theoretical results.
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×
“Lemma 3 [46]: Given an undirected graph G with adjacency matrix A = [aij] and Laplacian matrix L, equality xTLx = 1 2 n ∑”
BackgroundDifferential Equations with Discontinuous Righthand Sides
Filippov, A. F. (1988) · Mathematics and Its Applications · doi:10.1007/978-94-015-7793-9 · Cited by 4,720
Cited by
Fixed-Time Synchronization of Complex Networks With Impulsive Effects via Nonchattering Control
Yang, X., Lam, J., Ho, D. W. C., & Feng, Z. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2691303 · Cited by 453
Hu, C., Yu, J., Chen, Z., Jiang, H., & Huang, T. (2017) · Neural Networks · doi:10.1016/j.neunet.2017.02.001 · Cited by 439
Distributed Formation Control of Multiple Quadrotor Aircraft Based on Nonsmooth Consensus Algorithms
Du, H., Zhu, W., Wen, G., Duan, Z., & Lu, J. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2777463 · Cited by 336
Finite-Time and Fixed-Time Cluster Synchronization With or Without Pinning Control
Liu, X., & Chen, T. (2018) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2630703 · Cited by 287
Self-citationEvent-Triggered Communication and Annular Finite-Time H∞ Filtering for Networked Switched Systems
Zong, G., Ren, H., & Karimi, H. R. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.3010917 · Cited by 278
Metadata
- Authors
- Liu, X., Cao, J., Yu, W., & Song, Q.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2016-10
- Volume
- 46
- Issue
- 10
- Pages
- 2360-2371
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2470397023
- Cited by
- 247
- References
- 2
- FWCI
- 33.00
- 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.