RAPID: Autonomous Multi-Agent Racing using Constrained Potential Dynamic Games
원문 초록
In this work, we consider the problem of autonomous racing with multiple agents where agents must interact closely and influence each other to compete. We model interactions among agents through a game-theoretical framework and propose an efficient algorithm for tractably solving the resulting game in real time. More specifically, we capture interactions among multiple agents through a constrained dynamic game. We show that the resulting dynamic game is an instance of a simple-to-analyze class of games. Namely, we show that our racing game is an instance of a constrained dynamic potential game. An important and appealing property of dynamic potential games is that a generalized Nash equilibrium of the underlying game can be computed by solving a single constrained optimal control problem instead of multiple coupled constrained optimal control problems. Leveraging this property, we show that the problem of autonomous racing is greatly simplified and develop RAPID (autonomous multi-agent RAcing using constrained PotentIal Dynamic games), a racing algorithm that can be solved tractably in real-time. Through simulation studies, we demonstrate that our algorithm outperforms the state-of-the-art approach. We further show the real-time capabilities of our algorithm in hardware experiments.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Performance-driven Constrained Optimal Auto-Tuner for MPC
A Simple Approach to Constraint-Aware Imitation Learning with Application to Autonomous Racing
Generalizable Image Repair for Robust Visual Autonomous Racing
RLPP: A Residual Method for Zero-Shot Real-World Autonomous Racing on Scaled Platforms
Enhanced Importance Sampling through Latent Space Exploration in Normalizing Flows
Parallel Neural Computing for Scene Understanding from LiDAR Perception in Autonomous Racing
토론
이 논문과 연결된 포럼 글이 아직 없습니다.