arXiv subjects

Saverio Bolognani

Publications and source records attributed to Saverio Bolognani.

At least 55 records · Page 3Linked to original sources

arXiv2023

Providing Curative Distribution Grid Flexibility Using Online Feedback Optimization

Distribution grid flexibility is discussed as a possible measure in curative system operation, yielding a need for an efficient and robust coordination mechanism for the joint flexibility provision by individual units to the transmission grid. This paper introduces a method to coordinate distribution grid level flexibility as a fast-responding curative measure based on Online Feedback Optimization. We utilize an optimization algorithm in a closed loop with the distribution grid to dispatch set points for active and reactive power to flexibility providing units. The approach is evaluated in an experimental setup, utilizing assets connected to an exemplary low voltage grid. Online Feedback Optimization is found to be both a viable as well as a highly effective approach to coordinate distributed energy resources in real-time curative system operation.

eess.SY↗

arXiv2023

Tutorial on Congestion Control in Multi-Area Transmission Grids via Online Feedback Equilibrium Seeking

Online feedback optimization (OFO) is an emerging control methodology for real-time optimal steady-state control of complex dynamical systems. This tutorial focuses on the application of OFO for the autonomous operation of large-scale transmission grids, with a specific goal of minimizing renewable generation curtailment and losses while satisfying voltage and current limits. When this control methodology is applied to multi-area transmission grids, where each area independently manages its congestion while being dynamically interconnected with the rest of the grid, a non-cooperative game arises. In this context, OFO must be interpreted as an online feedback equilibrium seeking (FES) scheme. Our analysis incorporates technical tools from game theory and monotone operator theory to evaluate the stability and performance of multi-area grid operation. Through numerical simulations, we illustrate the key challenge of this non-cooperative setting: on the one hand, independent multi-area decisions are suboptimal compared to a centralized control scheme; on the other hand, some areas are heavily penalized by the centralized decision, which may discourage participation in the coordination mechanism.

math.OC↗

arXiv2023

Deployment of an Online Feedback Optimization Controller for Reactive Power Flow Optimization in a Distribution Grid

Optimization is an essential part of power grid operation and lately, Online Optimization methods have gained traction. One such method is Online Feedback Optimization (OFO) which uses measurements from the grid as feedback to iteratively change the control inputs until they converge to the solution of the optimization problem. Such algorithms have been applied to many power system problems and experimentally validated in lab setups. This paper implements an OFO controller in a real distribution grid for 24/7 operation using off-the-shelf hardware and software. The proposed control strategy optimizes the reactive power flow at the substation while satisfying voltage constraints. As part of an existing coordination scheme between (sub)transmission grid operator (TSO) and distribution grid operator (DSO), this comes with a financial reward and simultaneously it virtually reinforces the grid by regulating the voltage on the feeder and therefore allowing higher levels of distributed generation/consumption. We present how a distribution grid is retrofitted such that we can use existing inverters, we analyze the controller's interaction with legacy infrastructure, and investigate its overall control behavior. Finally, we demonstrate the successful deployment of an OFO controller in an operational environment which corresponds to Technology Readiness Level (TRL) 7.

eess.SY↗

arXiv2023

Strategic Interactions in Multi-modal Mobility Systems: A Game-Theoretic Perspective

The evolution of existing transportation systems,mainly driven by urbanization and increased availability of mobility options, such as private, profit-maximizing ride-hailing companies, calls for tools to reason about their design and regulation. To study this complex socio-technical problem, one needs to account for the strategic interactions of the heterogeneous stakeholders involved in the mobility ecosystem and analyze how they influence the system. In this paper, we focus on the interactions between citizens who compete for the limited resources of a mobility system to complete their desired trip. Specifically, we present a game-theoretic framework for multi-modal mobility systems, where citizens, characterized by heterogeneous preferences, have access to various mobility options and seek individually-optimal decisions. We study the arising game and prove the existence of an equilibrium, which can be efficiently computed via a convex optimization problem. Through both an analytical and a numerical case study for the classic scenario of Sioux Falls, USA, we illustrate the capabilities of our model and perform sensitivity analyses. Importantly, we show how to embed our framework into a "larger" game among stakeholders of the mobility ecosystem (e.g., municipality, Mobility Service Providers, and citizens), effectively giving rise to tools to inform strategic interventions and policy-making in the mobility ecosystem.

cs.MA↗

arXiv2023

A Classification of Feedback Loops and Their Relation to Biases in Automated Decision-Making Systems

