Home /Research /Policy Iteration for Linear Quadratic Games With Stochastic Parameters
OTHER

Policy Iteration for Linear Quadratic Games With Stochastic Parameters

Benjamin Gravell, Karthik Ganapathy, Tyler Summers

Year
2020
Citations
23

Abstract

Robustness is a key challenge in the integration of learning and control. In machine learning and robotics, two common approaches to promote robustness are adversarial training and domain randomization. Both of these approaches have analogs in control theory: adversarial training relates to H <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub> control and dynamic game theory, while domain randomization relates to theory for systems with stochastic model parameters. We propose a stochastic dynamic game framework that integrates both of these complementary approaches to modeling uncertainty and promoting robustness. We describe policy iteration algorithms in both model-based and model-free settings to compute equilibrium strategies and value functions. We present numerical experiments that illustrate their effectiveness and the value of combining uncertainty representations in our integrated framework. We also provide an open-source implementation of the algorithms to facilitate their wider use.

Keywords

Robustness (evolution)Computer scienceMathematical optimizationAdversarial systemArtificial intelligenceRoboticsGame theoryQuadratic equationMachine learningTheoretical computer science

Related papers

Browse all OTHER papers