Algames: A fast solver for constrained dynamic games

SL Cleac'h, M Schwager, Z Manchester - arXiv preprint arXiv:1910.09713, 2019 - arxiv.org
arXiv preprint arXiv:1910.09713, 2019arxiv.org
Dynamic games are an effective paradigm for dealing with the control of multiple interacting
actors. This paper introduces ALGAMES (Augmented Lagrangian GAME-theoretic Solver), a
solver that handles trajectory optimization problems with multiple actors and general
nonlinear state and input constraints. Its novelty resides in satisfying the first order optimality
conditions with a quasi-Newton root-finding algorithm and rigorously enforcing constraints
using an augmented Lagrangian formulation. We evaluate our solver in the context of …
Dynamic games are an effective paradigm for dealing with the control of multiple interacting actors. This paper introduces ALGAMES (Augmented Lagrangian GAME-theoretic Solver), a solver that handles trajectory optimization problems with multiple actors and general nonlinear state and input constraints. Its novelty resides in satisfying the first order optimality conditions with a quasi-Newton root-finding algorithm and rigorously enforcing constraints using an augmented Lagrangian formulation. We evaluate our solver in the context of autonomous driving on scenarios with a strong level of interactions between the vehicles. We assess the robustness of the solver using Monte Carlo simulations. It is able to reliably solve complex problems like ramp merging with three vehicles three times faster than a state-of-the-art DDP-based approach. A model predictive control (MPC) implementation of the algorithm demonstrates real-time performance on complex autonomous driving scenarios with an update frequency higher than 60 Hz.
arxiv.org
以上显示的是最相近的搜索结果。 查看全部搜索结果