An official website of the United States government
Abstract This article presents an extremum‐seeking control (ESC) algorithm for unmodeled nonlinear systems with known steady‐state gain and generally non‐convex cost functions with bounded curvature. The main contribution of this article is a novel gradient estimator, which uses a polyhedral set that characterizes all gradient estimates consistent with the collected data. The gradient estimator is posed as a quadratic program, which selects the gradient estimate that provides the best worst‐case convergence of the closed‐loop Lyapunov function. We show that the polyhedral‐based gradient estimator ensures the stability of the closed‐loop system formed by the plant and optimization algorithm. Furthermore, the estimated gradient provably produces the optimal robust convergence. We demonstrate our ESC controller through three benchmark examples and one practical example, which shows our ESC has fast and robust convergence to the optimal equilibrium.
more »
« less
Improving the Performance of a Hierarchical Traffic Flow Control Framework Using Lyapunov-Based Switched Newton Extremum Seeking
Abstract The primary aim of this research paper is to enhance the effectiveness of a two-level infrastructure-based control framework utilized for traffic management in expansive networks. The lower-level controller adjusts vehicle velocities to achieve the desired density determined by the upper-level controller. The upper-level controller employs a novel Lyapunov-based switched Newton extremum seeking control approach to ascertain the optimal vehicle density in congested cells where downstream bottlenecks are unknown, even in the presence of disturbances in the model. Unlike gradient-based approaches, the Newton algorithm eliminates the need for the unknown Hessian matrix, allowing for user-assignable convergence rates. The Lyapunov-based switched approach also ensures asymptotic convergence to the optimal set point. Simulation results demonstrate that the proposed approach, combining Newton’s method with user-assignable convergence rates and a Lyapunov-based switch, outperforms gradient-based extremum seeking in the hierarchical control framework.
more »
« less
- Award ID(s):
- 2130704
- PAR ID:
- 10481923
- Publisher / Repository:
- ASME
- Date Published:
- Journal Name:
- ASME Letters in Dynamic Systems and Control
- Volume:
- 3
- Issue:
- 4
- ISSN:
- 2689-6117
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
This paper studies the distributed feedback optimization problem for linear multi-agent systems without precise knowledge of local costs and agent dynamics. The proposed solution is based on a hierarchical approach that uses upper-level coordinators to adjust reference signals toward the global optimum and lower-level controllers to regulate agents’ outputs toward the reference signals. In the absence of precise information on local gradients and agent dynamics, an extremum-seeking mechanism is used to enforce a gradient descent optimization strategy, and an adaptive dynamic programming approach is taken to synthesize an internal-model-based optimal tracking controller. The whole procedure relies only on measurements of local costs and input-state data along agents’ trajectories. Moreover, under appropriate conditions, the closed-loop signals are bounded and the output of the agents exponentially converges to a small neighborhood of the desired extremum. A numerical example is conducted to validate the efficacy of the proposed method.more » « less
-
null (Ed.)Abstract This paper addresses the compensation of wave actuator dynamics in scalar extremum seeking (ES) for static maps. Infinite-dimensional systems described by partial differential equations (PDEs) of wave type have not been considered so far in the literature of ES. A distributed-parameter-based control law using back-stepping approach and Neumann actuation is initially proposed. Local exponential stability as well as practical convergence to an arbitrarily small neighborhood of the unknown extremum point is guaranteed by employing Lyapunov–Krasovskii functionals and averaging theory in infinite dimensions. Thereafter, the extension for wave equations with Dirichlet actuation, antistable wave PDEs as well as the design for the delay-wave PDE cascade are also discussed. Numerical simulations illustrate the theoretical results.more » « less
-
Common reinforcement learning methods seek optimal controllers for unknown dynamical systems by searching in the "policy" space directly. A recent line of research, starting with [1], aims to provide theoretical guarantees for such direct policy-update methods by exploring their performance in classical control settings, such as the infinite horizon linear quadratic regulator (LQR) problem. A key property these analyses rely on is that the LQR cost function satisfies the "gradient dominance" property with respect to the policy parameters. Gradient dominance helps guarantee that the optimal controller can be found by running gradient-based algorithms on the LQR cost. The gradient dominance property has so far been verified on a case-by-case basis for several control problems including continuous/discrete time LQR, LQR with decentralized controller, H2/H∞ robust control.In this paper, we make a connection between this line of work and classical convex parameterizations based on linear matrix inequalities (LMIs). Using this, we propose a unified framework for showing that gradient dominance indeed holds for a broad class of control problems, such as continuous- and discrete-time LQR, minimizing the L2 gain, and problems using system-level parameterization. Our unified framework provides insights into the landscape of the cost function as a function of the policy, and enables extending convergence results for policy gradient descent to a much larger class of problems.more » « less
-
Abstract This work describes the results from wind tunnel experiments performed to maximize wind plant total power output using wake steering via closed loop yaw angle control. The experimental wind plant consists of nine turbines arranged in two different layouts; both are two dimensional arrays and differ in the positioning of the individual turbines. Two algorithms are implemented to maximize wind plant power: Log‐of‐Power Extremum Seeking Control (LP‐ESC) and Log‐of‐Power Proportional Integral Extremum Seeking Control (LP‐PIESC). These algorithms command the yaw angles of the turbines in the upstream row. The results demonstrate that the algorithms can find the optimal yaw angles that maximize total power output. The LP‐PIESC reached the optimal yaw angles much faster than the LP‐ESC. The sensitivity of the LP‐PIESC to variations in free stream wind speed and initial yaw angles is studied to demonstrate robustness to variations in wind speed and unknown yaw misalignment.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1115/1.4064088
