部分観測軌道ゲームにおけるオンライン競合情報収集
Online Competitive Information Gathering for Partially Observable Trajectory Games
部分観測確率ゲームを有限履歴・有限ホライズンで近似し、粒子ベース推定と確率的勾配プレイを用いてオンラインで競合的な情報収集軌道計画を計算する手法を提案した。
詳しい要約
1. どんなもの?
2. 先行研究と比べてどこがすごい?
3. 技術・手法の肝は?
4. どうやって有効だと検証した?
5. 議論はある?
6. 次に読むべき論文は?
※ AIが要旨から生成した要約です。正確性は原文をご確認ください。
著者: Mel Krusniak, Hang Xu, Parker Palermo, Forrest Laine
分類: cs.GT, cs.AI, cs.MA, cs.RO
原文アブストラクト
Game-theoretic agents must make plans that optimally gather information about their opponents. These problems are modeled by partially observable stochastic games (POSGs), but planning in fully continuous POSGs is intractable without heavy offline computation or assumptions on the order of belief maintained by each player. We formulate a finite history/horizon refinement of POSGs which admits competitive information gathering behavior in trajectory space, and through a series of approximations, we present an online method for computing rational trajectory plans in these games which leverages particle-based estimations of the joint state space and performs stochastic gradient play. We also provide the necessary adjustments required to deploy this method on individual agents. The method is tested in continuous pursuit-evasion and warehouse-pickup scenarios (alongside extensions to $N > 2$ players and to more complex environments with visual and physical obstacles), demonstrating evidence of active information gathering and outperforming passive competitors.
