Inferensys

Glossary

Pure Pursuit Controller

A geometric path-tracking algorithm that calculates the steering command required to follow a look-ahead point on a reference path, widely used for Ackermann-steered vehicles.
Stylish WeWork-like workspace with hot desks and document wall, professional searching through enterprise knowledge base on a mounted ultrawide display, warm industrial pendants overhead.
GEOMETRIC PATH TRACKING

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.

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.

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.

GEOMETRIC PATH TRACKING

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.

01

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.

02

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.

03

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).
04

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.

05

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.
CONTROLLER COMPARISON

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.

FeaturePure PursuitModel Predictive ControlLinear 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

PURE PURSUIT CONTROLLER

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.

Prasad Kumkar

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.