Distributed consensus control for multi‐agent systems using terminal sliding mode and Chebyshev neural networks
Bibliographic record
Abstract
SUMMARY This paper investigates the problem of consensus tracking control for second‐order multi‐agent systems in the presence of uncertain dynamics and bounded external disturbances. The communication flow among neighbor agents is described by an undirected connected graph. A fast terminal sliding manifold based on lumped state errors that include absolute and relative state errors is proposed, and then a distributed finite‐time consensus tracking controller is developed by using terminal sliding mode and Chebyshev neural networks. In the proposed control scheme, Chebyshev neural networks are used as universal approximators to learn unknown nonlinear functions in the agent dynamics online, and a robust control term using the hyperbolic tangent function is applied to counteract neural‐network approximation errors and external disturbances, which makes the proposed controller be continuous and hence chattering‐free. Meanwhile, a smooth projection algorithm is employed to guarantee that estimated parameters remain within some known bounded sets. Furthermore, the proposed control scheme for each agent only employs the information of its neighbor agents and guarantees a group of agents to track a time‐varying reference trajectory even when the reference signals are available to only a subset of the group members. Most importantly, finite‐time stability in both the reaching phase and the sliding phase is guaranteed by a Lyapunov‐based approach. Finally, numerical simulations are presented to demonstrate the performance of the proposed controller and show that the proposed controller exceeds to a linear hyperplane‐based sliding mode controller. Copyright © 2011 John Wiley & Sons, Ltd.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".