Optimal decision trees for point location in polytopic data sets - application to explicit MPC
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Optimization-based controllers are advanced control systems whose mechanism of determining control inputs requires the solution of a mathematical optimization problem. In this thesis, several contributions related to the computational effort required for o ...
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 ...
This paper describes synthesis of controllers involving Quadratic Programming (QP) optimization problems for control of nonlinear systems. The QP structure allows an implementation of the controller as a piecewise affine function, pre-computed offline, whi ...
In this paper, we present a spatial branch and bound algorithm to tackle the continuous pricing problem, where demand is captured by an advanced discrete choice model (DCM). Advanced DCMs, like mixed logit or latent class models, are capable of modeling de ...
One of the main goal of Artificial Intelligence is to develop models capable of providing valuable predictions in real-world environments. In particular, Machine Learning (ML) seeks to design such models by learning from examples coming from this same envi ...
The metric dimension of a graph G is the minimal size of a subset R of vertices of G that, upon reporting their graph distance from a distinguished (source) vertex v⋆, enable unique identification of the source vertex v⋆ among all possible vertices of G. I ...
Recently, a new data-driven method for robust control with H-infinity performance has been proposed. This method is based on convex optimization and converges to the optimal performance when the controller order increases. However, for low-order controller ...
Many robotics problems are formulated as optimization problems. However, most optimization solvers in robotics are locally optimal and the performance depends a lot on the initial guess. For challenging problems, the solver will often get stuck at poor loc ...
We study finite horizon optimal control where the controller is subject to sensor-information constraints, that is, each input has access to a fixed subset of states at all times. In particular, we consider linear systems affected by exogenous disturbances ...
An alternative approach for real-time network- wide traffic control in cities that has recently gained a lot of interest is perimeter flow control. The focus of the current work is to study two aspects that are not covered in the perimeter control literatu ...
