论文标题
最佳参数化MPC成本函数的最佳方法是什么?
What is the Best Way to Optimally Parameterize the MPC Cost Function for Vehicle Guidance?
论文作者
论文摘要
模型预测控制(MPC)是对自动驾驶汽车的侧面和纵向控制的有前途的方法。但是,MPC在高级要求方面的参数化,例如乘客舒适以及横向跟踪和纵向跟踪是一项艰巨的任务。需要考虑大量的调整参数以及相互矛盾的要求。此贡献将MPC调整任务制定为多目标优化问题。解决它的挑战是有两个原因:首先,在计算昂贵的模拟环境中评估MPC参数。结果,使用的优化算法需要尽可能采样效率。其次,对于某些较差的参数化,无法完成仿真,因此无法获得有用的目标函数值(通过碰撞约束学习)。在此贡献中,我们比较了多目标粒子群优化(MOPSO),遗传算法(NSGA-II)和多个版本的贝叶斯优化(BO)的样品效率。我们通过引入自适应批次大小来扩展BO,以限制计算开销以及如何处理崩溃约束的方法。结果表明,BO最适合少量预算,NSGA-II最适合中等预算,而对于大预算,没有评估的优化器优于随机搜索。两种建议的BO扩展都显示为有益。
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.