Answers are grounded in this paper and cite their sources.
In the heuristic “Adaptive Receding Horizon Controller” (ARHC) the available dynamic model of the controlled system usually is placed in the role of a constraint under which various cost functions can be minimized over a horizon. A possible secure design can be making calculations for a “heavy dynamic model” that may produce high dynamical burden that is efficiently penalized by the cost functions and instead of the original nominal trajectory results a “deformed” one that can be realized by the controlled system of “less heavy dynamics”. In the lack of accurate system model a fixed point iterationbased adaptive approach is suggested for the precise realization of this deformed trajectory. To reduce the computational burden of the control the usual approach in which the dynamic model is considered as constraint and Lagrange-multipliers are introduced as co-state variables is evaded. The heavy dynamic model is directly built in the cost and the computationally greedy Reduced Gradient Algorithm is replaced by a transition between the simple and fast Newton-Raphson and the slower Gradient Descent algorithms (GDA). In the paper simulation examples are presented for two dynamically coupled van der Pol oscillators as a strongly nonlinear system. The comparative use of simple nondifferentiable and differentiable cost functions is considered, too.
No takes yet. Share an insight, caveat, or question.
Atinga et al. (2022) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: