Design of internal model control dead‐time compensation scheme for first order plus dead‐time systems
Bibliographic record
Abstract
Abstract Internal model control (IMC) is a well‐known model‐based control structure that has additional dead‐time compensation (DTC), while PID is the popularly‐implemented control structure due to its simple structure, ease of implementation, and satisfactory performance at a wide range of operating conditions. Therefore, IMC‐based PID tuning methods are introduced to include the benefits of IMC in PID. Approximations involved in the existing IMC‐based PID tuning methods for specific types of transfer function models result in performance degradation. The IMC structure can be rearranged to the form of a standard PID type controller without approximation, which retains good servo performance for time delay processes. On the other hand, the presence of a time delay element in the controller structure makes the loop highly sensitive to dead‐time variations. Thus, the sensitivity of the IMC scheme realized in the PID structure is studied based on the conventional Nyquist stability criterion. It is observed that the high sensitivity is due to the occurrence of multiple interaction points of the Nyquist curve of the loop transfer function and unit circle. Besides, the number of the interaction points is relative to the ratio of loop dead‐time to closed loop time constant. Further, it is shown that the occurrence of multiple interaction points can be avoided by the right choice of closed loop time constant. The performance and robustness of the proposed design approach is confirmed via simulation analysis.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 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".