Adaptive control for stochastic nonlinear systems with time‐varying delays via multidimensional Taylor network
Bibliographic record
Abstract
Abstract Control of stochastic nonlinear systems turns out to be notoriously difficult when stochastic uncertainties and time‐varying delays occur simultaneously. This article presents a tractable adaptive control scheme for the stochastic nonlinear system with time‐varying delays. To mitigate the effects of stochastic uncertainties, an adaptive embedded cubature Kalman filter is developed to realize the robust estimation of the state. Unlike the conventional cubature Kalman filter with fixed construction, a semi‐definite programming is designed to adjust the weights of cubature points dynamically. Such programming guarantees the positive definiteness of the error covariance matrix, which enhances the reliability of the filtering procedure. Based on more accurate state estimations, the multidimensional Taylor network (MTN) is utilized to evaluate the dynamic performance under time‐varying delays and approximate the optimal policy in the deterministic policy gradient framework. Adaptive tracking control with high computational efficiency is achieved due to the concise topological structure of MTN. The exponential convergence of the state estimation error and the semi‐globally uniform ultimate boundness of the tracking error are verified theoretically. The effectiveness of the proposed method is confirmed by a numerical simulation based on a practical electric industrial system.
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.000 | 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".