TOPP-DWR: Time-Optimal Path Parameterization of Differential-Driven Wheeled Robots Considering Piecewise-Constant Angular Velocity Constraints

Yong Li, Yujun Huang, Yi Chen, Hui Cheng

Abstract

Differential-driven wheeled robots (DWR) represent the quintessential type of mobile robots and find extensive applications across the robotic field. Most high-performance control approaches for DWR explicitly utilize the linear and angular velocities of the trajectory as control references. However, existing research on time-optimal path parameterization (TOPP) for mobile robots usually neglects the angular velocity and joint velocity constraints, which can result in degraded control performance in practical applications. In this article, a systematic and practical TOPP algorithm named TOPP-DWR is proposed for DWR and other mobile robots. First, the non-uniform B-spline is adopted to represent the initial trajectory in the task space. Second, the piecewise-constant angular velocity, as well as joint velocity, linear velocity, and linear acceleration constraints, are incorporated into the TOPP problem. During the construction of the optimization problem, the aforementioned constraints are uniformly represented as linear velocity constraints. To boost the numerical computational efficiency, we introduce a slack variable to reformulate the problem into second-order-cone programming (SOCP). Subsequently, comparative experiments are conducted to validate the superiority of the proposed method. Quantitative performance indexes show that TOPP-DWR achieves TOPP while adhering to all constraints. Finally, field autonomous navigation experiments are carried out to validate the practicability of TOPP-DWR in real-world applications.

Introduction

In the domain of mobile robotics, Time-Optimal Path Parameterization (TOPP) is the essential process of determining the maximum possible speed along a predefined path while strictly respecting the robot's physical limitations. While much of the existing literature focuses on longitudinal constraints such as linear velocity and acceleration, differential-driven wheeled robots (DWRs) present unique challenges. These robots rely on two independent wheels for both propulsion and steering. Neglecting angular velocity or individual wheel (joint) speed limits often results in trajectories that are physically unachievable, leading to skidding, path deviation, or mechanical failure in real-world deployments.

Methodology

The TOPP-DWR framework addresses these gaps by bridging theoretical path planning with practical motor limits through a multi-step optimization process.

Trajectory Representation and Constraint Uniformity

The algorithm begins by representing the initial path using non-uniform B-splines, ensuring mathematical smoothness. The core innovation of TOPP-DWR lies in its handling of constraints. Instead of treating linear velocity, angular velocity, and joint velocities as separate entities, the authors map them into a unified space. By treating angular and joint limits as dynamic bounds on linear velocity, the complex multi-variable problem is converted into a structured optimization.

Feasible region of wheel velocities under linear and angular constraints.

SOCP Reformulation

To ensure real-time performance on embedded hardware, the authors introduce a slack variable to reformulate the non-convex optimization problem into Second-Order Cone Programming (SOCP). This allows the use of efficient solvers, enabling the algorithm to run in milliseconds. Furthermore, by performing parameterization directly in the task space, the method avoids the integration errors typically associated with mapping between wheel speeds and robot poses in under-actuated systems.

Experimental Evaluation

The algorithm was evaluated across three distinct scenarios: a mathematically complex Lissajous curve, a tortuous "cvte" path, and a real-world full-coverage path from a commercial cleaning robot.

Validation of TOPP-DWR across complex paths and real-world navigation scenarios.

Key Results

  • Constraint Adherence: Comparative tests against Sequential Linear Programming (SLP) showed that while SLP frequently violated angular velocity limits (sometimes by orders of magnitude), TOPP-DWR remained strictly within all physical bounds.
  • Computational Efficiency: TOPP-DWR demonstrated a 43.75% reduction in optimization time compared to state-of-the-art methods like OTAQ.
  • Practical Deployment: When deployed on a commercial cleaning robot powered by a low-cost RK3399 processor, the algorithm achieved an average computation time of 0.0728s for online obstacle avoidance, confirming its suitability for edge computing.

Discussion and Future Work

A significant insight from the experiments was the "Curvature Paradox": high-curvature regions typically hit linear acceleration limits, while low-curvature regions often hit joint velocity (wheel speed) boundaries. This highlights the necessity of a holistic optimization approach that considers all constraints simultaneously.

Currently, the algorithm utilizes piecewise-constant angular velocity to maintain computational efficiency. While this provides $C^0$ continuity, future iterations aim to implement piecewise-linear constraints to achieve $C^1$ continuity. This would result in even smoother motion, which is critical for high-precision applications where minimizing vibration is paramount.

Summary updated

Abstract

Differential-driven wheeled robots (DWR) represent the quintessential type of mobile robots and find extensive appli- cations across the robotic field. Most high-performance control approaches for DWR explicitly utilize the linear and angular velocities of the trajectory as control references. However, existing research on time-optimal path parameterization (TOPP) for mobile robots usually neglects the angular velocity and joint vel- ocity constraints, which can result in degraded control perfor- mance in practical applications. In this article, a systematic and practical TOPP algorithm named TOPP-DWR is proposed for DWR and other mobile robots. First, the non-uniform B-spline is adopted to represent the initial trajectory in the task space. Second, the piecewise-constant angular velocity, as well as joint velocity, linear velocity, and linear acceleration constraints, are incorporated into the TOPP problem. During the construction of the optimization problem, the aforementioned constraints are uniformly represented as linear velocity constraints. To boost the numerical computational efficiency, we introduce a slack variable to reformulate the problem into second-order-cone programming (SOCP). Subsequently, comparative experiments are conducted to validate the superiority of the proposed method. Quantitative performance indexes show that TOPP-DWR achieves TOPP while adhering to all constraints. Finally, field autonomous navigation experiments are carried out to validate the practicability of TOPP-DWR in real-world applications.
BibTeX
@inproceedings{li2025topp,
  author = {Yong Li and Yujun Huang and Yi Chen and Hui Cheng},
  title = {{TOPP-DWR: Time-Optimal Path Parameterization of Differential-Driven Wheeled Robots Considering Piecewise-Constant Angular Velocity Constraints}},
  booktitle = {IEEE/RSJ International Conference on Intelligent Robots and Systems},
  year = {2025},
  url = {https://openreview.net/forum?id=TEaYKrjrhv},
}
Figure