Search arXivSearch

arXiv · 2009.02248

Fast Zonotope-Tube-based LPV-MPC for Autonomous Vehicles

Abstract

In this paper, we present an effective online tube-based model predictive control (T-MPC) solution for autonomous driving that aims at improving the computational load while ensuring robust stability and performance in fast and disturbed scenarios. We focus on reformulating the non-linear original problem into a pseudo-linear problem by transforming the non-linear vehicle equations to be expressed in a Linear Parameter Varying (LPV) form. An scheme composed by a nominal controller and a corrective local controller is propossed. First, the local controller is designed as a polytopic LPV-H$_{\infty}$ controller able to reject external disturbances. Moreover, a finite number of accurate reachable sets, also called tube, are computed online using zonotopes taking into account the system dynamics, the local controller and the diturbance-uncertainty bounds considered. Second, the nominal controller is designed as an MPC where the LPV vehicle model is used to speed up the computational time while keeping accurate vehicle representation. Employing reachability theory with zonotopes, the MPC changes online its state and input constraints to ensure robust feasibility and stability under exhogenous disturbances. Finally, we test the presented scheme and compare the local controller performance against the LQR design as state of the art approach. We demonstrate its effectiveness in a disturbed fast driving scenario being able to reject strong exogenous disturbances and fulfilling imposed constraints at a very reduced computational cost.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eugenio Alcala, Vicenc Puig, Joseba Quevedo, Olivier Sename. 2020-09-04. Fast Zonotope-Tube-based LPV-MPC for Autonomous Vehicles. https://arxiv.org/abs/2009.02248

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Observability and parameter estimation of a generic model for aggregated distributed energy resources

We propose a novel framework for estimating the parameters of an aggregated distributed energy resources (DER A) model. First, we introduce a rigorous method to determine whether all model parameters are estimable. When they are not, our approach identifies the subset of parameters that can be estimated. The proposed framework offers new insights into the number and specific parameters that can be reliably estimated based on commonly available measurements. It also highlights the limitations of calibrating such models. Second, we introduce a Kalman filtering method to calibrate the DER A model. Since we account for nonlinear effects such as saturation and deadbands, we develop a specific mechanism to handle smoothing functions within the Kalman filter. Specifically, we consider the extended and the unscented Kalman filter. We demonstrate the effectiveness of the proposed framework on a modified IEEE 34-node distribution feeder with inverter- based resources. Our findings align with the North American Electric Reliability Corporation's parameterization guideline and underscore the importance of model calibration in accurately capturing the collective dynamics of distributed energy resources installed on distribution systems.

eess.SY

Salted Fisher Information for Hybrid Systems

Discrete events change how parameter-influence propagates in hybrid systems. Prevailing Fisher information for- mulations assume that sensitivities evolve smoothly according to continuous-time variational equations and therefore neglect the sensitivity updates induced by discrete events. This paper derives a Fisher information matrix formulation compatible with hybrid systems. To do so, we use the saltation matrix, which encodes the first-order transformation of sensitivities induced by discrete events. We call the resulting formulation the salted Fisher information matrix (SFIM). The proposed framework unifies continuous information accumulation during flows with discrete updates at event times. We also show that hybrid persistence of excitation is sufficient for the SFIM to be positive definite

eess.SY

Min-Max Grassmannian Optimization for Online Subspace Tracking

We propose GeRoST (Geometrically Robust Subspace Tracking), an online subspace tracking algorithm that models uncertainty in a subspace using a Grassmannian ball. We derive an exact scalar dual for the worst-case subspace problem, establish conditions for a unique worst-case subspace and a Riemannian gradient, and characterize the minimum radius needed to cover a dimensional extension of the target subspace. Each update uses either a spectral direction computed in a reduced subspace or the gradient of the window reconstruction loss. Our numerical experiments show that GeRoST achieves lower mean post-fault prediction error than GREAT in system identification. In video separation, it achieves higher precision and a better precision--recall balance, as measured by the F$_1$ score, than both GREAT and GRASTA at the reported thresholds, with lower recall and longer runtime.

eess.SY