Hybrid Data-Driven Active Disturbance Rejection Sliding Mode Control with Tower Crane Systems Validation
Bibliographic record
Abstract
This paper proposes a combination of a data-driven algorithm represented by the second-order continuous-time Active Disturbance Rejection Control (ADRC) and a Sliding Mode Control (SMC) algorithm. The purpose of this hybrid controller referred to as ADRC-SMC is to improve the overall control-loop system performance while guaranteeing its stability. This will be done through clear, simple, and transparent steps of controller design in a novel real formulation focused on practical implementation. The parameters of the novel second-order continuous-time ADRC-SMC algorithm are optimally tuned using a metaheuristic slime mould algorithm. The purpose of obtaining the parameters of the ADRC-SMC algorithms in this model-based manner is to reduce the heuristics and further ensure a fair performance comparison of the ADRC-SMC algorithm with that of the popular ADRC algorithm. The data-driven second-order continuous-time ADRC and ADRC-SMC algorithms are validated experimentally validated on tower crane laboratory equipment.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".