Bibliographic record
Abstract
In the absence of prior knowledge of a system, control design relies heavily on the system identifi- cation procedure. In real applications, there is an increasing demand to combine the usually time consuming system identification and modeling step with the control design procedure. Motivated by this demand, data-driven control approaches attempt to use the input-output data to design the controller directly. Subspace Predictive Control (SPC) is one popular example of these algorithms that combines Model Predictive Control (MPC) and Subspace Identification Methods (SIM). SPC instability and performance deterioration in closed-loop implementations are majorly caused by either poor tuning of SPC horizons or changes in the dynamics of the system. Stability and performance analysis of the SPC are the focus of this dissertation. We first provide the necessary and sufficient condition for SPC closed-loop stability. The results introduce SPC stability graphs that can provide the feasible prediction horizon range. Consequently, these stability constraints are included in SPC cost function optimization to provide a new method for determining the SPC horizons. The novel SPC horizon selection enhances the closed-loop performance effectively. Note that time-delay estimation and order selection in system modeling have been a challenging step in applications and industry. Here, we propose a new approach denoted by RE-based TDE that simultaneously and fficiently estimates the time-delay for the SIM framework. In addition, we use the recently developed MSEE approach for estimating the system order. Moreover, we propose an arti- ficial intelligence approach denoted by Particle Swarm Optimization Based Fuzzy Gain-Scheduled SPC (PSO-based FGS-SPC). The method overcomes the issue of on-line adaptation of SPC gains for systems with variable dynamics in the presence of the noisy data. The approach eliminates existing tuning problem of controller gain ranges in FGS and updates the SPC gains with no need to apply any external persistently excitation signals. As a result, PSO-based FGS-SPC provides a time efficient control strategy with fast and robust tracking performance compared to conventional and state of the art methods.
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.001 |
| Science and technology studies | 0.000 | 0.000 |
| 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.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".