The paper uses known Lie group symmetries of free-flying robots to reduce the state space in which a trajectory tracking policy is learned. A standard RL policy observes the actual state, reference state, and reference action independently, even though many such observations describe equivalent tracking problems. For example, translating both the robot and its reference does not change their relative configuration or the required feedback correction.
The authors show that symmetry in the dynamics and running costs induces an MDP homomorphism from the tracking MDP to a lower-dimensional quotient MDP. A policy can be trained with standard RL on this quotient and lifted back to the original system without loss of optimality. The reduced observations therefore encode only task-relevant relative quantities rather than requiring the policy to learn invariance from data.
where X and U are the physical state and action spaces, f(⋅∣x,u) is the system dynamics, JX(x,xd) is the tracking cost, JU(u,ud) is the control effort cost, ρ is a distribution over reference actions, and γ is the discount factor.
It induces the stationary tracking MDP
MT=(S,A,R,τ,γ),S=X×X×U,A=U.
The state contains the actual state, reference state, and reference action:
st=(xt,xtd,utd),at=ut.
The reward penalizes tracking and action error:
R((x,xd,ud),u)=−JX(x,xd)−JU(u,ud).
The actual and reference systems evolve under the same dynamics, while the next reference action is sampled from ρ:
Including the reference in the state produces one time-invariant MDP over a family of reference trajectories. In contrast, defining the cost using one fixed reference xtd would produce a non-stationary MDP whose optimal policy is tied to that particular trajectory. At deployment, the random reference controls can be replaced by a planned sequence of dynamically feasible reference states and actions.
Consider an original MDP M and a quotient MDP M. A continuous MDP homomorphism consists of a state map p and a state-dependent action map h satisfying
R(s,a)=R(p(s),h(s,a))
and
τ(p−1(B)∣s,a)=τ(B∣p(s),h(s,a)).
Thus, the abstraction preserves rewards and transition probabilities between abstract states. It also preserves values:
Qπ(s,a)=Qπ(p(s),h(s,a)),
and a lift of an optimal quotient policy is optimal in the original MDP.
Let a Lie group G act on states and actions through Φg(s) and Ψg(a). It is an MDP symmetry when symmetry-related state-action pairs have the same reward and the same transition probabilities between state orbits. The orbit
ΦG(s)={Φg(s):g∈G}
contains all states equivalent to s, and the quotient space S/G contains one element per orbit.
If the group action on states Φ is free and proper and there is an equivariant map λ:S→G, the symmetry induces the homomorphism
p(s)=ΦG(s),h(s,a)=Ψλ(s)−1(a).
Here, p removes the symmetry coordinates and h expresses the action in the corresponding normalized frame. The quotient MDP is
M=(S/G,A,R,τ,γ),
with
R(s,a)=R(s,Ψλ(s)(a)),s∈p−1(s),
and
τ(B∣s,a)=τ(p−1(B)∣s,Ψλ(s)(a)),s∈p−1(s).
Symmetry guarantees that these expressions do not depend on which representative s of the orbit is chosen. For a deterministic quotient policy, the lifted policy is
The particle has state x=(r,v)∈TR3, action u∈R3, and discrete dynamics
rt+1=rt+vtdt,vt+1=vt+m1utdt.
Its tracking MDP state is
s=(r,v,rd,vd,ud),
with reward
R(s,u)=−α(r−rd)−cv∥v−vd∥−cu∥u−ud∥.
Here, α is the position-error penalty used by the paper.
The MDP is invariant to common shifts in actual and reference position and velocity, and to common shifts in actual and reference force. The symmetry group is
and the quotient transitions are the error dynamics
rt+1e=rte+vtedt,vt+1e=vte+m1utdt.
A policy can therefore be learned using only position and velocity error, then lifted through
ut=utd+π(rt−rtd,vt−vtd).
The resulting controller has the familiar structure of reference feedforward plus learned error feedback, derived here as an optimality-preserving MDP quotient.