Prediction-based decision-making systems are becoming increasingly prevalent in various domains. Previous studies have demonstrated that such systems are vulnerable to runaway feedback loops, e.g., when police are repeatedly sent back to the same neighborhoods regardless of the actual rate of criminal activity, which exacerbate existing biases. In practice, the automated decisions have dynamic feedback effects on the system itself that can perpetuate over time, making it difficult for short-sighted design choices to control the system's evolution. While researchers started proposing longer-term solutions to prevent adverse outcomes (such as bias towards certain groups), these interventions largely depend on ad hoc modeling assumptions and a rigorous theoretical understanding of the feedback dynamics in ML-based decision-making systems is currently missing. In this paper, we use the language of dynamical systems theory, a branch of applied mathematics that deals with the analysis of the interconnection of systems with dynamic behaviors, to rigorously classify the different types of feedback loops in the ML-based decision-making pipeline. By reviewing existing scholarly work, we show that this classification covers many examples discussed in the algorithmic fairness community, thereby providing a unifying and principled framework to study feedback loops. By qualitative analysis, and through a simulation example of recommender systems, we show which specific types of ML biases are affected by each type of feedback loop. We find that the existence of feedback loops in the ML-based decision-making pipeline can perpetuate, reinforce, or even reduce ML biases.

cs.CY↗

arXiv2023

A self-contained karma economy for the dynamic allocation of common resources

This paper presents karma mechanisms, a novel approach to the repeated allocation of a scarce resource among competing agents over an infinite time. Examples include deciding which ride hailing trip requests to serve during peak demand, granting the right of way in intersections or lane mergers, or admitting internet content to a regulated fast channel. We study a simplified yet insightful formulation of these problems where at every instant two agents from a large population get randomly matched to compete over the resource. The intuitive interpretation of a karma mechanism is "If I give in now, I will be rewarded in the future." Agents compete in an auction-like setting where they bid units of karma, which circulates directly among them and is self-contained in the system. We demonstrate that this allows a society of self-interested agents to achieve high levels of efficiency without resorting to a (possibly problematic) monetary pricing of the resource. We model karma mechanisms as dynamic population games and guarantee the existence of a stationary Nash equilibrium. We then analyze the performance at the stationary Nash equilibrium numerically. For the case of homogeneous agents, we compare different mechanism design choices, showing that it is possible to achieve an efficient and ex-post fair allocation when the agents are future aware. Finally, we test the robustness against agent heterogeneity and propose remedies to some of the observed phenomena via karma redistribution.

econ.TH↗

arXiv2023

Real-time Curative Actions for Power Systems via Online Feedback Optimization

Curative or remedial actions are the set of immediate actions intended to bring the power grid to a safe operating point after a contingency. The effectiveness of these actions is essential to guarantee curative N-1 security. Nowadays, curative actions are derived ahead of time, based on the anticipated future grid state. Due to the shift from steady to volatile energy resources, the grid state will frequently change and the curative actions would need to be pre-planned increasingly often. Furthermore, with the shift from large bulk production to many small decentralized energy sources more devices need to be actuated simultaneously to achieve the same outcome. Instead of pre-planning, we propose to calculate these complex curative actions in real-time after the occurrence of a contingency. We show how the method of Online Feedback Optimization (OFO) is well suited for this task. As a preliminary demonstration of these capabilities, we use an (OFO) controller, that after a fault, reduces the voltage difference over a breaker to enable the operators to reclose it. This test case is inspired by the 2003 Swiss-Italian blackout, which was caused by a relatively minor incident followed by ineffective curative actions. Finally, we identify and discuss some open questions, including closed-loop stability and robustness to model mismatch.

eess.SY↗

arXiv2022

How Bad is Selfish Driving? Bounding the Inefficiency of Equilibria in Urban Driving Games

We consider the interaction among agents engaging in a driving task and we model it as general-sum game. This class of games exhibits a plurality of different equilibria posing the issue of equilibrium selection. While selecting the most efficient equilibrium (in term of social cost) is often impractical from a computational standpoint, in this work we study the (in)efficiency of any equilibrium players might agree to play. More specifically, we bound the equilibrium inefficiency by modeling driving games as particular type of congestion games over spatio-temporal resources. We obtain novel guarantees that refine existing bounds on the Price of Anarchy (PoA) as a function of problem-dependent game parameters. For instance, the relative trade-off between proximity costs and personal objectives such as comfort and progress. Although the obtained guarantees concern open-loop trajectories, we observe efficient equilibria even when agents employ closed-loop policies trained via decentralized multi-agent reinforcement learning.

