arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.12925math.OCcs.RO
收藏

多模态最大熵动态对策

Multimodal Maximum Entropy Dynamic Games

Georgia Institute of Technology(佐治亚理工学院)

Oswin So, Kyle Stachowicz, Evangelos A. Theodorou

摘要:

多代理交互的环境往往会导致代理之间的行为模式,由于固有的次优的决策过程时,代理解决满意的决定。然而,现有的算法来解决这些动态游戏是严格的单峰,并未能捕捉到复杂的多模态行为的代理。在本文中,我们提出了MMELQGames(多模态最大熵线性二次博弈),一个新的约束多模态最大熵制定的微分动态规划算法求解广义纳什均衡。通过将问题制定为具有不完全和不对称信息的特定动态博弈,其中代理人不确定博弈本身的成本和动态,所提出的方法能够推理多个局部广义纳什均衡,使用增广拉格朗日框架强制约束,并且还可以根据过去的观察对潜在模式进行贝叶斯推断。我们评估所提出的算法在两个说明性的例子:多智能体碰撞避免和自主赛车的功效。特别是,我们表明,只有MMELQGames是能够有效地阻止后方车辆时,给定的速度劣势和后方车辆可以从多个位置超车。

英文摘要:

Environments with multi-agent interactions often result a rich set of modalities of behavior between agents due to the inherent suboptimality of decision making processes when agents settle for satisfactory decisions. However, existing algorithms for solving these dynamic games are strictly unimodal and fail to capture the intricate multimodal behaviors of the agents. In this paper, we propose MMELQGames (Multimodal Maximum-Entropy Linear Quadratic Games), a novel constrained multimodal maximum entropy formulation of the Differential Dynamic Programming algorithm for solving generalized Nash equilibria. By formulating the problem as a certain dynamic game with incomplete and asymmetric information where agents are uncertain about the cost and dynamics of the game itself, the proposed method is able to reason about multiple local generalized Nash equilibria, enforce constraints with the Augmented Lagrangian framework and also perform Bayesian inference on the latent mode from past observations. We assess the efficacy of the proposed algorithm on two illustrative examples: multi-agent collision avoidance and autonomous racing. In particular, we show that only MMELQGames is able to effectively block a rear vehicle when given a speed disadvantage and the rear vehicle can overtake from multiple positions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