Finite-Time Adaptive Consensus Tracking Control Based on Barrier Function and Cascaded High-Gain Observer
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This paper studies the consensus tracking control for a class of uncertain high-order nonlinear multi-agent systems under an undirected leader-following architecture. A novel distributed finite-time adaptive control framework is proposed based on the barrier function. The distributed cascaded high-gain observers are introduced to solve the problem of robust consensus tracking with unmeasured intermediate states in multi-agent systems based on the proposed control framework. The proposed control schemes guarantee the finite-time consensus of multi-agent systems, which is proven by the finite-time Lyapunov stability and singular perturbation theory. In conclusion, numerical simulations verify the proposed control protocols’ effectiveness, and their performance advantages are shown by comparing them with another existing method.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| 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.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it