{\alpha}-RACER: Real-Time Algorithm for Game-Theoretic Motion Planning and Control in Autonomous Racing using Near-Potential Function
Dvij Kalaria, Chinmay Maheshwari, Shankar Sastry

TL;DR
This paper introduces -RACER, a real-time game-theoretic algorithm for autonomous racing that computes approximate Nash equilibria using a near-potential function, enabling strategic multi-car interactions at the race limit.
Contribution
It develops a novel real-time algorithm for multi-agent racing that incorporates game theory and near-potential functions, advancing autonomous racing strategies.
Findings
Outperforms existing baselines in 3-car racing scenarios
Enables real-time strategic decision-making at the race limit
Successfully models competitive maneuvers like overtaking and blocking
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms
