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.
This paper presents a method to solve the constrained infinite-time linear quadratic regulator (LQR) problem. We use an operator splitting technique, namely the alternating minimization algorithm (AMA), to split the problem into an unconstrained LQR problem and a projection step, which are solved repeatedly, with the solution of one influencing the other. The first step amounts to the solution of a system of linear equations (with the possibility to pre-factor) and the second step is a simple clipping. Therefore, each step can be carried out efficiently. The scheme is proven to converge to the solution to the infinite-time constrained LQR problem and is illustrated by numerical examples.
Stefano Alberti, Jean-Philippe Hogge, Joaquim Loizu Cisquella, Jérémy Genoud, Francesco Romano, Guillaume Michel Le Bars