Maryam Nezami, Dimitrios S. Karachalios, Georg Schildbach, Hossam S. Abbas
{"title":"Obstacle Avoidance of Autonomous Vehicles: An LPVMPC with Scheduling Trust Region","authors":"Maryam Nezami, Dimitrios S. Karachalios, Georg Schildbach, Hossam S. Abbas","doi":"arxiv-2405.02030","DOIUrl":null,"url":null,"abstract":"Reference tracking and obstacle avoidance rank among the foremost challenging\naspects of autonomous driving. This paper proposes control designs for solving\nreference tracking problems in autonomous driving tasks while considering\nstatic obstacles. We suggest a model predictive control (MPC) strategy that\nevades the computational burden of nonlinear nonconvex optimization methods\nafter embedding the nonlinear model equivalently to a linear parameter-varying\n(LPV) formulation using the so-called scheduling parameter. This allows optimal\nand fast solutions of the underlying convex optimization scheme as a quadratic\nprogram (QP) at the expense of losing some performance due to the uncertainty\nof the future scheduling trajectory over the MPC horizon. Also, to ensure that\nthe modeling error due to the application of the scheduling parameter\npredictions does not become significant, we propose the concept of scheduling\ntrust region by enforcing further soft constraints on the states and inputs. A\nconsequence of using the new constraints in the MPC is that we construct a\nregion in which the scheduling parameter updates in two consecutive time\ninstants are trusted for computing the system matrices, and therefore, the\nfeasibility of the MPC optimization problem is retained. We test the method in\ndifferent scenarios and compare the results to standard LPVMPC as well as\nnonlinear MPC (NMPC) schemes.","PeriodicalId":501062,"journal":{"name":"arXiv - CS - Systems and Control","volume":"37 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Systems and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2405.02030","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Reference tracking and obstacle avoidance rank among the foremost challenging
aspects of autonomous driving. This paper proposes control designs for solving
reference tracking problems in autonomous driving tasks while considering
static obstacles. We suggest a model predictive control (MPC) strategy that
evades the computational burden of nonlinear nonconvex optimization methods
after embedding the nonlinear model equivalently to a linear parameter-varying
(LPV) formulation using the so-called scheduling parameter. This allows optimal
and fast solutions of the underlying convex optimization scheme as a quadratic
program (QP) at the expense of losing some performance due to the uncertainty
of the future scheduling trajectory over the MPC horizon. Also, to ensure that
the modeling error due to the application of the scheduling parameter
predictions does not become significant, we propose the concept of scheduling
trust region by enforcing further soft constraints on the states and inputs. A
consequence of using the new constraints in the MPC is that we construct a
region in which the scheduling parameter updates in two consecutive time
instants are trusted for computing the system matrices, and therefore, the
feasibility of the MPC optimization problem is retained. We test the method in
different scenarios and compare the results to standard LPVMPC as well as
nonlinear MPC (NMPC) schemes.