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

赛车场景中移动机器人的竞争感知决策方法

Competition-Aware Decision-Making Approach for Mobile Robots in Racing Scenarios

Kyungpook National University(庆北国立大学);Honda Research Institute USA, Inc.(美国本田研究院);Auburn University(奥本大学)

Kyoungtae Ji, Sangjae Bae, Nan Li, Kyoungseok Han

AI总结:

本文提出一种基于 level-K 推理和轨迹混合策略的竞争感知决策方法,用于赛车场景中 ego 智能体在线估计对手行为并有效阻挡超车,实验证明其成功率优于常规 level-K 框架。

摘要:

本文提出了一种用于赛车的博弈论策略,其中自主 ego 智能体试图阻挡一个旨在超越 ego 智能体的赛车对手。在构建了候选轨迹库和相关的奖励矩阵之后,基于 level-K 推理框架确定在规划时域内最大化累积奖励的最优轨迹。特别地,对手的 level 根据其过去一段时间窗口内的行为在线估计,然后用于确定 ego 智能体的轨迹。考虑到在 ego 智能体的决策过程中对手可能改变其 level 和策略,我们引入了一种轨迹混合策略,将 level-K 最优轨迹与故障安全轨迹进行混合。整体算法在多种模拟赛车场景中进行了测试和评估,其中还包括人在回路的实验。与常规 level-K 框架的对比分析表明,我们提出的方法在阻挡超车成功率方面具有优越性。

英文摘要:

This paper presents a game-theoretic strategy for racing, where the autonomous ego agent seeks to block a racing opponent that aims to overtake the ego agent. After a library of trajectory candidates and an associated reward matrix are constructed, the optimal trajectory in terms of maximizing the cumulative reward over the planning horizon is determined based on the level-K reasoning framework. In particular, the level of the opponent is estimated online according to its behavior over a past window and is then used to determine the trajectory for the ego agent. Taking into account that the opponent may change its level and strategy during the decision process of the ego agent, we introduce a trajectory mixing strategy that blends the level-K optimal trajectory with a fail-safe trajectory. The overall algorithm was tested and evaluated in various simulated racing scenarios, which also includes human-in-the-loop experiments. Comparative analysis against the conventional level-K framework demonstrates the superiority of our proposed approach in terms of overtake-blocking success rates.

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

↑