arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2410.05554cs.RO
收藏

MultiNash-PF:一种用于计算轨迹博弈中多个局部广义纳什均衡的粒子滤波方法

MultiNash-PF: A Particle Filtering Approach for Computing Multiple Local Generalized Nash Equilibria in Trajectory Games

University of California, Berkeley(加州大学伯克利分校);University of Kansas(堪萨斯大学);University of Minnesota(明尼苏达大学);University of Texas at Austin(德克萨斯大学奥斯汀分校)

Maulik Bhatt, Iman Askari, Yue Yu, Ufuk Topcu, Huazhen Fang, Negar Mehr

AI总结:

提出MultiNash-PF算法,通过将势博弈与隐式粒子滤波结合,高效计算轨迹博弈中的多个局部广义纳什均衡,显著减少计算时间并成功应用于多模态人机交互场景。

摘要:

现代机器人系统经常参与复杂的多智能体交互,其中许多交互本质上是多模态的,即它们可能导致多个不同的结果。为了有效交互,机器人必须识别可能的交互模式,并适应其他智能体偏好的模式。在本研究中,我们提出了MultiNash-PF,一种用于捕捉多智能体交互中多模态性的高效算法。我们将交互结果建模为博弈论规划器的均衡,其中每个均衡对应一个独特的交互模式。我们的框架将交互式规划表述为受约束势轨迹博弈(CPTGs),其中局部广义纳什均衡(GNEs)代表合理的交互结果。我们提出将势博弈方法与隐式粒子滤波相结合,后者是一种用于非凸轨迹优化的样本高效方法。我们利用隐式粒子滤波来识别博弈势函数的多个局部极小值的粗略估计。MultiNash-PF随后通过优化求解器细化这些估计,获得不同的局部GNEs。我们通过数值模拟表明,与基线相比,MultiNash-PF将计算时间减少了高达50%。我们进一步在真实世界的人机交互场景中展示了算法的有效性,它成功考虑了交互的多模态性质,并实时解决了潜在冲突。

英文摘要:

Modern robotic systems frequently engage in complex multi-agent interactions, many of which are inherently multi-modal, i.e., they can lead to multiple distinct outcomes. To interact effectively, robots must recognize the possible interaction modes and adapt to the one preferred by other agents. In this work, we propose MultiNash-PF, an efficient algorithm for capturing the multimodality in multi-agent interactions. We model interaction outcomes as equilibria of a game-theoretic planner, where each equilibrium corresponds to a distinct interaction mode. Our framework formulates interactive planning as Constrained Potential Trajectory Games (CPTGs), in which local Generalized Nash Equilibria (GNEs) represent plausible interaction outcomes. We propose to integrate the potential game approach with implicit particle filtering, a sample-efficient method for non-convex trajectory optimization. We utilize implicit particle filtering to identify the coarse estimates of multiple local minimizers of the game's potential function. MultiNash-PF then refines these estimates with optimization solvers, obtaining different local GNEs. We show through numerical simulations that MultiNash-PF reduces computation time by up to 50\% compared to a baseline. We further demonstrate the effectiveness of our algorithm in real-world human-robot interaction scenarios, where it successfully accounts for the multi-modal nature of interactions and resolves potential conflicts in real-time.

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

↑