A pure pursuit controller is a proportional steering law that geometrically calculates the instantaneous arc necessary to drive a vehicle from its current position to a goal point on the desired path. The algorithm selects this goal point at a constant look-ahead distance in front of the vehicle, then determines the circular arc that connects the rear axle to that point. The resulting curvature is converted directly into a steering command, making it a simple yet effective method for Ackermann-steered vehicles like autonomous mobile robots and self-driving cars.
Glossary
Pure Pursuit Controller

What is Pure Pursuit Controller?
A pure pursuit controller is a geometric path-tracking algorithm that computes the steering angle required for a vehicle to follow a look-ahead point located a fixed distance ahead on a reference path.
The controller's primary tuning parameter is the look-ahead distance, which governs the trade-off between stability and tracking accuracy. A shorter distance produces aggressive correction but risks oscillation, while a longer distance smooths the trajectory but causes corner cutting on sharp curves. Unlike Model Predictive Control (MPC), pure pursuit ignores vehicle dynamics and future path constraints, relying solely on the geometric relationship between the vehicle's pose and a single reference point. Despite this simplicity, it remains widely deployed in Robot Operating System (ROS) navigation stacks for low-speed industrial AGVs.
Key Characteristics of Pure Pursuit Controllers
The Pure Pursuit controller is a foundational geometric algorithm that computes the steering angle required for a vehicle to intercept a look-ahead point on a reference path. Its simplicity and effectiveness make it a standard for Ackermann-steered platforms.
Geometric Look-Ahead Principle
The controller continuously calculates a circular arc connecting the vehicle's rear axle to a look-ahead point on the desired path. The steering angle is derived purely from the geometry of this arc and the vehicle's wheelbase. The look-ahead distance acts as a tuning parameter: shorter distances create aggressive, oscillatory tracking, while longer distances produce smoother but lazier cornering. This geometric solution avoids solving complex differential equations, making it computationally trivial for embedded systems.
Ackermann Steering Kinematics
Pure Pursuit is specifically designed for Ackermann-steered vehicles, which use a four-bar linkage to ensure the inner front wheel turns at a sharper angle than the outer wheel during a turn. This geometry prevents tire scrubbing. The algorithm assumes a bicycle model simplification, collapsing the two front and two rear wheels into single virtual wheels at the axle midpoints. This abstraction is valid for low-speed, non-holonomic motion where lateral slip is negligible.
Look-Ahead Distance Tuning
The look-ahead distance (L) is the critical hyperparameter governing tracking behavior. Common tuning strategies include:
- Constant distance: Simple but fails at varying speeds.
- Speed-proportional: L = k * v, where k is a gain. This naturally dampens oscillations at high speed.
- Adaptive curvature: L decreases in tight turns and increases on straights, often using cross-track error or path curvature as inputs. Incorrect tuning leads to cutting corners (L too short) or overshooting (L too long).
Path Tracking vs. Trajectory Tracking
Pure Pursuit is a path tracking algorithm, not a trajectory tracker. It ignores temporal constraints like velocity profiles and arrival times. The controller only cares about spatial convergence to the geometric path. This makes it suitable for applications where precise timing is secondary to spatial accuracy, such as agricultural row following or warehouse AGV navigation. For dynamic obstacle avoidance requiring time-parameterized trajectories, Model Predictive Control (MPC) is a more appropriate choice.
Limitations and Edge Cases
The algorithm exhibits well-known failure modes:
- Singularity at zero cross-track error: When the vehicle is perfectly on the path, the look-ahead point can become undefined, requiring a fallback strategy.
- Reverse driving instability: The geometric relationship inverts, causing the controller to steer away from the path. A modified formulation or separate controller is needed for reverse maneuvers.
- High-speed instability: The bicycle model assumption breaks down as lateral tire slip becomes significant, requiring a dynamic model like the Stanley controller or MPC.
Pure Pursuit vs. Other Path Tracking Controllers
A feature-level comparison of the Pure Pursuit geometric controller against Model Predictive Control (MPC) and the Linear Quadratic Regulator (LQR) for autonomous vehicle path tracking.
| Feature | Pure Pursuit | Model Predictive Control | Linear Quadratic Regulator |
|---|---|---|---|
Control Strategy | Geometric | Optimization-based | Optimal control |
Kinematic Model | Bicycle model | Dynamic or kinematic | Linearized dynamic |
Look-ahead Horizon | Fixed point | Receding finite horizon | Infinite horizon |
Predictive Capability | |||
Handles Constraints | |||
Computational Load | Low | High | Medium |
Tuning Complexity | Single parameter | Multiple weights | Q and R matrices |
Path Curvature Handling | Moderate | Excellent | Good |
Velocity Independence | |||
Stability Guarantee | Empirical | Theoretical | Theoretical |
Typical Update Rate | 10-50 Hz | 10-100 Hz | 100-1000 Hz |
Lateral Error at 5 m/s | 0.05-0.15 m | < 0.05 m | 0.02-0.08 m |
Enabling Efficiency, Speed & Accuracy
Intelligent Analysis, Decision & Execution
We build AI systems for teams that need search across company data, workflow automation across tools, or AI features inside products and internal software.
Talk to Us
Search across company data
Give teams answers from docs, tickets, runbooks, and product data with sources and permissions.
Useful when people spend too long searching or get different answers from different systems.

