Recognition: unknown
A Numerical Investigation of Extremum-Seeking-Based Command Generation for Adaptively Controlled Systems
Pith reviewed 2026-05-08 15:59 UTC · model grok-4.3
The pith
Extremum-seeking command generation combined with predictive cost adaptive control optimizes unknown measurable costs during stabilization and command following.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The paper shows through numerical examples that the ECG/PCAC combination generates commands that drive an unknown cost toward its minimum while the closed-loop system remains stable, tracks references, and attenuates disturbances, with system identification performed by recursive least squares with variable-rate forgetting and constraint handling by quadratic programming.
What carries the argument
The ECG/PCAC framework, where extremum-seeking generates commands that asymptotically optimize the measured cost and predictive cost adaptive control performs online identification plus constrained optimization.
If this is right
- Commands are produced that asymptotically minimize the unknown cost.
- Closed-loop stability and command following are maintained through continuous model updates.
- Output constraints are enforced by the quadratic program inside the adaptive controller.
- Disturbance effects are attenuated as the identified model improves.
Where Pith is reading between the lines
- The same structure could be tested on plants whose dominant dynamics change faster than the forgetting schedule can track.
- If cost measurements contain noise, the extremum-seeking loop may require additional filtering whose effect on convergence rate remains unexamined.
- The approach suggests a route to hybrid controllers that switch between different cost functions without retuning the identification layer.
Load-bearing premise
The cost function can be measured in real time even though its mathematical expression is unknown, and the plant dynamics admit sufficiently accurate online identification by recursive least squares.
What would settle it
A simulation run in which the measured cost fails to decrease toward a minimum or the closed-loop outputs violate stability or tracking specifications despite the identification algorithm converging and the extremum seeker operating.
Figures
read the original abstract
We develop an adaptive feedback control technique that combines an extremum-seeking-based command generator (ECG) with indirect adaptive control. In particular, ECG is used to generate commands that asymptotically optimize a cost function that is measured but whose functional form is unknown. For feedback control with command following and stabilization, the present paper combines ECG with predictive cost adaptive control (PCAC), which is an indirect adaptive control extension of model predictive control (MPC). PCAC extends generalized predictive control (GPC) by using quadratic programming to enforce output constraints and recursive least squares (RLS) with variable-rate forgetting (VRF) for system identification. The resulting ECG/PCAC framework combines command generation with closed-loop system identification and online optimization. The contribution of this paper is a numerical investigation of ECG/PCAC for adaptive stabilization, command following, and disturbance rejection
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript develops a combined ECG/PCAC framework in which an extremum-seeking command generator optimizes a measurable but unknown cost function while predictive cost adaptive control (an indirect adaptive extension of MPC) performs online system identification via RLS with variable-rate forgetting and enforces output constraints via quadratic programming. The central contribution is a numerical investigation demonstrating the framework's performance for adaptive stabilization, command following, and disturbance rejection.
Significance. If the numerical evidence is robust, the work offers a practical method for real-time optimization of unknown costs in adaptively controlled systems, integrating command generation with closed-loop identification. The approach could be relevant for applications where cost functions are observable but analytically unavailable, provided the online identification remains reliable under ECG-induced command variations.
major comments (2)
- [Section 4] Numerical investigation (Section 4): The reported simulations do not include quantitative details on the number of Monte Carlo trials, measurement-noise variances, or specific performance metrics (e.g., settling times, steady-state cost values, or constraint-violation rates). Without these, it is not possible to evaluate whether the ECG/PCAC combination reliably achieves stabilization and disturbance rejection across repeated realizations.
- [Section 4] Section 4, simulation setups: The examples do not stress-test the RLS-with-VRF identifier under the time-varying commands produced by ECG (e.g., low-persistent-excitation regimes or abrupt disturbance changes). Consequently, the adequacy of the identified model for the subsequent quadratic-programming step of PCAC is not demonstrated, leaving open the possibility that identification errors could produce suboptimal or unstable closed-loop behavior not captured in the presented runs.
minor comments (2)
- [Abstract] Abstract: The abstract states that numerical results support the claims but provides no quantitative highlights; adding one or two representative metrics would improve readability.
- [Section 2] Notation: The distinction between the extremum-seeking cost and the PCAC quadratic cost should be clarified with explicit symbols in the first use of each.
Simulated Author's Rebuttal
We thank the referee for the constructive comments. We address each major comment below and outline the revisions we will make to strengthen the numerical investigation.
read point-by-point responses
-
Referee: [Section 4] Numerical investigation (Section 4): The reported simulations do not include quantitative details on the number of Monte Carlo trials, measurement-noise variances, or specific performance metrics (e.g., settling times, steady-state cost values, or constraint-violation rates). Without these, it is not possible to evaluate whether the ECG/PCAC combination reliably achieves stabilization and disturbance rejection across repeated realizations.
Authors: We agree that additional quantitative details are needed to better evaluate reliability. In the revised manuscript, we will specify the number of Monte Carlo trials (e.g., 50 independent runs per example), the measurement-noise variances used, and report averaged performance metrics such as settling times, steady-state cost values, and constraint-violation rates with standard deviations where appropriate. revision: yes
-
Referee: [Section 4] Section 4, simulation setups: The examples do not stress-test the RLS-with-VRF identifier under the time-varying commands produced by ECG (e.g., low-persistent-excitation regimes or abrupt disturbance changes). Consequently, the adequacy of the identified model for the subsequent quadratic-programming step of PCAC is not demonstrated, leaving open the possibility that identification errors could produce suboptimal or unstable closed-loop behavior not captured in the presented runs.
Authors: We acknowledge that the current examples focus on nominal conditions. In the revision, we will add dedicated simulation cases that introduce low-persistent-excitation regimes via ECG-generated commands and abrupt disturbance changes. These will include time histories of identification errors, model prediction accuracy, and closed-loop stability indicators to demonstrate the robustness of RLS-with-VRF and the QP step under such conditions. revision: yes
Circularity Check
No significant circularity; numerical investigation is self-contained
full rationale
The paper explicitly frames its contribution as a numerical investigation of the ECG/PCAC combination for adaptive stabilization, command following, and disturbance rejection. No derivation chain, uniqueness theorem, or fitted-parameter prediction is claimed; the reported simulation outcomes are generated independently and do not reduce by construction to any self-citation, ansatz, or input data. Prior concepts such as RLS with variable-rate forgetting and extremum seeking are referenced as background, but the central results stand on the presented numerical evidence rather than tautological reuse of those references. This satisfies the default expectation for an investigation-style paper with no load-bearing self-referential reductions.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption The plant is linear or can be locally approximated as linear for identification purposes.
- domain assumption The measured cost function has a unique extremum that can be tracked asymptotically by the ECG.
Reference graph
Works this paper leans on
-
[1]
Lift and L/D Enhancement in Vortex-Shedding Flows Using Predictive Cost Adaptive Control,
2 E. N. Stout, H. Kumar, J. C. Vander Schaaf, S. A. U. Islam, K. J. Fidkowski, and D. S. Bernstein, “Lift and L/D Enhancement in Vortex-Shedding Flows Using Predictive Cost Adaptive Control,” in Proc. AIAA SciTech Forum, AIAA 2026-1697,
2026
-
[2]
2514/6.2026-1697 3 K
doi: 10 . 2514/6.2026-1697 3 K. B. Ariyur and M. Krstic, Real-Time Optimization by Extremum-Seeking Control. Wiley,
2026
-
[3]
Extremum seeking from 1922 to 2010,
6 Y. Tan, W. H. Moase, C. Manzie, D. Nešić, and I. M. Mareels, “Extremum seeking from 1922 to 2010,” in Proc. Chin. Contr. Conf., 2010, pp. 14–26. 7 A. S. Matveev, M. C. Hoy, and A. V. Savkin, “Extremum seeking navigation without derivative estimation of a mobile robot in a dynamic environmental field,” IEEE Trans. Contr. Sys. Tech., vol. 24, no. 3, pp. 1...
1922
-
[4]
Distributed extremum seeking for constrained networked optimization and its application to energy consumption control in smart grid,
12 M. Ye and G. Hu, “Distributed extremum seeking for constrained networked optimization and its application to energy consumption control in smart grid,” IEEE Trans. Contr. Sys. Tech., vol. 24, no. 6, pp. 2048–2058,
2048
-
[5]
Extremum seeking by multi-agent vehicles and uavs with no steady state oscillation using a geometric-based kalman filtering,
15 S. Pokhrel, A. A. Elgohary, and S. Eisa, “Extremum seeking by multi-agent vehicles and uavs with no steady state oscillation using a geometric-based kalman filtering,” in Proc. AIAA SciTech Forum, 2024, p
2024
-
[6]
A novel newton-based extremum seeking controller for dynamic soaring,
16 S. Pokhrel and S. A. Eisa, “A novel newton-based extremum seeking controller for dynamic soaring,” in European Control Conf., 2024, pp. 239–246. 17 G. Yuan and H. Duan, “Extremum seeking control for uav close formation flight via improved pigeon-inspired optimization,” Sci- ence China Technological Sciences, vol. 67, no. 2, pp. 435–448,
2024
-
[7]
Retrospective cost-based extremum seeking control with vanish- ing perturbation for online output minimization,
23 J. A. Paredes, J. M. P. Delgado, D. S. Bernstein, and A. Goel, “Retrospective cost-based extremum seeking control with vanish- ing perturbation for online output minimization,” in Proc. Amer. Contr. Conf., 2024, pp. 2344–2349. 24 M. Krstic, A. Ghaffari, and S. Seshagiri, “Extremum seeking for wind and solar energy applications,” in Proc. World Cong. In...
2024
-
[8]
Real-time optimization and model predictive control for aerospace and automotive appli- cations,
29 S. Di Cairano and I. V. Kolmanovsky, “Real-time optimization and model predictive control for aerospace and automotive appli- cations,” in Proc. Amer. Contr. Conf., 2018, pp. 2392–2409. doi: 10.23919/ACC.2018.8431585 30 U. Eren, A. Prach, B. B. Koçer, S. V. Raković, E. Kayacan, and B. Açıkmeşe, “Model predictive control in aerospace systems: Current st...
-
[9]
Generalized Predictive Control—Part I. The Basic Algorithm,
doi: 10.2514/1.G002507 31 D. W. Clarke, C. Mohtadi, and P. S. Tuffs, “Generalized Predictive Control—Part I. The Basic Algorithm,” Automatica, vol. 23, pp. 137–148,
-
[10]
Necessary and sufficient regressor conditions for the global asymptotic stability of recursive least squares,
39 A. L. Bruce, A. Goel, and D. S. Bernstein, “Necessary and sufficient regressor conditions for the global asymptotic stability of recursive least squares,” Sys. Contr. Lett., vol. 157, pp. 1–7, 2021, Article 105005. 40 N. Mohseni and D. S. Bernstein, “Recursive least squares with variable-rate forgetting based on the F-test,” in Proc. Amer. Contr. Conf.,...
2021
-
[11]
A Numerical and Experimental Investigation of Predictive Cost Adaptive Control for Noise and Vibration Suppression,
42 M. Kamaldar, N. Mohseni, S. A. U. Islam, and D. S. Bernstein, “A Numerical and Experimental Investigation of Predictive Cost Adaptive Control for Noise and Vibration Suppression,” Mech. Sys. Sig. Proc., vol. 221, pp. 1–42, 2024, paper 111711. 43 J. A. Paredes and D. S. Bernstein, “Experimental application of predictive cost adaptive control to thermoac...
2024
-
[12]
Experimental flight testing a quadcopter autopilot based on predictive cost adaptive control,
doi: 10.2514/6.2024-1731 45 R. J. Richards, J. A. Marshall, and D. S. Bernstein, “Experimental flight testing a quadcopter autopilot based on predictive cost adaptive control,” in Proc. Amer. Contr. Conf., 2025, pp. 2471–
-
[13]
Predictive Cost Adaptive Control of Fixed-Wing Aircraft without Prior Modeling,
46 R. J. Richards, J. A. Paredes, and D. S. Bernstein, “Predictive Cost Adaptive Control of Fixed-Wing Aircraft without Prior Modeling,” in Proc. AIAA SciTech Forum, AIAA 2025-2081,
2025
-
[14]
Data-driven model predictive control of airfoil flow separation,
doi: 10.2514/6.2025-2081 47 J. C. Vander Schaaf, Q. Lu, K. J. Fidkowski, and D. S. Bernstein, “Data-driven model predictive control of airfoil flow separation,” in Proc. Amer. Contr. Conf., 2024, pp. 1566–1571. 48 J. A. Paredes, J. M. P. Delgado, D. S. Bernstein, and A. Goel, “Retrospective cost-based extremum seeking control with vanish- ing perturbation...
-
[15]
doi: 10.1109/LCSYS.2022.3229868
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.