cs.RO↗

arXiv2022

Experimental Validation of Feedback Optimization in Power Distribution Grids

We consider the problem of controlling the voltage of a distribution feeder using the reactive power capabilities of inverters. On a real distribution grid, we compare the local Volt/VAr droop control recommended in recent grid codes, a centralized dispatch based on optimal power flow (OPF) programming, and a feedback optimization (FO) controller that we propose. The local droop control yields suboptimal regulation, as predicted analytically. The OPF-based dispatch strategy requires an accurate grid model and measurement of all loads on the feeder in order to achieve proper voltage regulation. However, in the experiment, the OPF-based strategy violates voltage constraints due to inevitable model mismatch and uncertainties. Our proposed FO controller, on the other hand, satisfies the constraints and does not require load measurements or any grid state estimation. The only needed model knowledge is the sensitivity of the voltages with respect to reactive power, which can be obtained from data. As we show, an approximation of these sensitivities is also sufficient, which makes the approach essentially model-free, easy to tune, compatible with the current sensing and control infrastructure, and remarkably robust to measurement noise. We expect these properties to be fundamental features of FO for power systems and not specific to Volt/VAr regulation or to distribution grids.

eess.SY↗

arXiv2022

Cross-layer Design for Real-Time Grid Operation: Estimation, Optimization and Power Flow

In this paper, we propose a combined Online Feedback Optimization (OFO) and dynamic estimation approach for a real-time power grid operation under time-varying conditions. A dynamic estimation uses grid measurements to generate the information required by an OFO controller, that incrementally steers the controllable power injections set-points towards the solutions of a time-varying AC Optimal Power Flow (AC-OPF) problem. More concretely, we propose a quadratic programming-based OFO that guarantees satisfying the grid operational constraints, like admissible voltage limits. Within the estimation, we design an online power flow solver that efficiently computes power flow approximations in real time. Finally, we certify the stability and convergence of this combined approach under time-varying conditions, and we validate its effectiveness on a simulation with a test feeder and high resolution consumption data.

eess.SY↗

arXiv2022

Adaptive Real-Time Grid Operation via Online Feedback Optimization with Sensitivity Estimation

In this paper we propose an approach based on an Online Feedback Optimization (OFO) controller with grid input-output sensitivity estimation for real-time grid operation, e.g., at subsecond time scales. The OFO controller uses grid measurements as feedback to update the value of the controllable elements in the grid, and track the solution of a time-varying AC Optimal Power Flow (AC-OPF). Instead of relying on a full grid model, e.g., grid admittance matrix, OFO only requires the steady-state sensitivity relating a change in the controllable inputs, e.g., power injections set-points, to a change in the measured outputs, e.g., voltage magnitudes. Since an inaccurate sensitivity may lead to a model-mismatch and jeopardize the performance, we propose a recursive least-squares estimation that enables OFO to learn the sensitivity from measurements during real-time operation, turning OFO into a model-free approach. We analytically certify the convergence of the proposed OFO with sensitivity estimation, and validate its performance on a simulation using the IEEE 123-bus test feeder, and comparing it against a state-of-the-art OFO with constant sensitivity.

eess.SY↗

arXiv2022

Experimental Validation of Fully Distributed Peer-to-Peer Optimal Voltage Control with Minimal Model Requirements

This paper addresses the problem of voltage regulation in a power distribution grid using the reactive power injections of grid-connected power inverters. We first discuss how purely local voltage control schemes cannot regulate the voltages within a desired range under all circumstances and may even yield detrimental control decisions. Communication and, through that, coordination are therefore needed. On the other hand, short-range peer-to-peer communication and knowledge of electric distances between neighbouring controllers are sufficient for this task. We implement such a peer-to-peer controller and test it on a 400~V distribution feeder with asynchronous communication channels, confirming its viability on real-life systems. Finally, we analyze the scalability of this approach with respect to the number of agents on the feeder that participate in the voltage regulation task.

eess.SY↗

arXiv2021

Sensitivity-conditioning: Beyond Singular Perturbation for Control Design on Multiple Time Scales

A classical approach to design controllers for interconnected systems is to assume that the different subsystems operate at different time scales, then design simpler controllers within each time scale, and finally certify stability of the interconnected system via singular perturbation analysis. In this work, we propose an alternative approach that also allows to design the controllers of the individual subsystems separately. However, instead of requiring a sufficiently large time-scale separation, our approach consists of adding a feed-forward term to modify the dynamics of faster systems in order to anticipate the dynamics of slower ones. We present several examples in bilevel optimization and cascade control design, where our approach improves the performance of currently available methods.

