DWPP: Dynamic Window Pure Pursuit Considering Velocity and Acceleration Constraints
Fumiya Ohnishi, Masaki Takahashi

TL;DR
This paper introduces DWPP, a pure pursuit variant that explicitly incorporates velocity and acceleration constraints into command computation, improving path-tracking accuracy for mobile robots.
Contribution
DWPP reformulates command velocity computation in the velocity space to explicitly consider velocity and acceleration constraints, enhancing tracking performance.
Findings
DWPP avoids constraint violations in path tracking.
DWPP achieves higher accuracy than conventional pure pursuit.
The method is publicly available in the Nav2 repository.
Abstract
Pure pursuit and its variants are widely used for mobile robot path tracking owing to their simplicity and computational efficiency. However, many conventional approaches do not explicitly account for velocity and acceleration constraints, resulting in discrepancies between commanded and actual velocities that result in overshoot and degraded tracking performance. To address this problem, this paper proposes dynamic window pure pursuit (DWPP), which fundamentally reformulates the command velocity computation process to explicitly incorporate velocity and acceleration constraints. Specifically, DWPP formulates command velocity computation in the velocity space (the - plane) and selects the command velocity as the point within the dynamic window that is closest to the line . Experimental results demonstrate that DWPP avoids constraint-violating commands and…
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
TopicsGuidance and Control Systems · Robotic Path Planning Algorithms · Target Tracking and Data Fusion in Sensor Networks
