Pith. sign in

REVIEW

What is the Best Way to Optimally Parameterize the MPC Cost Function for Vehicle Guidance?

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2212.06561 v1 pith:7LOKNT6S submitted 2022-12-11 eess.SY cs.SY

What is the Best Way to Optimally Parameterize the MPC Cost Function for Vehicle Guidance?

classification eess.SY cs.SY
keywords optimizationbestalgorithmbudgetschallengingconstraintscontributioncontrol
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Model predictive control (MPC) is a promising approach for the lateral and longitudinal control of autonomous vehicles. However, the parameterization of the MPC with respect to high-level requirements such as passenger comfort as well as lateral and longitudinal tracking is a challenging task. Numerous tuning parameters as well as conflicting requirements need to be considered. This contribution formulates the MPC tuning task as a multi-objective optimization problem. Solving it is challenging for two reasons: First, MPC-parameterizations are evaluated on an computationally expensive simulation environment. As a result, the used optimization algorithm needs to be as sampleefficient as possible. Second, for some poor parameterizations the simulation cannot be completed and therefore useful objective function values are not available (learning with crash constraints). In this contribution, we compare the sample efficiency of multi-objective particle swarm optimization (MOPSO), a genetic algorithm (NSGA-II) and multiple versions of Bayesian optimization (BO). We extend BO, by introducing an adaptive batch size to limit the computational overhead and by a method on how to deal with crash constraints. Results show, that BO works best for a small budget, NSGA-II is best for medium budgets and for large budgets none of the evaluated optimizers is superior to random search. Both proposed BO extensions are shown to be beneficial.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.