An official website of the United States government
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
Data‐enabled extremum seeking: A cooperative concurrent learning‐based approach
Summary This paper introduces a new class of feedback‐based data‐driven extremum seeking algorithms for the solution of model‐free optimization problems in smooth continuous‐time dynamical systems. The novelty of the algorithms lies on the incorporation of memory to store recorded data that enables the use of information‐rich datasets during the optimization process, and allows to dispense with the time‐varying dither excitation signal needed by standard extremum seeking algorithms that rely on a persistence of excitation (PE) condition. The model‐free optimization dynamics are developed for single‐agent systems, as well as for multi‐agent systems with communication graphs that allow agents to share their state information while preserving the privacy of their individual data. In both cases, sufficient richness conditions on the recorded data, as well as suitable optimization dynamics modeled by ordinary differential equations are characterized in order to guarantee convergence to a neighborhood of the solution of the extremum seeking problems. The performance of the algorithms is illustrated via different numerical examples in the context of source‐seeking problems in multivehicle systems.
more »
« less
- Award ID(s):
- 1947613
- PAR ID:
- 10446038
- Publisher / Repository:
- Wiley Blackwell (John Wiley & Sons)
- Date Published:
- Journal Name:
- International Journal of Adaptive Control and Signal Processing
- Volume:
- 35
- Issue:
- 7
- ISSN:
- 0890-6327
- Page Range / eLocation ID:
- p. 1256-1284
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
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
-
Abstract Decomposition‐based solution algorithms for optimization problems depend on the underlying latent block structure of the problem. Methods for detecting this structure are currently lacking. In this article, we propose stochastic blockmodeling (SBM) as a systematic framework for learning the underlying block structure in generic optimization problems. SBM is a generative graph model in which nodes belong to some blocks and the interconnections among the nodes are stochastically dependent on their block affiliations. Hence, through parametric statistical inference, the interconnection patterns underlying optimization problems can be estimated. For benchmark optimization problems, we show that SBM can reveal the underlying block structure and that the estimated blocks can be used as the basis for decomposition‐based solution algorithms which can reach an optimum or bound estimates in reduced computational time. Finally, we present a general software platform for automated block structure detection and decomposition‐based solution following distributed and hierarchical optimization approaches.more » « less
-
Abstract In an information-seeking conversation, a user may ask questions that are under-specified or unanswerable. An ideal agent would interact by initiating different response types according to the available knowledge sources. However, most current studies either fail to or artificially incorporate such agent-side initiative. This work presents InSCIt, a dataset for Information-Seeking Conversations with mixed-initiative Interactions. It contains 4.7K user-agent turns from 805 human-human conversations where the agent searches over Wikipedia and either directly answers, asks for clarification, or provides relevant information to address user queries. The data supports two subtasks, evidence passage identification and response generation, as well as a human evaluation protocol to assess model performance. We report results of two systems based on state-of-the-art models of conversational knowledge identification and open-domain question answering. Both systems significantly underperform humans, suggesting ample room for improvement in future studies.1more » « 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
