Search arXivSearch

arXiv · 2506.15195

An efficient co-simulation and control approach to tackle complex multi-domain energetic systems: concepts and applications of the PEGASE platform

Abstract

In this paper, we present a novel research software, called PEGASE, suitable for the design, validation and deployment of advanced control strategies for complex multi-domain energy systems. PEGASE especially features a highly efficient cosimulation engine, together with integrated solutions for defining both rule-based control strategies and Model-Predictive Control (MPC). The main principle behind the PEGASE platform is divide-and-conquer. Indeed, rather than trying to solve a problem as a monolithic entity, which can be highly complex for multi-domain large-scale systems, it is often more efficient to decompose it into several domains or sub-problems, and to simulate them in a decoupled way. To provide its cosimulation capabilities, we based PEGASE on two main components. The first one is a framework for integrating simulation models, which can be either compatible with the FMI standard or interfaced through an Application Programming Interface (API). The second one is a multi-threaded sequencer enabling several simulation sequences with different time steps. To provide advanced control capabilities, we also equipped PEGASE with a framework for MPC combining a comprehensive management of predictions data and a modeler dedicated to the formulation of Mixed Integer Linear Programs. We implemented this framework in C++ providing low formulation and resolution times for typical applications. Connection to hardware is also available via standard industry protocols thereby allowing PEGASE to control real energy systems. In this paper, we show how these basic functionalities, combined with dedicated modeling tools, enable setting up simulation and control applications suitable for tackling the complexity of various kinds of energy systems. To illustrate this, we present four application examples from our recent research work. These examples cover several domains, from concentrated solar thermal plants to optimal control of district heating networks. The variety of examples demonstrates the robustness and genericity of the approach.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mathieu Vallee, Roland Baviere, Valérie Seguin, Valéry Vuillerme, Nicolas Lamaison, Michael Nikhil Descamps, Antoine Aurousseau. 2025-06-18. An efficient co-simulation and control approach to tackle complex multi-domain energetic systems: concepts and applications of the PEGASE platform. https://arxiv.org/abs/2506.15195

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