Overview
This edition follows the eighteen-page April 2025 arXiv v2 paper. It retains the full method, experiments, limitations, and implementation appendices. The PDF skips Figure 2, while the HTML numbers the same nine figures consecutively; content matching, rather than label equality alone, verifies retention. Several displayed equation numbers also differ between the two versions.
At a glance
DDAT combines trajectory diffusion with chronological dynamics projections. A deterministic simulator supplies successor states even when its equations are unavailable. Convex reachable-set approximations improve state plans but can fail with contact-induced nonconvexity; directly rolling out predicted or corrected actions enforces simulator dynamics. Experiments include six simulated robots and open-loop quadruped hardware trials. Projection timing matters, while adding projections during training does not improve the reported results.
I Introduction
Denoised state sequences need not obey a robot’s dynamics, especially under limited actuation. Replanning can compensate but costs computation. DDAT instead inserts chronological corrections into generation, with variants that trade state-plan fidelity, exact simulator rollout, and cost. Its aim is longer open-loop plans; feasibility under a model does not guarantee task success, collision avoidance, or accurate physical execution.
II Related Works
The related work separates constraint enforcement from the choice to diffuse states, actions, or both. These choices offer different guarantees and computational costs. The comparison concerns the reviewed literature and does not imply that every form of diffusion planning lacks a dynamics-aware component.
II-A Enforcing constraints on diffusion models
Soft guidance encourages a property through scores or losses; hard projection attempts to enforce a specified constraint on each sample. Dynamical consistency is harder than an independent per-state bound because every corrected state changes the reachable set of its successor.
II-A 1 Soft constraints
Classifier guidance, classifier-free guidance, and additional loss terms can steer samples toward constraints without ensuring every sample satisfies them. Sampling and selecting many candidates can improve observed quality but does not convert such encouragement into an exact guarantee.
II-A 2 Hard constraints
Hard constraints have been enforced by clipping, reflection, manifold constructions, and projection. Interleaving correction with denoising can improve quality over a final correction alone, yet projection at high noise can distort samples. The paper extends these ideas to chronological robot dynamics, with guarantees depending on the particular projector.
II-B Diffusion planning
Diffusing actions, states, or joint state–action sequences changes where dynamical consistency comes from. The comparison distinguishes a generated plan from the physical trajectory obtained when its controls are executed.
II-B 1 Dynamic feasibility enforced by planning on actions
An admissible action sequence produces a dynamics-consistent simulator rollout by construction, as in action-based approaches such as Diffusion Policy. Predicting volatile action sequences may be harder than predicting smooth state sequences, although this is an empirical tendency rather than a universal limitation. Additional temporal or inverse models offer alternative tradeoffs.
II-B 2 Diffusion planning on states
State diffusion directly represents desired motion but supplies no automatic transition feasibility. Replanning, infeasibility guidance, constraint optimization, and control-barrier methods address parts of this problem. DDAT targets nonlinear black-box dynamics, while noting that some earlier dynamics-constrained studies evaluated linear systems.
II-B 3 Diffusion planning on states and actions
Joint state–action prediction, exemplified by Diffuser, can learn temporal coherence without enforcing the simulator equations. Learned inverse dynamics can also introduce error. Using diffusion to initialize a separate trajectory optimizer is another route; DDAT instead compares corrections integrated into the diffusion process.
III Framework
The assumed system is deterministic and discrete time, with known admissible action bounds and a simulator that returns the next state for any queried state–action pair. Black-box means unavailable equations, not unavailable dynamics queries. A dataset of representative admissible trajectories supplies the imitation target.
Equation 1
| (1) |
III-A Diffusion planning
Training corrupts demonstrated trajectories with Gaussian noise and fits a denoiser to reconstruct them. Inference starts with a noisy trajectory, fixes its initial state, and repeatedly applies a deterministic denoising update. The implementation follows the design choices of Karras and colleagues. This learns the demonstrated trajectory distribution; admissibility requires the additional corrections.
Equations 2
| (2) |
III-B Problem formulation
An admissible state trajectory has an action sequence inside the allowed set that realizes every transition. Each successor must therefore lie in the predecessor’s reachable set. Chronological correction is inherently sequential, and a black-box nonlinear simulator does not provide a closed-form reachable set. The method addresses those difficulties through approximation or direct action rollout.
Equation 3
| (3) |
IV Making Trajectories Admissible
The projector variants differ in whether they approximate a reachable set, use a reference state sequence, exploit predicted actions, or regenerate states by simulation. The distinction matters: the convex approximations do not carry the unconditional dynamics guarantee of a rollout using admissible actions.
IV-A Reachable sets underapproximation
The basic projector simulates the vertices of a polytopic action set, takes the convex hull of their successor states, and projects each predicted successor onto that hull in chronological order. This is an inner approximation only when the actual reachable set is convex. Contact discontinuities can violate that assumption, so a point in the hull may still be unreachable. Moreover, an action hyperrectangle has exponentially many vertices as its dimension grows.
Equations 4–5
| (4) |
| (5) |
IV-B Reference projection of state trajectories
Greedy next-state projection can accumulate error and produce a poor long trajectory even when a much closer admissible trajectory exists. A reference-aware objective balances distance to the proposed successor against distance to a reference successor. This reduces observed drift but is not a global nearest-trajectory solver, and it retains the reachable-set approximation caveat.
Equation 6
| (6) |
IV-C Using action predictions for better state projections
Jointly predicted actions center a smaller action-search region before constructing the successor-state hull. Convex optimization then chooses weights for both an approximate next state and its associated action. Matching convex combinations of actions and successors is exact for control-affine dynamics; general nonlinear or contact dynamics can still produce a discrepancy. Restricting the search improves local precision but does not remove the exponential vertex cost.
Equations 7–8
| (7) |
| (8) |
Equations 9–10
| (9) |
| (10) |
IV-D Using action predictions for admissible state prediction
The action projector replaces each state prediction with the simulator’s successor under the predicted action. A second variant adds a learned action correction based on the disagreement between the desired successor and the uncorrected rollout. Both construct dynamically consistent simulator trajectories when the applied actions respect their admissible set. This is a model-relative dynamics statement, not a guarantee of state safety, task completion, or simulation-to-real agreement; the displayed correction equation does not explicitly specify an action-clipping step.
Equations 11–12
| (11) |
| (12) |
V Incorporating Projections in Diffusion
DDAT applies the selected correction within denoising and optionally within training. A noise-dependent schedule postpones strong corrections until the proposed trajectory contains meaningful structure. The experiments separately test the value of timing, training-time correction, and output modality.
V-A Training with projections
The proposed training loss compares a projected denoised sample with its demonstrated target, while inference alternates denoising, initial-state conditioning, and projection. Reference projection uses demonstrations during training but the unprojected generated sequence during inference. Differentiable optimization layers provide part of the gradient path, although the black-box simulator interrupts exact backpropagation. The later ablation does not support the hoped-for benefit of training with projection.
Training
Inference
V-B Projection curriculum
The curriculum skips projection at high noise, gradually increases its probability in a transition band, and projects every transition at low noise. The Bernoulli variable in the displayed formula marks skipping, so the projection probability is one minus the displayed probability. Partial intermediate projection breaks some chains of accumulated error, while the final low-noise stage restores correction at every transition. This is a stabilization strategy whose empirical value is tested separately.
Equation
VI Implementation
Experiments compare state-only, action-only, and joint models with several correction variants. Evaluation includes both model-relative admissibility and useful behavior, since a perfectly consistent rollout can still fall, miss a target, or receive poor reward.
VI-A Test environments
The environments are Hopper, Walker, HalfCheetah, a custom quadcopter, and Unitree GO1 and GO2 quadrupeds. State dimensions range from twelve to thirty-seven and action dimensions from three to twelve. Demonstrations come from simulated control policies; these datasets are constructed for reproducibility rather than taken unchanged from a standard offline benchmark.
VI-B Diffusion architecture
A diffusion transformer models sequences. Convex layers differentiate the optimization parts of projection, but simulator calls prevent complete gradients through the correction. Inference generates a batch and chooses a trajectory using a task criterion, often predicted time before falling. Reported behavior therefore includes candidate sampling and selection, despite the introduction’s motivation to reduce reliance on large batches.
VI-C Evaluation metrics
Statewise admissibility error measures each proposed transition’s distance from a simulator successor found by inverse dynamics. Cumulative error recursively rolls out such recovered actions and measures divergence from the proposed sequence. The numerical inverse solver limits their precision; its greedy recursion is not a proof of the globally nearest admissible trajectory. Model labels record state/action outputs, projector type, curriculum, inference-only use, and conditioning. Rewards and survival are separate outcome measures.
Equations 16–18
| (16) |
| (17) |
| (18) |
VII Experiments
The experiments ask whether projections improve consistency, when they should occur, whether they should be included during training, and which prediction modality works best. The retained tables and plots preserve the different sample counts, uncertainty summaries, and evaluation domains.
VII-A Generating admissible trajectories
All tested projection schemes reduce measured statewise and cumulative error relative to unprojected state plans. Direct action-rollout projectors have zero simulator consistency error by construction, which does not imply zero tracking error on hardware. Other variants remain limited by convex approximations and the evaluation inverse solver. Particularly precise inverse dynamics are needed for HalfCheetah and the quadcopter; state-only quadruped evaluation is unavailable.
| System | Model | SAE () | CAE () |
|---|---|---|---|
| Hopper | |||
| Walker | |||
| HalfCheetah | |||
| Quadcopter | |||
VII-B Projection curriculum during inference
Projecting from the highest-noise step harms behavioral quality. In the quadcopter slalom illustration, no early-projection samples pass both obstacles, compared with 81% and 79% for middle and final projection. The corresponding table reports similar admissibility and no significant difference between middle and final schedules. Avoiding high-noise correction is supported more strongly than a claim that the gradual curriculum always beats a final projection.
| parameters | Hopper | Quadcopter | ||||||
|---|---|---|---|---|---|---|---|---|
| Model | SAE () | CAE () | survival% () | reward () | survival% () | reward () | ||
| pre | ||||||||
| mid | ||||||||
| post | ||||||||
VII-C Training with projections
The training ablation is negative: adding projections during training provides little or no significant improvement in either trajectory quality or admissibility over inference-only projection. The larger differences come from projector choice. Corrections still increase and destabilize training loss despite the proposed curriculum. This finding qualifies the training-time projection contribution emphasized in the introduction.
VII-D Diffusion modality
Joint state–action models with corrected rollouts perform consistently well, but they do not win every metric. State-only reference projection is strongest on the reported Hopper comparison; action-only planning is competitive on HalfCheetah and gives the highest GO1 reward, yet performs less well on GO2. The action-only baseline adapts the policy component of D-MPC to the authors’ data and transformer, not its full learned-model system. Dataset controllers use closed-loop feedback, so their stronger results are not an equal open-loop comparison.
| Model | Hopper | Walker | HalfCheetah | Quadcopter | ||||
|---|---|---|---|---|---|---|---|---|
| survival () | reward () | survival () | reward () | survival () | reward () | survival () | reward () | |
| MPPI [48] | ||||||||
| data | ||||||||
| System | Model | survival % () | reward () |
|---|---|---|---|
| Hopper | |||
| Walker | |||
| HalfCheetah | |||
| Quadcopter | |||
| System | Model | survival () | reward () |
|---|---|---|---|
| Unitree GO1 | |||
| Unitree GO2 | |||
VIII Hardware Experiments
Thirty GO2 trials per method repeat three sampled ten-second trajectories ten times each. DDAT succeeds in 23/30 trials, with five region exits and two falls, versus 10/30 successes, sixteen exits, and four falls for the unprojected baseline. Thus the sixty trials are not sixty independently sampled plans. The task is a three-meter straight walk in a prescribed corridor; onboard recovery and physical variability affect failures. A separate GO1 demonstration walks two meters with 0.32 meters of lateral deviation. These results support this constrained open-loop setting, not general robust locomotion.
| Model | Success () | Exits () | Falls () |
|---|---|---|---|
IX Limitations
Admissibility verification assumes an accurate simulator. Learning a model could remove that access requirement and permit fuller differentiation, but would introduce model error and is proposed future work. Training remains expensive, and even five denoising steps can be slow when projections require sequential simulation and convex optimization. High-dimensional action sets and long horizons exacerbate that cost.
X Conclusion and Future Work
The principal practical result is that dynamics-aware correction can improve open-loop diffusion plans, particularly when joint predictions are converted into simulator rollouts. The experiments favor suitable projection choice and avoiding high-noise correction, while finding no clear benefit from projection during training. Faster closed-loop deployment and learned dynamics without simulator access remain future directions.
Acknowledgments
The authors acknowledge public and industrial research support and shared quadcopter/controller code. Koushil Sreenath discloses a financial interest in the Robotics and AI Institute and potential benefit from commercialization. These statements provide the paper’s original funding and conflict-of-interest context.
Appendix A Projection of actuated states
Known state meanings and numerical integration rules can eliminate dependent coordinates from the projection optimization. For explicit Euler, current position and velocity determine the next position; semi-implicit Euler links it to the next velocity. Optimizing only necessary velocity components produced comparable quality more quickly, while position-based projection diverged faster in the reported experiments. This reduction uses structural knowledge beyond merely calling an unlabeled simulator.
Equation 19
| (19) |
Appendix B Inverse Dynamics
Inverse dynamics is a numerical verification tool. A convex-combination search works especially well for control-affine dynamics, while random directional search and line search refine more difficult cases. Even the combination lacks adequate precision or speed for some systems; twelve action dimensions require 4,096 hyperrectangle vertices. The recursive verifier supplies a feasible comparison rollout rather than a certified global nearest trajectory. All three original algorithms and the control-affine derivation are retained.
Equation
Appendix C Diffusion implementation details
The implementation uses five deterministic denoising steps, noise levels from eighty to 0.002 before the final zero, and a projection transition band from 0.2 to 0.0021. The appendix derives the first-order sampler and lists architecture and horizon choices. Algorithm 8’s return line says the initial trajectory, although its loop and the main inference algorithm imply the final trajectory; the original is preserved and this apparent typo is identified rather than silently repaired.
| Environment parameters | DiT parameters | ||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Robot |
|
|
|
width | depth |
|
conditioned |
|
| ||||||||||||
| Hopper | no | S | |||||||||||||||||||
| Hopper | no | SA | |||||||||||||||||||
| Hopper | on | A | |||||||||||||||||||
| Walker2d | no | S | |||||||||||||||||||
| Walker2d | no | SA | |||||||||||||||||||
| Walker2d | on | A | |||||||||||||||||||
| HalfCheetah | no | SA | |||||||||||||||||||
| HalfCheetah | on | A | |||||||||||||||||||
| Quadcopter | no | S | |||||||||||||||||||
| Quadcopter | no | SA | |||||||||||||||||||
| Quadcopter | on | A | |||||||||||||||||||
| Unitree GO1 | on | SA | |||||||||||||||||||
| Unitree GO1 | on , | A | |||||||||||||||||||
| Unitree GO2 | on | SA | |||||||||||||||||||
| Unitree GO2 | on , | A | |||||||||||||||||||
Equations 20
| (20) |
Appendix D Experiments details
Because simulator-version differences can accumulate over long trajectories, the authors generate reproducible demonstrations instead of using D4RL data unchanged. Learned feedback controllers supply the ground robots’ data, and predictive control supplies the quadcopter trajectories. The appendices document both reproducibility constraints and domain-specific knowledge used for evaluation.
D-A HalfCheetah
HalfCheetah is numerically sensitive: even roughly 10⁻¹² single-step inverse error can yield cumulative error around 10⁻². Its prediction horizon is therefore restricted to two hundred steps, compared with three hundred for Hopper and Walker. Solver error and horizon selection must be considered when interpreting cross-environment admissibility metrics.
D-B Quadcopter
The seventeen-state quadcopter uses four propeller-acceleration controls and smooth dynamics. A predictive controller generates one thousand slalom demonstrations from randomized near-hover initial states. Training obstacles have radius 0.9, while diffusion evaluation uses radius 0.7, easing the passage. Evaluation inverse dynamics uses known propeller inertia because generic black-box solvers are inadequate; that extra knowledge is confined to verification rather than supplied to the planner.
D-C Unitree GO1
GO1 demonstrations come from a joystick-conditioned feedback policy with randomized velocity commands. One thousand trajectories contain five hundred steps each. The diffusion action is a target joint angle for a low-level proportional–derivative controller, rather than direct motor torque. The study does not report a sufficiently accurate inverse-dynamics verifier for these thirty-seven-state, twelve-action trajectories.
D-D Unitree GO2
GO2 uses a custom simulation derived from the GO1 setup and the robot model collection, with the same state/action representation and one thousand command-conditioned demonstrations. It likewise lacks the accurate inverse solver required for state-only evaluation. Differences between the two quadrupeds expose the inconsistency of the action-only baseline despite similar task structure.
D-E Hardware settings
Hardware executes five hundred target-angle points at fifty hertz over ten seconds, with commands held between points and sent through a higher-rate interface. Low-level feedback remains active, so open-loop here means no trajectory replanning. A four-second initialization aligns the robot with the plan’s initial state. Gains are 35.0 and 0.5239. The source’s fifty-to-five-hundred-hertz explanation contains an inconsistent ten-hertz phrase, and its corridor-width descriptions are not fully consistent; the edition does not infer a more precise geometry or timing than those records support.
D-F Computational overhead
Vertex-based reachable-set projection scales exponentially with action dimension and is much slower than direct action rollout. The CPU timing table gives, for example, twenty-eight seconds for projected Hopper state planning versus 0.1 seconds without projection, and 8.7 seconds for corrected GO2 joint planning versus 2.6 seconds without projection. Those timings generate batches and are not per-control-step latencies. The caption states three hundred steps, while the environment configuration uses five hundred for quadrupeds; the source does not resolve that timing-scope difference. Training uses one A100 and ranges from hours to about a day.
| Hopper | 0.1 | 28 | 7 | 0.2 | 0.5 | 1 |
| Walker | 0.3 | 32 | 20 | 0.5 | 0.8 | 1.3 |
| Quadcopter | 0.3 | 24 | 39 | 0.3 | 0.5 | 0.8 |
| GO2 | - | - | - | 2.6 | 5.5 | 8.7 |