Automate internal workflows
Use AI to route work, draft outputs, trigger actions, and keep approvals and logs in place.
Useful when repetitive work moves across multiple tools and teams.

Add AI to products and internal tools
Build assistants, guided actions, or decision support into the software your team or customers already use.
Useful when AI needs to be part of the product, not a separate tool.
Frequently Asked Questions
Clear, technically precise answers to the most common questions about the geometric path-tracking algorithm used in autonomous mobile robots and Ackermann-steered vehicles.
A Pure Pursuit controller is a geometric path-tracking algorithm that computes the steering angle required to guide a vehicle toward a look-ahead point located a fixed distance ahead on a reference path. The algorithm works by fitting a circular arc between the vehicle's current rear axle position and the look-ahead point, then solving for the curvature that defines that arc. Using the bicycle kinematic model, this curvature is converted into a steering command via the relationship δ = arctan(2L sin(α) / ld), where L is the wheelbase, α is the angle between the vehicle's heading and the look-ahead vector, and ld is the look-ahead distance. The controller continuously recalculates this arc as the vehicle moves, effectively 'pursuing' the moving target point along the path. Unlike optimization-based methods such as Model Predictive Control, Pure Pursuit requires no model of vehicle dynamics beyond the kinematic bicycle approximation, making it computationally lightweight and suitable for embedded deployment on Automated Guided Vehicles and agricultural robots.
Related Terms
Algorithms and constraints that govern how autonomous vehicles follow reference trajectories, forming the control stack around the Pure Pursuit Controller.
Stanley Controller
A geometric path tracking controller developed at Stanford University that calculates steering based on cross-track error and heading error relative to the reference path. Unlike Pure Pursuit, which uses a look-ahead point, the Stanley controller uses the closest point on the path to the front axle. The steering law combines a nonlinear term proportional to cross-track error divided by velocity and a linear term for heading alignment. It is particularly effective at high speeds and is the primary alternative to Pure Pursuit for Ackermann-steered vehicles.
Model Predictive Control (MPC)
An advanced control strategy that solves a finite-horizon optimization problem at each timestep to compute steering and velocity commands. Unlike Pure Pursuit's geometric simplicity, MPC explicitly models vehicle dynamics, actuator limits, and future path preview. It predicts the vehicle's trajectory over a receding horizon and minimizes a cost function balancing path tracking error, control effort, and constraint violations. MPC handles nonlinear tire dynamics and input saturation that geometric controllers cannot, but requires significantly more onboard computation.
Ackermann Steering Geometry
The kinematic steering mechanism used by most passenger vehicles and many mobile robots, where the inner front wheel turns at a sharper angle than the outer front wheel to avoid tire scrub during cornering. This geometry introduces a nonholonomic constraint: the vehicle cannot move sideways instantaneously. Pure Pursuit implicitly respects this constraint by computing a constant curvature arc to the look-ahead point, making it naturally suited for Ackermann platforms. The turning radius is bounded by the vehicle's minimum turning radius, a hard constraint that Pure Pursuit must respect when selecting look-ahead distances.
Nonholonomic Constraints
Velocity-level constraints that cannot be integrated into equivalent position constraints. For wheeled vehicles, the classic nonholonomic constraint is the rolling-without-slipping condition: the lateral velocity at each wheel contact point must be zero. This restricts the vehicle's instantaneous motion to a one-dimensional manifold of velocities aligned with its heading. Pure Pursuit generates feasible steering commands because it outputs circular arcs that satisfy this constraint by construction. In contrast, holonomic platforms like omnidirectional robots can move in any direction and do not require specialized path tracking geometry.
Cross-Track Error
The lateral distance between the vehicle's reference point and the closest point on the desired path. It is the primary error metric minimized by path tracking controllers. Pure Pursuit does not directly minimize cross-track error; instead, it converges to the path by continuously steering toward a look-ahead point ahead on the reference. The relationship between look-ahead distance and cross-track error correction is nonlinear: shorter look-ahead produces aggressive correction but risks oscillation, while longer look-ahead yields smoother convergence but slower error reduction. Adaptive look-ahead schemes vary this distance based on velocity and cross-track error magnitude.
Kinematic Bicycle Model
A simplified vehicle model that approximates a four-wheeled Ackermann vehicle as a two-wheeled bicycle with a single front steerable wheel and a single rear fixed wheel. The state is defined by position (x, y), heading (θ), and steering angle (δ). This model captures the essential nonholonomic constraints while remaining analytically tractable. Pure Pursuit is derived directly from the bicycle model's geometry: the circular arc connecting the rear axle to the look-ahead point defines the required steering angle. The model assumes no slip, rigid body motion, and instantaneous steering actuation, which limits accuracy at high lateral accelerations.

About the author
Prasad Kumkar
CEO & MD, Inference Systems
Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.
His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.
Partnered with leading AI, data, and software stack.
How We Work
Custom AI workflows for your Business
One-fit-all AI don't work for modern businesses. At Inferensys, we aim to understand your business & custom requirements; which we use to define most efficient agentic workflows, the data, and the tools for your business.
01
Review the use case
We understand the task, the users, and where AI can actually help.
Read more02
Pick the right approach
We define what needs search, automation, or product integration.
Read more03
Build the first useful version
We implement the part that proves the value first.
Read more04
Improve from there
We add the checks and visibility needed to keep it useful.
Read moreThe first call is a practical review of your use case and the right next step.
Talk to Us