Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Time Shift Governor for Constraint Enforcement

Updated 1 July 2025
  • Time Shift Governor (TSG) is a supervisory mechanism that adjusts reference trajectories via a dynamic time-shift parameter to enforce safety constraints.
  • It integrates with nominal closed-loop controllers to optimize constraint satisfaction in nonlinear systems such as spacecraft docking and adaptive cruise control.
  • TSG methods leverage learning-based approximators and iterative optimization to achieve computational efficiency while ensuring robust, real-time constraint enforcement.

The Time Shift Governor (TSG) is a supervisory constraint enforcement scheme designed to augment nominal closed-loop control systems by modifying reference trajectories through the application of a dynamic time-shift parameter. TSG frameworks guarantee that critical system and environmental constraints are systematically maintained, even under highly nonlinear or time-varying dynamics. Originally formulated for autonomous spacecraft rendezvous and docking, TSG methodology has been extended to terrestrial domains such as adaptive cruise control for autonomous vehicles. Through scalar manipulation of the reference trajectory's temporal alignment, TSG provides computationally efficient alternatives to full nonlinear model predictive control, allowing integration with data-driven approximators and advanced scheduling systems.

1. Core Principles and Mechanism

The fundamental concept of the TSG is the introduction of a time-shifted virtual reference target, generated by advancing or delaying the original target trajectory by a governed time-shift parameter (e.g., τshift\tau_{\tt shift}). In constrained systems, this adjustment ensures that the system trajectory, as regulated by its nominal controller, will (i) respect all specified safety or actuation constraints and (ii) gradually evolve the reference to achieve the original mission objective as the time-shift asymptotically approaches zero.

Mathematically, if xc(t)x_c(t) describes the chief or leader's reference trajectory, the TSG-modified virtual target is

xv(t)=xc(t+τshift(t)),x_v(t) = x_c\left(t + \tau_{\tt shift}(t)\right),

where τshift(t)\tau_{\tt shift}(t) is dynamically computed to maximize progress while ensuring constraint satisfaction over a prediction horizon (2407.11170, 2412.03710, 2412.05748, 2506.24083).

TSG operation typically involves:

  • Predicting the closed-loop response of the system to candidate time-shift values.
  • Searching (often via bisection or optimization) for the minimal feasible time-shift that ensures all state and input constraints are satisfied during the prediction horizon.
  • Reducing the time-shift as constraint stringency subsides, ensuring convergence.

2. Mathematical Formulation and Constraint Handling

The TSG framework, as applied to closed-loop systems with nominal tracking controllers, solves the online optimization: mintshifttshift s.t.xk+1=f(xk,α(xk,xv,k)),      xv,k=xc(tk+tshift) xk+1X,    ukU,    k[0,Np]\begin{align} \min_{t_{\tt shift}} \quad & |t_{\tt shift}| \ \text{s.t.} \quad & x_{k+1} = f(x_k, \alpha(x_k, x_{v,k})), \;\;\; x_{v,k} = x_c(t_k + t_{\tt shift}) \ & x_{k+1} \in \mathbb{X}, \;\; u_k \in \mathbb{U}, \;\; \forall k \in [0, N_p] \end{align} where ff is the system dynamics, α\alpha is the (possibly generic) nominal controller, and X,U\mathbb{X}, \mathbb{U} are admissible state and input sets.

Common constraints enforced by TSG include:

  • Geometric constraints: e.g., line-of-sight cones for spacecraft docking,

h1=v(Xc)p(XdXc)+cos(α)v(Xc)p(XdXc)0.h_1 = -v(X_c)^\top p(X_d - X_c) + \cos(\alpha)\|v(X_c)\|\|p(X_d - X_c)\| \leq 0.

  • Actuation bounds: e.g.,

h2=udumax0.h_2 = \|u_d\| - u_{\max} \leq 0.

  • Collision avoidance and approach velocity: e.g.,

h3=v(XdXc)γ2p(XdXc)γ30.h_3 = \|v(X_d-X_c)\| - \gamma_2 \|p(X_d-X_c)\| - \gamma_3 \leq 0.

  • Safety sets via control barrier functions (CBFs):

h(xk+1)h(xk)α(h(xk))h(x_{k+1}) - h(x_k) \geq -\alpha(h(x_k))

for discrete-time systems (2506.24083).

TSG can also be layered as a reconfiguration element in communication scheduling: by precomputing or dynamically adjusting gate control entries (GCEs) and gate control lists (GCLs) in Time-Aware Shaper (TAS)-enabled Ethernet switches, network controllers effectively act as TSGs—modulating transmission windows to optimize traffic while respecting latency and jitter constraints (1906.11596).

3. Supervision in Autonomous Spacecraft and Formation Flight

