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.
We characterize the maximum controlled invariant (MCI) set for discrete-time systems as the solution of an infinite-dimensional linear programming problem. In the case of systems with polynomial dynamics and semialgebraic state and control constraints, we ...
We propose a decentralized method for traffic monitoring, fully distributed over the vehicles. An algorithm is provided, specifying which information should be tracked to reconstruct an instantaneous map of traffic flow. We test the accuracy of our method ...
This paper proposes to use Nesterov's fast gradient method for the solution of linear quadratic model predictive control (MPC) problems with input constraints. The main focus is on the method's a priori computational complexity certification which consists ...
Institute of Electrical and Electronics Engineers2012
In this chapter an algorithm for nonlinear explicit model predictive control is presented. A low complexity receding horizon control law is obtained by approximating the optimal control law using multiscale basis function approximation. Simultaneously, fea ...
Receding horizon control requires the solution of an optimization problem at every sampling instant. We present efficient interior point methods tailored to convex multistage problems, a problem class which most relevant MPC problems with linear dynamics c ...
We present a linear programming based method to design time varying routing strategies for positive conservative compartmental systems to satisfy piecewise constant capacity constraints. Such systems can be used to describe the flow of material through a n ...
In this paper, we provide the first linear programming formulations for the stable set problem in claw-free graphs, together with polynomial time separation routines for those formulations (they are not compact). We then exploit one of those extended formu ...
Localization microscopy such as STORM/PALM achieves the super-resolution by sparsely activating photo-switchable probes. However, to make the activation sparse enough to obtain reconstruction images using conventional algorithms, only small set of probes n ...
Receding horizon control requires the solution of an optimization problem at every sampling instant. We present efficient interior point methods tailored to convex multistage problems, a problem class which most relevant MPC problems with linear dynamics c ...
We prove the following version of Poincaré, duality for reduced L (q,p) -cohomology: For any 1 < q, p < a, the Lqp -cohomology of a Riemannian manifold is in duality with the interior Lp'q'-cohomology for 1/p + 1/p' = 1/q + 1/q' = 1. ...
