Observer-based tracking controller design for networked predictive control systems with uncertain Markov delays
Bibliographic record
Abstract
This paper is concerned with a tracking controller design problem for discrete-time networked predictive control systems. The control law used here is a combined state-feedback control and integral control. Since not all the states are available in practice, a local Luenberger is utilized to estimate the state vector. The measured output and the estimated state vector are packed together and transmitted to the tracking controller via a communication channel with a limited capacity. Meanwhile, the control signal is also transmitted through a communication network. Networked-induced delays on both links are considered for the signal transmission and modeled by Markov chains. Moreover, it is assumed that the elements in the Markov transition matrices are subject to uncertainties. In order to fully compensate for the network-induced delay, the controller generates a sequence of control signals which are dependent on each possible delay on the feedforward channel. With the augmenting technique twice and the proposed control law, we obtain delay-free stochastic closed-loop systems and the controlled output is chosen as the tracking error. Sufficient conditions are provided for the energy-to-peak performance of the closed-loop systems. The feedback gains of the controller can be derived by solving a minimization problem. An example is illustrated to demonstrate the effectiveness of the proposed design 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.
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.001 |
| 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.001 | 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".