In spacecraft rendezvous, the TSG supervises the deputy vehicle, enforcing constraints such as thrust limits, approach geometry, and closing rates in the presence of gravitational perturbations and complex orbital dynamics (e.g., the Bicircular Restricted Four-Body Problem). The process involves:

  • At each update, simulating the closed-loop trajectory for a candidate time-shift,
  • Verifying satisfaction of all pointwise-in-time constraints,
  • Iteratively searching (e.g., via bisection) for the minimal admissible time-lead (for pursuit) or time-back (for lag),
  • Commanding the deputy to track the virtual target corresponding to the computed time-shift,
  • Gradually reducing the time-shift toward zero to effect rendezvous.

Numerical experiments in near rectilinear halo orbits confirm that such schemes achieve constraint-compliant, robust, and precise docking across a range of initial conditions (2407.11170). This suggests that TSG-based supervision provides a high degree of autonomy and safety even under significant dynamical complexity.

4. Machine Learning Augmentations for TSG

To mitigate the online computational costs of iterative search, learning-based TSGs employ neural networks to approximate the time-shift mapping. These approaches include:

  • LSTM-TSG: Employs LSTM neural networks to predict the feasible time-shift as a function of historical sequences of system states, trained offline on simulated mission data. A validation step ensures online safety, with fallback to the original optimization when the prediction is infeasible (2412.05748).
  • CIKAN-TSG: Utilizes Kolmogorov-Arnold Networks (KANs) as constraint-informed neural approximators for the time-shift function, trained with custom loss functions that penalize under-conservativeness to maintain constraint adherence. These models achieve competitive regression accuracy with orders-of-magnitude fewer parameters than deep multi-layer perceptrons (MLPs) and significantly reduced online computation time, particularly in highly variable environments such as elliptic orbits (2412.03710).

Empirical results demonstrate that learning-based TSGs can dramatically reduce onboard computation time (by factors of 4–6 in spacecraft applications) and efficiently maintain constraint satisfaction in both LEO and highly elliptic orbital operations.

5. TSG in Time-Sensitive Networking and Scheduling

In the context of Ethernet-based Time-Sensitive Networking (TSN), TSG principles are analogously realized in the temporal sequencing of transmission opportunities for scheduled and best-effort traffic. Centralized and distributed network reconfiguration algorithms adjust the timing and duration of traffic transmission gates (via GCLs), optimizing for ultra-low latency and zero-loss for mission-critical streams, while dynamically reallocating bandwidth in response to traffic demand (1906.11596).

The scheduling entities in both centralized (CNC) and distributed models essentially act as TSGs, governing the flow of data by time-shifting transmission windows to avoid contention, maximize resource utilization, and enforce real-time guarantees.

6. TSG for Safe Adaptive Cruise Control

TSG has been extended to ground vehicle adaptive cruise control (ACC) in dynamic environments characterized by abruptly changing leading vehicle or obstacle behavior (2506.24083). In this setting:

  • TSG introduces a time-shift parameter for the virtual lead vehicle reference, allowing the ego vehicle to track a lagged state of the leader.
  • The approach is integrated with model predictive control (MPC) augmented by control barrier functions (CBFs) for obstacle and collision avoidance.
  • During scenarios in which the lead vehicle’s motion or obstacles make safety constraints temporarily infeasible, the TSG shifts the tracking reference backwards in time, maintaining the feasibility of the motion planning problem and avoiding constraint violation.
  • Simulation evidence demonstrates a 100% safety success rate for TSG-guided MPC-CBF (vs. 82% for baseline MPC-CBF), particularly in challenging, unpredictable environments.

7. Advantages, Limitations, and Implementation Considerations

Advantages:

  • Provides generic, controller-agnostic constraint enforcement by manipulating reference signals.
  • Computationally efficient, reducing constraint enforcement to a scalar optimization.
  • Supports integration with data-driven approximators and hybrid fallback architectures.
  • Demonstrated effectiveness in both high-fidelity orbital models and automotive domains.

Limitations and Challenges:

  • Requires feasibility of initial state and persistence of a feasible time-shift throughout the maneuver.
  • Reliance on the accuracy and generalizability of offline-trained models in data-driven schemes; safety-validated fallback remains necessary.
  • Potential for increased fuel expenditure or reduced performance when the TSG must hold a nonzero time-shift for prolonged durations due to persistent constraint stringency (2412.05748).

Implementation:

  • Hybrid prediction architectures (learning-based TSG with validation and iterative fallback) effectively combine computational efficiency with robust safety guarantees.
  • Integration into existing control architectures is straightforward due to the add-on nature of TSG, requiring only reference signal modification.

Domain TSG Role Constraint Enforcement
Spacecraft RVD Virtual time-shifted reference, LQR LoS cone, thrust, direction, approach velocity
TSN Scheduling GCL/GCE timing governor Latency, jitter, bandwidth allocation
Adaptive Cruise Ctrl Time-shifted lead/ego references Collision, safe distance, velocity

The TSG constitutes a versatile, modular, and efficient approach to constraint enforcement across both dynamical systems and communications scheduling, facilitating safe, scalable, and robust operation in complex, time-sensitive environments.