Distributed Consensus Tracking Control of Chaotic Multi-Agent Supply Chain Network: A New Fault-Tolerant, Finite-Time, and Chatter-Free Approach
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
Over the last years, distributed consensus tracking control has received a lot of attention due to its benefits, such as low operational costs, high resilience, flexible scalability, and so on. However, control methods that do not consider faults in actuators and control agents are impractical in most systems. There is no research in the literature investigating the consensus tracking of supply chain networks subject to disturbances and faults in control input. Motivated by this, the current research studies the fault-tolerant, finite-time, and smooth consensus tracking problems for chaotic multi-agent supply chain networks subject to disturbances, uncertainties, and faults in actuators. The chaotic attractors of a supply chain network are shown, and its corresponding multi-agent system is presented. A new control technique is then proposed, which is suitable for distributed consensus tracking of nonlinear uncertain systems. In the proposed scheme, the effects of faults in control actuators and robustness against unknown time-varying disturbances are taken into account. The proposed technique also uses a finite-time super-twisting algorithm that avoids chattering in the system's response and control input. Lastly, the multi-agent system is considered in the presence of disturbances and actuator faults, and the proposed scheme's excellent performance is displayed through numerical simulations.
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.000 | 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