Search arXiv⌕ Search

arXiv · 2409.10200

A gradient flow approach for combined layout-control design of wave energy parks

Abstract

Wave energy converters (WECs) represent an innovative technology for power generation from renewable sources (marine energy). Although there has been a great deal of research into such devices in recent decades, the power output of a single device has remained low. Therefore, installation in parks is required for economic reasons. The optimal design problem for parks of WECs is challenging since it requires the simultaneous optimization of positions and control parameters. While the literature on this problem usually considers metaheuristic algorithms, we present a novel numerical framework based on a gradient-flow formulation. This framework is capable of solving the optimal design problem for WEC parks. In particular, we use a low-order adaptive Runge-Kutta scheme to integrate the gradient-flow equation and introduce an inexact solution procedure. Here, the tolerances of the linear solver used for projection on the constraint nullspace and of the time-advancing scheme are automatically adapted to avoid over-solving so that the method requires minimal tuning. We then provide the specific details of its application to the considered WEC problem: the goal is to maximize the average power produced by a park, subject to hydrodynamic and dynamic governing equations and to the constraints of available sea area, minimum distance between devices, and limited oscillation amplitude around the undisturbed free surface elevation. A suitable choice of the discrete models allows us to compute analytically the Jacobian of the state problem's residual. Numerical tests with realistic parameters show that the proposed algorithm is efficient, and results of physical interest are obtained.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marco Gambarini, Gabriele Ciaramella, Edie Miglio. 2024-09-16. A gradient flow approach for combined layout-control design of wave energy parks. https://arxiv.org/abs/2409.10200

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The Riemannian Convex Bundle Method

We introduce the convex bundle method to solve convex, non-smooth optimization problems on Riemannian manifolds of bounded sectional curvature. Each step of our method is based on a model that involves the convex hull of previously collected subgradients, parallelly transported into the current serious iterate. This approach generalizes the dual form of classical bundle subproblems in Euclidean space. We prove that, under mild conditions, the convex bundle method converges to a minimizer. Several numerical examples implemented using Manopt$.$jl illustrate the performance of the proposed method and compare it to the subgradient method, the cyclic proximal point algorithm, as well as the proximal bundle method.

math.OC↗

Omega-Limit Sets and Input-to-State Stability in Power Grids With Switching Equilibria

This paper studies a power transmission system with both conventional generators (CGs) and distributed energy assets (DEAs) providing frequency control. We consider an operating condition with demand aggregating two dynamic components: one that switches between different values on a finite set, and one that varies smoothly over time. Such dynamic operating conditions may result from protection scheme activations, external cyber-attacks, or due to the integration of dynamic loads, such as data centers. Mathematically, the dynamics of the resulting system are captured by a system that switches between a finite number of vector fields -- or modes--, with each mode having a distinct equilibrium point induced by the demand aggregation. To analyze the stability properties of the resulting switching system, we leverage tools from hybrid dynamic inclusions and the concept of $Ω$-limit sets from sets. Specifically, we characterize a compact set that is semi-globally practically asymptotically stable under the assumption that the switching frequency and load variation rate are sufficiently slow. For arbitrarily fast variations of the load, we use a level-set argument with multiple Lyapunov functions to establish input-to-state stability of a larger set and with respect to the rate of change of the loads. The theoretical results are illustrated via numerical simulations on the IEEE 39-bus test system.

math.OC↗

Cellular flow control design for mixing based on the least action principle

We consider a novel approach for the enhancement of fluid mixing via pure stirring strategies building upon the Least Action Principle (LAP) for incompressible flows. The LAP is formally analogous to the Benamou--Brenier formulation of optimal transport, but imposes an incompressibility constraint. Our objective is to find a velocity field, generated by Hamiltonian flows, that minimizes the kinetic energy while ensuring that the initial scalar distribution reaches a prescribed degree of mixedness by a finite time. This formulation leads to a ``point-to-set" type of optimization problem which relaxes the requirement on controllability of the system compared to the classic LAP framework. In particular, we assume that the velocity field is induced by a finite set of cellular flows that can be controlled in time. To establish finite time feasibility, we introduce an operator-theoretic switching argument that combines the long-time cellular flow mixing result with the von Neumann alternating-projection theorem. We then leverage the direct method to establish the existence of an optimal solution. Finally, we derive the corresponding optimality conditions for the time-dependent control problem and conduct numerical experiments demonstrating the effectiveness of the proposed control design.

math.OC↗