Prescribed‐time constrained tracking control of a class of 2 × 2 hyperbolic PDE systems with actuator dynamics
Bibliographic record
Abstract
Abstract This article studies the problem of prescribed‐time constrained tracking control for a class of hyperbolic partial differential equation (PDE) systems with actuator dynamics, which are described by a set of nonlinear ordinary differential equations (ODEs). Since the control input only appears in the ODE subsystem rather than directly on the boundary of PDE subsystem, the control task becomes quite challenging. The most important is that for the control of such ODE controlled PDE systems we mainly make the following two contributions: (1) the controlled output of the PDE system tracks the reference signal within the prescribed time; (2) the controlled output and all the actuator states are constrained. It is the first time that such a prescribed‐time constrained tracking control problem is addressed for the PDE‐ODE coupled system considered in this article. Through rigorous theoretical proof, it is demonstrated that all the system states and control signals are bounded and sufficiently continuous by configuring appropriate design parameters. Finally, the performance is investigated via numerical simulation.
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.000 | 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.000 | 0.001 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| 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".