Key Moments
Stanford AA274A Principles of Robotic Autonomy | Autumn 2019 | Trajectory Tracking
Key Moments
Differential flatness enables converting complex robotic trajectory planning into simple curve calculations, but handling input constraints requires time-scaling adjustments.
Key Insights
Differential flatness transforms the problem of calculating a feasible trajectory into an algebraic problem of sampling a feasible trajectory in a lower-dimensional flat output space.
The time-scaling technique allows decoupling the geometric path from the timing, enabling adjustments to meet input constraints like maximum velocity (Vmax) and angular velocity (ωmax).
A key application of differential flatness is exact feedback linearization, which transforms a nonlinear system into an equivalent linear system by canceling nonlinearities, allowing classical linear control techniques to be applied.
For differentially flat systems, the trajectory tracking controller can be designed by calculating the error dynamics and ensuring its stability, for example, by making the eigenvalues of the error dynamics have negative real parts.
The unicycle model example illustrates how to apply differential flatness and exact feedback linearization to achieve Cartesian trajectory tracking, with adjustments for singularities.
Closed-loop control, particularly through techniques like Lyapunov analysis or optimal control (Hamilton-Jacobi-Bellman), provides robustness and can be integrated with two-step designs for comprehensive trajectory planning.
Leveraging differential flatness for simplified trajectory planning
The lecture introduces differential flatness as a key technique for simplifying trajectory planning in robotics. A system is differentially flat if there exists a set of outputs (flat outputs) that, along with their derivatives, can uniquely determine the system's states and inputs. This property allows for the transformation of complex differential equations into algebraic problems in a lower-dimensional 'flat output space.' The core idea is that by planning a trajectory in this simplified flat space, and then using specific transformations, one can reconstruct a feasible trajectory and corresponding control inputs in the original state-action space. This approach significantly eases the computation of feasible paths, especially for systems like differential drive robots and quadrotors, which are often differentially flat.
Incorporating constraints through time-scaling
A significant challenge in trajectory planning is accounting for input constraints, such as maximum velocities or torques. The lecture presents the 'time-scaling' technique as a method to address this within the differentially flat framework. Time-scaling decouples the geometric path from the timing of its traversal. By reparameterizing time, the system can trace the same geometric path at different speeds. This flexibility allows planners to adjust the timing to ensure that the input constraints are met. Mathematically, this involves transforming the time variable 't' into a new function of 't', denoted as S(t), where S(t) is monotonically increasing. The original trajectory Z(t) is then considered as Z(S(t)). By appropriately choosing the time-scaling function S(t), the velocities and accelerations along the path can be controlled to stay within the physical limits of the actuators, effectively ensuring feasibility while maintaining the desired geometric path.
Exact feedback linearization for transforming nonlinear systems
The concept of exact feedback linearization is presented as a powerful tool for controlling nonlinear systems, particularly those that are differentially flat. This technique involves a nonlinear change of coordinates and control input transformation that converts the original nonlinear system into an equivalent linear system. The core idea is to cancel out the nonlinearities of the system. For instance, a system described by $dot{x} = f(x) + g(x)u$ can be transformed into a linear system $ddot{z} = w$, where $z$ is a flat output and $w$ is a new control input. Once the system is linearized, classical linear control techniques can be readily applied. The control law for the linear system is then transformed back to find the actual control input for the original nonlinear system. This method, unlike Taylor series approximations, provides an exact linearization for differentially flat systems without any approximation, making it highly accurate when applicable.
Designing trajectory tracking controllers
To enhance robustness against model uncertainties and disturbances, the lecture discusses the design of trajectory tracking controllers. These controllers typically operate in a closed-loop manner, using feedback from the system's current state. Several approaches are outlined, including geometric control (like the 'chase' law), precise linearization, approximate linearization, nonlinear control, and optimization-based methods (like Model Predictive Control). For differentially flat systems, precise linearization is closely tied to the differential flatness property itself. The goal is to design a controller that can make the system's state converge to the desired reference trajectory. For example, using exact feedback linearization, the error dynamics can be formulated as a linear system, and control gains can be chosen to ensure the stability and convergence of this error, driving the actual state to match the desired state.
Closed-loop control for pose stabilization
The lecture delves into closed-loop control, specifically for pose stabilization using the unicycle model as an example. The objective is to drive the robot to a specific target pose (e.g., origin with zero orientation) from any initial condition. By reformulating the unicycle's state using polar coordinates (e.g., distance from origin ρ, angle to origin δ, and relative orientation error α), a set of nonlinear dynamics can be derived. A control law for the linear and angular velocities (v and ω) is then designed based on these state variables. This control law, often derived using Lyapunov stability analysis, guarantees convergence to the origin. The importance of this is twofold: it demonstrates a practical application of closed-loop control for stabilization and provides a robust mechanism that can be used in the final stages of motion to ensure precise arrival at the target, complementing open-loop trajectory planning.
Integrating open-loop planning with closed-loop control
The lecture emphasizes a practical, two-step design approach that combines open-loop trajectory planning with closed-loop control. First, an open-loop trajectory (a sequence of states and control inputs) is computed, often using differentially flat techniques and time-scaling to satisfy constraints. This provides a desired path. Second, a closed-loop tracking controller is designed to ensure the system follows this desired path accurately, despite disturbances. This controller can be a simple proportional-derivative (PD) controller or a more sophisticated one designed through feedback linearization or Lyapunov analysis. The combination provides a robust and efficient way to achieve autonomous motion, where the open-loop plan dictates the overall motion, and the closed-loop controller corrects deviations and ensures accurate tracking, especially in the critical final phases of the maneuver.
Mentioned in This Episode
●Software & Apps
●Concepts
Robotic Trajectory Tracking Quick Guide
Practical takeaways from this episode
Do This
Avoid This
Common Questions
Differentiable flattening is a technique that simplifies path planning by converting the problem of finding a feasible trajectory into an algebraic problem. It allows for the rapid computation of a good-enough path by establishing a direct mapping between the system's state-input pairs and a set of flattened outputs.
Topics
Mentioned in this video
A strategy for handling input bound constraints in the context of differentiable flattening, which separates the geometric concept of a path from the temporal sequence used to trace it.
A two-step design approach for robotic path planning and control that balances computation and accuracy, involving open-loop path planning and a tracking controller.
A method for solving stochastic optimal control problems, often studied in graduate computer science and reinforcement learning courses.
A coordinate system that specifies a point by its distance from an origin and its angle relative to a reference direction, used as an alternative representation for the unicycle model.
A technique that allows for the computation of a good-enough trajectory quickly, by converting the problem of finding a feasible trajectory into an algebraic problem of finding an efficient sample of parameters for a feasible trajectory.
A system for representing points in a plane using two axes, commonly used in robotics for state representation.
An equation used for computing closed-loop control laws for general nonlinear optimal control problems, but is difficult to solve practically.
A method used to compute a curve in the flattened output space, where each component of the flattened output is represented as a polynomial.
A technique used to find a closed-loop control law for achieving a specific task, typically stabilization, focusing on feasibility rather than optimality.
The model used as a running example throughout the course for demonstrating concepts in robotic autonomy, incorporating linear velocity and angular velocity as inputs.
More from Stanford Online
View all 148 summaries
104 minStanford CME295 Transformers & LLMs | Autumn 2026 | Lecture 2 - Large Language Models
76 minStanford AA274A Principles of Robotic Autonomy | Autumn 2019 | Overview, Mobile Robot Kinematics
78 minStanford AA274A Principles of Robotic Autonomy | Autumn 2019 | Advanced Trajectory Optimization
75 minStanford AA274A Principles of Robotic Autonomy | Autumn 2019 | Trajectory Optimization
Ask anything from this episode.
Save it, chat with it, and connect it to Claude or ChatGPT. Get cited answers from the actual content — and build your own knowledge base of every podcast and video you care about.
Get Started Free