2026-09-18T19:14:55Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/1563242024-08-22T03:31:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

Jadbabaie, Ali Pfrommer, Daniel Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science 2024-08-21T18:56:50Z 2024-08-21T18:56:50Z 2024-05 2024-07-10T12:59:49.043Z https://hdl.handle.net/1721.1/156324 Recent work in imitation learning has shown that having an expert controller that is both suitably smooth and stable enables much stronger guarantees on the performance of the approximating learned controller. Constructing such smoothed expert controllers for arbitrary systems remains challenging, especially in the presence of input and state constraints. We show how such a smoothed expert can be designed for a general class of systems using a log-barrier-based relaxation of a standard Model Predictive Control (MPC) optimization problem. Our principal theoretical contributions include (1) demonstrating that the Jacobian of the barrier MPC controller can be written as a convex combination of pieces arising from the explicit MPC formulation, (2) bounding the Hessian of the barrier MPC as a function of the strength of the barrier function, and (3) presenting new results in both matrix and convex analysis for computing perturbed adjugate matrices and a tight (up to constant) lower bound on the distance of a solution with a self-concordant-barrier to the constraint set. We consider randomized smoothing as a point of comparison and show empirically that, unlike randomized smoothing, barrier MPC yields better performance while guaranteeing constraint satisfaction. S.M. Massachusetts Institute of Technology In Copyright - Educational Use Permitted Copyright retained by author(s) https://rightsstatements.org/page/InC-EDU/1.0/ On the Sample Complexity of Imitation Learning for Smoothed Model Predictive Control Thesis application/pdf Master Master of Science in Electrical Engineering and Computer Science Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="8f8c1d2e-0f51-4906-be1f-a5b2e47012d5"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Title>On the Sample Complexity of Imitation Learning for Smoothed Model Predictive Control</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2024-05</PublicationDate> <Authors> <Author> <DisplayName>Pfrommer, Daniel</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>https://rightsstatements.org/page/InC-EDU/1.0/</License> <Abstract>Recent work in imitation learning has shown that having an expert controller that is both suitably smooth and stable enables much stronger guarantees on the performance of the approximating learned controller. Constructing such smoothed expert controllers for arbitrary systems remains challenging, especially in the presence of input and state constraints. We show how such a smoothed expert can be designed for a general class of systems using a log-barrier-based relaxation of a standard Model Predictive Control (MPC) optimization problem. Our principal theoretical contributions include (1) demonstrating that the Jacobian of the barrier MPC controller can be written as a convex combination of pieces arising from the explicit MPC formulation, (2) bounding the Hessian of the barrier MPC as a function of the strength of the barrier function, and (3) presenting new results in both matrix and convex analysis for computing perturbed adjugate matrices and a tight (up to constant) lower bound on the distance of a solution with a self-concordant-barrier to the constraint set. We consider randomized smoothing as a point of comparison and show empirically that, unlike randomized smoothing, barrier MPC yields better performance while guaranteeing constraint satisfaction.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>