Ensuring stability, feasibility, robustness, and online tractability when integrating learned components into nonlinear control
Determine conditions and develop methods that guarantee stability, recursive feasibility, robustness, and online computational tractability for nonlinear control systems when incorporating learned components (such as learned dynamics models, cost functions, or constraints) into Model Predictive Control and related learning-based controllers, in order to reduce conservatism without sacrificing formal guarantees.
References
However, ensuring stability, feasibility, robustness, and online computational tractability while incorporating learned components for nonlinear systems remains an open question.
Characterizing $X(\ell)$ without knowing $0,$ is still an open challenge, and it is out of the scope of the current paper.
Learning-based control is developing rapidly, but raises questions regarding stability guarantees and certification that are still open.
It is still unclear how much of the recent success in combining Koopman operator theory and MPC is due to the approximation capabilities of linear operators, as compared to the robustness of MPC to model-plant mismatch .
Finally, developing a stronger theoretical understanding of how solver guidance interacts with stochastic policy-gradient optimization remains an important open research direction.
Sensitivity to reward design, hyperparameters and scenario shift is documented but unresolved , degradation under non-stationary conditions has been observed in the field , and simplified occupancy or load assumptions are known to inflate simulated performance .
Reducing this collision rate, whether through the cost tuning above or by feeding the model's predictive uncertainty back into the planner as a runtime safety signal, remains open work.
A full nonlinear theory combining the present collective calibration idea with such nonlinear tube constructions is therefore left as an open problem.
Formal transfer of these certificates to the learning phase, in which model, cost, constraints and terminal cost evolve online, remains an open theoretical question; in this work it is addressed pragmatically through a two-timescale update strategy (fast ENMPC updates per step, slow RTO updates per episode) and empirically verified on the rig.
The proposed framework is evaluated entirely through numerical experiments, and no theoretical guarantees of recursive feasibility, constraint satisfaction, or closed-loop stability are established. The numerical studies are used to investigate whether the online-identified DMAC dynamics can provide a useful prediction model for reference governance across systems of differing complexity. A theoretical treatment of the resulting time-varying prediction model and associated feasibility and stability properties is left for future work.
Future work will develop conditions under which feasibility can be guaranteed for the reference governor under general indirect adaptive control, as the identified model evolves online.