arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2412.08855cs.ROcs.GT
收藏

α-RACER:基于近势函数的自动驾驶赛车博弈论运动规划与控制的实时算法

α-RACER: Real-Time Algorithm for Game-Theoretic Motion Planning and Control in Autonomous Racing using Near-Potential Function

EECS UC Berkeley(电子工程与计算机科学系,伯克利大学)

Dvij Kalaria, Chinmay Maheshwari, Shankar Sastry

AI总结:

针对多车自动驾驶赛车实时策略问题,提出基于近势函数的博弈论框架及算法,实现近似纳什均衡的实时计算,并在3车场景中超越现有基线。

摘要:

自动驾驶赛车超越了在物理极限下控制赛车的挑战。专业赛车手会采用策略性 maneuvers 来智胜其他竞争对手以赢得胜利。虽然现代控制算法可以通过为单车场景计算离线赛车线来实现人类水平的性能,但针对多车自动驾驶赛车的实时算法的研究仍然有限。为了弥补这一差距,我们开发了一个博弈论建模框架,通过一种新颖的策略参数化,将自动驾驶赛车的竞争性方面(如超车和阻挡)纳入其中,同时使车辆在其极限下运行。此外,我们提出了一种算法方法来计算(近似)纳什均衡策略,这代表了在存在竞争智能体时的最优方法。具体来说,我们引入了一种受最近提出的动态近势函数框架启发的算法,能够实时计算纳什均衡。我们的方法包括两个阶段:离线阶段和在线阶段。在离线阶段,我们使用模拟赛车数据来学习一个近势函数,该函数近似智能体的效用变化。该函数通过最大化其值来促进在线计算近似纳什均衡。我们在一个头对头的3车赛车场景中评估了我们的方法,展示了与几种现有基线相比的优越性能。

英文摘要:

Autonomous racing extends beyond the challenge of controlling a racecar at its physical limits. Professional racers employ strategic maneuvers to outwit other competing opponents to secure victory. While modern control algorithms can achieve human-level performance by computing offline racing lines for single-car scenarios, research on real-time algorithms for multi-car autonomous racing is limited. To bridge this gap, we develop game-theoretic modeling framework that incorporates the competitive aspect of autonomous racing like overtaking and blocking through a novel policy parametrization, while operating the car at its limit. Furthermore, we propose an algorithmic approach to compute the (approximate) Nash equilibrium strategy, which represents the optimal approach in the presence of competing agents. Specifically, we introduce an algorithm inspired by recently introduced framework of dynamic near-potential function, enabling real-time computation of the Nash equilibrium. Our approach comprises two phases: offline and online. During the offline phase, we use simulated racing data to learn a near-potential function that approximates utility changes for agents. This function facilitates the online computation of approximate Nash equilibria by maximizing its value. We evaluate our method in a head-to-head 3-car racing scenario, demonstrating superior performance compared to several existing baselines.

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

↑