Filippo Fabiani

Dr. Filippo Fabiani

Department of Engineering Science, University of Oxford, Oxford OX1 3PJ, UK

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 March 2019 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
Filippo FabianiFilippo Fabiani
Filippo Fabiani
SGSergio Grammatico
Sergio Grammatico

25 October 2022 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
Filippo FabianiFilippo Fabiani
Filippo Fabiani
PGPaul J. Goulart
Paul J. Goulart
A common problem affecting neural network (NN) approximations of model predictive control (MPC) policies is the lack of analytical tools to assess the stability of the closed-loop system under the action of the NN-based controller. We present a general procedure to quantify the performance of such a controller, or to design minimum complexity NNs with rectified linear units (ReLUs) that preserve the desirable properties of a given MPC scheme. By quantifying the approximation error between NN-based and MPC-based state-to-input mappings, we first establish suitable conditions involving two key quantities, the worst-case error and the Lipschitz constant, guaranteeing the stability of the closed-loop system. We then develop an offline, mixed-integer optimization-based method to compute those quantities exactly. Together these techniques provide conditions sufficient to certify the stability and performance of a ReLU-based approximation of an MPC control law.

6 May 2021 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
Filippo FabianiFilippo Fabiani
Filippo Fabiani
MTMohammad Amin Tajeddini
Mohammad Amin Tajeddini
HKHamed Kebriaei
Hamed Kebriaei
SGSergio Grammatico
Sergio Grammatico
We propose a two-layer, semidecentralized algorithm to compute a local solution to the Stackelberg equilibrium problem in aggregative games with coupling constraints. Specifically, we focus on a single-leader, multiple-follower problem, and after equivalently recasting the Stackelberg game as a mathematical program with complementarity constraints (MPCC), we iteratively convexify a regularized version of the MPCC as the inner problem, whose solution generates a sequence of feasible descent directions for the original MPCC. Thus, by pursuing a descent direction at every outer iteration, we establish convergence to a local Stackelberg equilibrium. Finally, the proposed algorithm is tested on a numerical case study, a hierarchical instance of the charging coordination problem of plug-in electric vehicles.

22 February 2024 in IEEE Transactions on Automatic Control
Verified
Journal Article
Open access
GCGuido Carnevale
Guido Carnevale
Filippo FabianiFilippo Fabiani
Filippo Fabiani
Filiberto FeleFiliberto Fele
Filiberto Fele
KMKostas Margellos
Kostas Margellos
GNGiuseppe Notarstefano
Giuseppe Notarstefano
We propose fully-distributed algorithms for Nash equilibrium seeking in aggregative games over networks. We first consider the case where local constraints are present and we design an algorithm combining, for each agent, (i) the projected pseudo-gradient descent and (ii) a tracking mechanism to locally reconstruct the aggregative variable. To handle coupling constraints arising in generalized settings, we propose another distributed algorithm based on (i) a recently emerged augmented primal-dual scheme and (ii) two tracking mechanisms to reconstruct, for each agent, both the aggregative variable and the coupling constraint satisfaction. Leveraging tools from singular perturbations analysis, we prove linear convergence to the Nash equilibrium for both schemes. Finally, we run extensive numerical simulations to confirm the effectiveness of our methods and compare them with state-of-the-art distributed equilibrium-seeking algorithms.

6 August 2014 in Autonomous Robots
Verified
Journal Article
Closed access
PDF file
SMStefano Mintchev
Stefano Mintchev
RRRaffaele Ranzani
Raffaele Ranzani
Filippo FabianiFilippo Fabiani
Filippo Fabiani
CSCesare Stefanini
Cesare Stefanini

25 May 2018 in IEEE Control Systems Letters
Verified
Journal Article
Closed access
GBGiuseppe Belgioioso
Giuseppe Belgioioso
Filippo FabianiFilippo Fabiani
Filippo Fabiani
FBFranco Blanchini
Franco Blanchini
SGSergio Grammatico
Sergio Grammatico
We adopt an operator-theoretic perspective to study convergence of linear fixed-point iterations and discrete-time linear systems. We mainly focus on the so-called Krasnoselskij–Mann iteration, x(k+1)=(1-αk)x(k)+αkAx(k), which is relevant for distributed computation in optimization and game theory, when A is not available in a centralized way. We show that strict pseudocontractiveness of the linear operator x→Ax is not only sufficient (as known) but also necessary for the convergence to a vector in the kernel of Ix–A. We also characterize some relevant operator-theoretic properties of linear operators via eigenvalue location and linear matrix inequalities. We apply the convergence conditions to multi-agent linear systems with vanishing step sizes, in particular, to linear consensus dynamics and equilibrium seeking in monotone linear-quadratic games.