Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 279

The DOI matches its Crossref record.

Adaptive fixed-time bipartite tracking consensus control for unknown nonlinear multi-agent systems: An information classification mechanism

Yang, Haijiao, Ye, Dan·2018·Information Sciences

Abstract

Abstract This paper is concerned with the problem of bipartite tracking consensus for high-order unknown nonlinear multi-agent systems with actuator faults. Unlike the traditional condition that the directed signed graph is structurally balanced, a directed signed graph containing a spanning tree is considered. Besides, the consensus errors are required to satisfy both the prescribed performance and fast convergence (fixed-time). By proposing an information classification mechanism, each agent selectively uses neighbor information such that agents in the system are divided into two styles, which transform the bipartite tracking consensus problem into a general tracking consensus problem. By using neural networks and adaptive technologies to approximate unknown functions, the adaptive fault-tolerant fixed-time consensus controllers are developed. All signals in the system are bounded within a fixed time. Moreover, the bipartite consensus errors satisfy the prescribed performance by selecting appropriately predefined performance functions. Stability analysis and simulation results further verify the effectiveness of the proposed method.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.ins.2018.04.016

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.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Metadata

Authors
Yang, H., & Ye, D.
Venue
Information Sciences
Publisher
Elsevier BV
Published
2018-08
Volume
459
Pages
238-254
ISSN
0020-0255 (ISSN-L)
OpenAlex
W2796225979
Cited by
279
References
0
FWCI
7.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.