math.OC↗

arXiv2021

Closing the Loop: Dynamic State Estimation and Feedback Optimization of Power Grids

This paper considers the problem of online feedback optimization to solve the AC Optimal Power Flow in real-time in power grids. This consists in continuously driving the controllable power injections and loads towards the optimal set-points in time-varying conditions based on real-time measurements performed on the grid. However, instead of assuming noise-free full state measurement like recent feedback optimization approaches, we connect a dynamic State Estimation using available measurements, and study its dynamic interaction with the optimization scheme. We certify stability of this interconnection and the convergence in expectation of the state estimate and the control inputs towards the true state values and optimal set-points respectively. Additionally, we bound the resulting stochastic error. Finally, we show the effectiveness of the approach on a test case using high resolution consumption data.

eess.SY↗

arXiv2021

Posetal Games: Efficiency, Existence, and Refinement of Equilibria in Games with Prioritized Metrics

Modern applications require robots to comply with multiple, often conflicting rules and to interact with the other agents. We present Posetal Games as a class of games in which each player expresses a preference over the outcomes via a partially ordered set of metrics. This allows one to combine hierarchical priorities of each player with the interactive nature of the environment. By contextualizing standard game theoretical notions, we provide two sufficient conditions on the preference of the players to prove existence of pure Nash Equilibria in finite action sets. Moreover, we define formal operations on the preference structures and link them to a refinement of the game solutions, showing how the set of equilibria can be systematically shrunk. The presented results are showcased in a driving game where autonomous vehicles select from a finite set of trajectories. The results demonstrate the interpretability of results in terms of minimum-rank-violation for each player.

cs.MA↗

arXiv2021

Sampled-Data Online Feedback Equilibrium Seeking: Stability and Tracking

This paper proposes a general framework for constructing feedback controllers that drive complex dynamical systems to "efficient" steady-state (or slowly varying) operating points. Efficiency is encoded using generalized equations which can model a broad spectrum of useful objectives, such as optimality or equilibria (e.g. Nash, Wardrop, etc.) in noncooperative games. The core idea of the proposed approach is to directly implement iterative solution (or equilibrium seeking) algorithms in closed loop with physical systems. Sufficient conditions for closed-loop stability and robustness are derived; these also serve as the first closed-loop stability results for sampled-data feedback-based optimization. Numerical simulations of smart building automation and game-theoretic robotic swarm coordination support the theoretical results.

math.OC↗

arXiv2021

A Dynamic Population Model of Strategic Interaction and Migration under Epidemic Risk

In this paper, we show how a dynamic population game can model the strategic interaction and migration decisions made by a large population of agents in response to epidemic prevalence. Specifically, we consider a modified susceptible-asymptomatic-infected-recovered (SAIR) epidemic model over multiple zones. Agents choose whether to activate (i.e., interact with others), how many other agents to interact with, and which zone to move to in a time-scale which is comparable with the epidemic evolution. We define and analyze the notion of equilibrium in this game, and investigate the transient behavior of the epidemic spread in a range of numerical case studies, providing insights on the effects of the agents' degree of future awareness, strategic migration decisions, as well as different levels of lockdown and other interventions. One of our key findings is that the strategic behavior of agents plays an important role in the progression of the epidemic and can be exploited in order to design suitable epidemic control measures.

eess.SY↗

arXiv2021

Optimal Placement of Virtual Inertia in Power Grids

A major transition in the operation of electric power grids is the replacement of synchronous machines by distributed generation connected via power electronic converters. The accompanying "loss of rotational inertia" and the fluctuations by renewable sources jeopardize the system stability, as testified by the ever-growing number of frequency incidents. As a remedy, numerous studies demonstrate how virtual inertia can be emulated through various devices, but few of them address the question of "where" to place this inertia. It is however strongly believed that the placement of virtual inertia hugely impacts system efficiency, as demonstrated by recent case studies. In this article, we carry out a comprehensive analysis in an attempt to address the optimal inertia placement problem. We consider a linear network-reduced power system model along with an H2 performance metric accounting for the network coherency. The optimal inertia placement problem turns out to be non-convex, yet we provide a set of closed-form global optimality results for particular problem instances as well as a computational approach resulting in locally optimal solutions. Further, we also consider the robust inertia allocation problem, wherein the optimization is carried out accounting for the worst-case disturbance location. We illustrate our results with a three-region power grid case study and compare our locally optimal solution with different placement heuristics in terms of different performance metrics.

math.OC↗