Inherently Robust Suboptimal MPC for Autonomous Racing With Anytime Feasible SQP
METADATA ONLY
Loading...
Author / Producer
Date
2024-07
Publication Type
Journal Article
ETH Bibliography
yes
Citations
Altmetric
METADATA ONLY
Data
Rights / License
Abstract
In this paper, we propose an efficient inexact model predictive control (MPC) strategy for autonomous miniature racing with inherent robustness properties. We rely on a feasible sequential quadratic programming (SQP) algorithm capable of generating feasible intermediate iterates such that the solver can be stopped after any number of iterations, without jeopardizing recursive feasibility. Furthermore, we present the design of suitable terminal ingredients and prove how their combination with the solver ensures constraint satisfaction for any sufficiently small disturbance affecting the system’s dynamics. We validate the effectiveness of the proposed strategy in simulation and by deploying it in a physical experiment with autonomous miniature race cars.
Permanent link
Publication status
published
External links
Editor
Book title
Journal / series
Volume
9 (7)
Pages / Article No.
6616 - 6623
Publisher
IEEE
Event
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Autonomous agents; dynamics; optimization and optimal control
Organisational unit
09563 - Zeilinger, Melanie / Zeilinger, Melanie