Publication

Real-Time Distributed Algorithms for Nonconvex Optimal Power Flow

Publications associées (30)

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...

EPFL2023

Fluid-structure interactions of bristled wings: the trade-off between weight and drag

Pedro Miguel Nunes Pereira de Almeida Reis, Matteo Pezzulla, Yuexia Luna Lin

The smallest flying insects often have bristled wings resembling feathers or combs. We combined experiments and three-dimensional numerical simulations to investigate the trade-off between wing weight and drag generation. In experiments of bristled strips, ...

Royal Soc2023

Data-Driven Control and Optimization under Noisy and Uncertain Conditions

Baiwei Guo

Control systems operating in real-world environments often face disturbances arising from measurement noise and model mismatch. These factors can significantly impact the perfor- mance and safety of the system. In this thesis, we aim to leverage data to de ...

EPFL2023

Training Efficient Controllers via Analytic Policy Gradient

Dario Floreano, Davide Scaramuzza, Valentin Wüest

Control design for robotic systems is complex and often requires solving an optimization to follow a trajectory accurately. Online optimization approaches like Model Predictive Control (MPC) have been shown to achieve great tracking performance, but requir ...

New York2023

lifex-ep: a robust and efficient software for cardiac electrophysiology simulations

Alfio Quarteroni, Francesco Regazzoni, Marco Fedele, Stefano Pagani

Background: Simulating the cardiac function requires the numerical solution of multi-physics and multi-scale mathematical models. This underscores the need for streamlined, accurate, and high-performance computational tools. Despite the dedicated endeavors ...

BMC2023

Lessons Learned from Data-Driven Building Control Experiments: Contrasting Gaussian Process-based MPC, Bilevel DeePC, and Deep Reinforcement Learning

Colin Neil Jones, Loris Di Natale, Yingzhao Lian, Emilio Maddalena, Jicheng Shi

This manuscript offers the perspective of experimentalists on a number of modern data-driven techniques: model predictive control relying on Gaussian processes, adaptive data-driven control based on behavioral theory, and deep reinforcement learning. These ...

2023

Reinforcement learning approach to control an inverted pendulum: A general framework for educational purposes

Jesus Sanchez Rodriguez

Machine learning is often cited as a new paradigm in control theory, but is also often viewed as empirical and less intuitive for students than classical model-based methods. This is particularly the case for reinforcement learning, an approach that does n ...

PUBLIC LIBRARY SCIENCE2023

A Proximal-Point Lagrangian-Based Parallelizable Nonconvex Solver for Bilinear Model Predictive Control

Colin Neil Jones, Yingzhao Lian, Yuning Jiang

Nonlinear model predictive control (NMPC) has been widely adopted to manipulate bilinear systems with dynamics that include products of the inputs and the states. These systems are ubiquitous in chemical processes, mechanical systems, and quantum physics, ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

Flexible High Power Electronics Solutions for Hydro-Power Applications

Philippe Alexandre Bontemps

The current global energy landscape is characterized by an increasing demand for affordable and sustainable energy sources, leading to an ever increasing integration of intermittent renewable energy resources into the grid. The intermittent nature of these ...

EPFL2023

Results on Sparse Integer Programming and Geometric Independent Sets

Jana Tabea Cslovjecsek

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

EPFL2023