Dynamic Lookahead Distance via Reinforcement Learning-Based Pure Pursuit for Autonomous Racing
Mohamed Elgouhary, Amr S. El-Wakeel

TL;DR
This paper introduces a reinforcement learning approach to dynamically adjust the lookahead distance in Pure Pursuit for autonomous racing, improving lap times and transferability to real cars.
Contribution
It presents a hybrid control framework combining PPO with classical Pure Pursuit to adapt lookahead distance online, enhancing racing performance and robustness.
Findings
Learned policy increases lookahead on straights and decreases in curves.
Achieved 33.16 s on Montreal and 46.05 s on Yas Marina tracks.
Demonstrated zero-shot transfer from simulation to real car.
Abstract
Pure Pursuit (PP) is a widely used path-tracking algorithm in autonomous vehicles due to its simplicity and real-time performance. However, its effectiveness is sensitive to the choice of lookahead distance: shorter values improve cornering but can cause instability on straights, while longer values improve smoothness but reduce accuracy in curves. We propose a hybrid control framework that integrates Proximal Policy Optimization (PPO) with the classical Pure Pursuit controller to adjust the lookahead distance dynamically during racing. The PPO agent maps vehicle speed and multi-horizon curvature features to an online lookahead command. It is trained using Stable-Baselines3 in the F1TENTH Gym simulator with a KL penalty and learning-rate decay for stability, then deployed in a ROS2 environment to guide the controller. Experiments in simulation compare the proposed method against both…
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.
