微分可能な逐次意思決定問題においてエージェントはいつ協調すべきか
When Should Agents Coordinate in Differentiable Sequential Decision Problems?
微分可能な運動計画問題において、協調行動をスペクトルとしてモデル化し、目的関数の二階特性に基づいて協調すべきタイミングを決定するアルゴリズムを提案した。
詳しい要約
1. どんなもの？
2. 先行研究と比べてどこがすごい？
3. 技術・手法の肝は？
4. どうやって有効だと検証した？
5. 議論はある？
6. 次に読むべき論文は？
※ AIが要旨から生成した要約です。正確性は原文をご確認ください。
著者: Caleb Probine, Su Ann Low, David Fridovich-Keil, Ufuk Topcu
分類: cs.MA, cs.GT, cs.RO, math.OC
原文アブストラクト
Multi-robot teams must coordinate to operate effectively. When a team operates in an uncoordinated manner, and agents choose actions that are only individually optimal, the team's outcome can suffer. However, in many domains, coordination requires costly communication. We explore the value of coordination in a broad class of differentiable motion-planning problems. In particular, we model coordinated behavior as a spectrum: at one extreme, agents jointly optimize a common team objective, and at the other, agents make unilaterally optimal decisions given their individual decision variables, i.e., they operate at Nash equilibria. We then demonstrate that reasoning about coordination in differentiable motion-planning problems reduces to reasoning about the second-order properties of agents' objectives, and we provide algorithms that use this second-order reasoning to determine at which times a team of agents should coordinate.
