Trajectory-Independent Linearizations
- Trajectory-independent linearizations are methods that yield local or globally valid linear approximations without relying on a specific state trajectory.
- They leverage inherent system structures, geometric properties, and algebraic constraints to produce coordinate-free representations for analysis in robotics and control.
- By circumventing trajectory-based limitations, these techniques enable robust control design, invariant analysis, and data-driven system modeling in nonlinear dynamics.
A trajectory-independent linearization is a mathematical or computational procedure that generates a linear—or locally linear—representation of a nonlinear system’s dynamics, properties, or local structures without explicit reference to a fixed trajectory through state-space. Unlike classical linearization techniques that expand the dynamics around a specific reference solution, trajectory-independent linearizations provide structural, coordinate-free, or local representations valid over entire regions, manifolds, or families of system behaviors. Such approaches are central to modern systems theory, geometric mechanics, nonlinear control, robotics, and phase space analysis.
1. Fundamental Concepts
Traditional linearization of a nonlinear dynamical system, such as , generally involves Taylor expanding about a particular state or trajectory, producing a local linear approximation. In contrast, trajectory-independent linearizations aim to provide:
- Local approximations that remain valid over sets or classes of trajectories, not just one.
- Linear representations derived from system structure (e.g., symmetries, geometric properties) or from algebraic constraints, rather than from trajectory correspondence.
- Tools to infer invariant or dominant features (e.g., phase space structures, reachability sets) across a family of possible behaviors.
Examples include local quadratic forms (e.g., the trajectory divergence rate), geometric or group-based local linearizations, and structural reductions for control-affine systems under special algebraic conditions.
2. Local and Geometric Linearizations on Manifolds
In robotics and geometric mechanics, trajectory-independent linearizations address the challenges of global system structure, especially for moving-base (floating-base) robots whose configuration space includes nontrivial manifolds such as . A trajectory-independent geometric linearization is constructed as follows (Bos et al., 2022):
- Coordinate-Free State Representation: The system state is represented as with velocities in the corresponding Lie algebra, avoiding local coordinate charts and their singularities.
- Geometric Linearization Operator: For systems on a Lie group , the dynamics are rewritten in left-trivialized form . Perturbations obey the linearized system:
with and .
- Recursive Algorithms: The key Jacobians and Hessians required for and are computed using recursions analogous to standard inverse-dynamics procedures, but without requiring local orientation parameterizations.
- Singularity-Free Nature: Because orientation perturbations are handled in the Lie algebra (), the method is globally valid and free from gimbal-lock or coordinate singularities.
- Validation: Comparison against geometric finite differences shows that these linearizations achieve relative errors around , confirming precision and structural independence (Bos et al., 2022).
This approach establishes a mathematically exact, trajectory-independent, singularity-free local linearization for highly nonlinear, manifold-valued dynamical systems.
3. Structural Linearization via System Decomposition
For nonlinear affine control systems, a trajectory-independent linearization structure emerges when the system satisfies the linearizing assumption (Löber, 2016):
- Affine Control System:
- Linearizing Assumption: The Moore–Penrose projectors and are constant; the unactuated drift is affine-linear; and the output map is linear.
- Constraint Dynamics: The unforced dynamics for the unactuated subspace (dimension ) are governed by a constant-coefficient LTI operator, driven by the “free” variables :
The solution for is the convolution of the LTI system’s resolvent with .
- Input-Output Equivalence: The mapping is trajectory-independent and identical to that of a constant LTI system. As a result, controllability conditions and trajectory planning can be reduced to those of classical linear systems by checking the rank of the Kalman-like controllability matrix built from the constant blocks , (Löber, 2016).
This structure allows for linear system concepts and tools, including exact trajectory realization and controllability verification, to be applied to a broad, nontrivial class of nonlinear affine control systems.
4. Trajectory-Independent Phase Space Structures
Instantaneous phase space features, such as invariant manifolds and coherent sets, can be revealed via purely local, trajectory-independent linearizations. The trajectory divergence rate provides such a tool (Jr. et al., 2017):
- Definition (): Given and (the symmetric part of the Jacobian), the trajectory divergence rate at is
where is a unit vector normal to the flow direction at .
- Physical Interpretation: gives the first-order (in time) rate of normal separation between infinitesimally close trajectories at , allowing the identification of repelling and attracting structures (such as slow manifolds or hyperbolic LCSs) without trajectory integration.
- Extension to Higher Dimensions: For , with the tangent and the normal bundle projector , the principal normal stretching rates are the eigenvalues of the projected strain tensor .
- Algorithmic Implications: The computation of requires only and its Jacobian , enabling rapid, mesh-based scanning of phase space for dominant structures without solving for system trajectories (Jr. et al., 2017).
This method realizes a local, trajectory-independent linearization concept useful for dynamic systems analysis, especially in complex or high-dimensional phase spaces.
5. Data-Driven and Parameter-Varying Linear Embeddings
Recent developments extend trajectory-independent linearization concepts via data-driven and parameter-varying embeddings (Morato et al., 2023):
- Trajectory Feature Spanning: For linear time-invariant (LTI) systems, admissible trajectories can be spanned by input-output dictionaries under persistent excitation—central to the behavioral systems framework.
- Extension to Nonlinear Systems: Nonlinear dynamics can be embedded in a quasi-Linear Parameter Varying (qLPV) framework, by associating outputs to scheduling variables via a known analytic function. Differential inclusion techniques permit the adaptation of linear analysis tools to nonlinear systems within this embedding, generalizing the trajectory-independent behavioral structure.
- Analysis Tools: Provides simulation, prediction, and parameter-dependent dissipativity analysis that remains valid across entire bounded operation regions, not tied to any specific nominal trajectory.
- Practical Validation: High-fidelity simulations and experimental test-benches (e.g., a rotational pendulum and an electromechanical platform) demonstrate that—even with misspecified scheduling—the representation structure captures the system’s output dynamics reliably (Morato et al., 2023).
A plausible implication is that, by exploiting analytic scheduling functions, trajectory-independent linear representations for nonlinear systems can be realized in a data-driven manner across broad operating envelopes.
6. Local Optimal Control under Linearization Validity
Minimum-energy control laws for linearized systems are only locally valid in regions where the linearization accurately represents the true nonlinear dynamics. A trajectory-independent characterization of validity is given by control reachability ellipsoids (Klickstein et al., 2017):
- Reachability Ellipsoid : For a linearized system , the set of all states reachable at time with control energy bounded by is
where is the zero-input trajectory and the controllability Gramian.
- Local Validity Constraint: The ellipsoid must be contained within the region where the linearization error remains below a prescribed threshold.
- Piecewise Linearization (LOCS Algorithm): For large excursions, the state space is traversed by concatenating locally valid minimum-energy linear control segments. At each knot point, the system is re-linearized, and the new reachability ellipsoid is constructed, ensuring that the piecewise trajectory never exits its corresponding validity region.
- Theoretical Guarantee: As long as each segment remains within its local validity neighborhood, the entire control synthesis remains locally accurate, and the sequence of control laws provides an effective, trajectory-independent roadmap for state transition and control (Klickstein et al., 2017).
This approach yields an explicit, quantifiable trajectory-independent domain of validity for linearized control laws and enables systematic, robust composition of complex control actions across nonlinear state spaces.
7. Significance and Methodological Connections
Trajectory-independent linearizations enable a range of advanced methodologies:
- Global and local stabilization without pre-computing or tracking explicit trajectories.
- Scalable, singularity-free dynamics computations in robotic and multi-body systems.
- Rapid extraction of phase space structures without computationally expensive trajectory integration.
- Formal reduction of nonlinear control and analysis problems to LTI system techniques within well-characterized domains.
- Support for data-driven and parameter-varying systems analysis methods.
The unifying thread is the provision of locally or structurally linear descriptions or tools that remain valid, interpretable, and effective across entire regions, manifolds, or under algebraic invariants—sidestepping the limitations imposed by trajectory-centric linearizations. These frameworks are crucial in modern control theory, robotic system design, nonlinear dynamics, and systems identification (Morato et al., 2023, Bos et al., 2022, Klickstein et al., 2017, Jr. et al., 2017, Löber, 2016).