一般化ナッシュ均衡から学ぶ2エージェント運動計画戦略のMPC
Learning Two-agent Motion Planning Strategies from Generalized Nash Equilibrium for Model Predictive Control
制約付き動的ゲームの一般化ナッシュ均衡をデータとして学習し、その報酬予測をMPCの終端コストに用いる分散型2エージェント運動計画法を提案。
著者: Hansung Kim, Edward L. Zhu, Chang Seok Lim, Francesco Borrelli
分類: cs.MA, cs.RO, cs.SY, eess.SY
原文アブストラクト
We introduce an Implicit Game-Theoretic MPC (IGT-MPC), a decentralized algorithm for two-agent motion planning that uses a learned value function that predicts the game-theoretic interaction outcomes as the terminal cost-to-go function in a model predictive control (MPC) framework, guiding agents to implicitly account for interactions with other agents and maximize their reward. This approach applies to competitive and cooperative multi-agent motion planning problems which we formulate as constrained dynamic games. Given a constrained dynamic game, we randomly sample initial conditions and solve for the generalized Nash equilibrium (GNE) to generate a dataset of GNE solutions, computing the reward outcome of each game-theoretic interaction from the GNE. The data is used to train a simple neural network to predict the reward outcome, which we use as the terminal cost-to-go function in an MPC scheme. We showcase emerging competitive and coordinated behaviors using IGT-MPC in scenarios such as two-vehicle head-to-head racing and un-signalized intersection navigation. IGT-MPC offers a novel method integrating machine learning and game-theoretic reasoning into model-based decentralized multi-agent motion planning.
関連論文
- ロボサッカーチームのためのスケーラブルで俊敏な動的運動計画の学習に向けた方策最適化マルチエージェント運動計画
- 拡散モデルと強化学習を統合した階層型追跡回避ゲームの運動計画マルチエージェント運動計画
