TRACT: Temporally Routed Action Chunks with Chronological Phase Authority for Contact-Rich Manipulation

• URL: http://arxiv.org/abs/2607.29285v2
• Date: Thu, 06 Aug 2026 02:54:15 GMT
• Title: TRACT: Temporally Routed Action Chunks with Chronological Phase Authority for Contact-Rich Manipulation
• Abstract summary: Action chunking shortens the effective decision horizon of robot imitation learning.<n>We present TRACT, which factorizes phase-structured action chunking into an accepted current phase and a single CURRENT variants-to- boundary inside the future horizon.
• Score: 33.980402689056895
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Action chunking shortens the effective decision horizon of robot imitation learning by predicting multiple future actions, while conventional phase conditioning describes the current control instant. When a predicted horizon crosses a procedural boundary, assigning the current phase to the entire chunk creates a structural temporal mismatch. We present TRACT, which factorizes phase-structured action chunking into an accepted current phase and a single CURRENT-to-NEXT boundary inside the future horizon. A task-local graph constrains chronological phase authority, and a cumulative boundary distribution monotonically routes future queries through phase-specific query and action paths. For contact execution, a causal response-deficit integrator compares policy intent with ACK-eligible subsequent motion, accumulates arm compensation when directional response is suppressed, and decays after confirmed recovery. Across six real-robot variants with ten trials each, full TRACT achieves 10/10 full-sequence success, 99.00 [88.75, 100.00]% median [min, max] wipe completion, zero observed phase ambiguity, and zero stalls. Under the current complete method package and evaluation setting, the routed representation obtains better observed task results than the flat package (6/10 vs. 3/10 success; 77.08% vs. 8.03% median wipe completion). Chronological authority reduces observed phase ambiguity from 8/10 to 0/10, and response integration reduces stalls from 4/10 to 0/10. The package comparison does not isolate routing from other generator-package differences.

Related papers

• Delayed Optimizer-State Transport Shapes Short-Horizon Training Decisions [0.0]
  We examine whether a delayed transport is large enough to change prospective short-horizon decisions.<n>On committed future-minibatch sequences, we differentiate eight-step AdamW through the complete model-optimizer state.
  arXiv  Detail & Related papers  (2026-08-25T14:18:29Z)
• RynnValue: Scaling Robotic Value Foundation Models with Temporal Distance [84.26294415726723]
  General-purpose reward models are increasingly the bottleneck for scaling robot learning.<n>We introduce RynnValue, an open-source value foundation model for robotic manipulation.<n>RynnValue scales to over 7,000 hours and roughly 3M instruction-conditioned clips without preference or progress annotations.
  arXiv  Detail & Related papers  (2026-08-10T17:09:37Z)
• Hermite Curves as Trajectory Priors for Vision-Language-Action Models [41.51953284790607]
  We introduce Hermite trajectory priors, parameterizing the chunk trajectory as a piecewise cubic Hermite curve defined by endpoint positions and velocities.<n>We instantiate this fixed operator across discrete autoregressive and continuous generative paradigms.<n>Across simulation benchmarks and real-robot platforms, Hermite Regularization achieves superior performance.
  arXiv  Detail & Related papers  (2026-08-02T14:18:17Z)
• FBFM: A Training-Free Asynchronous Feedback Mechanism for Flow-Matching in World-Action Models Execution [50.18922379062543]
  We present Feedback Flow Matching (FBFM), a training-free inference mechanism that pushes re-grounding inside actively generated chunks.<n>Being training-free, the mechanism improves responsiveness to unexpected events and suppresses drift in long-horizon tasks.<n>We evaluate FBFM on both a joint-generation WAM and a stage-wise WAM.
  arXiv  Detail & Related papers  (2026-07-31T10:11:09Z)
• No Free Lunch in Flow Surrogates under Time-Varying Boundary Conditions: A Two-Regime Study [0.48127184936824546]
  Flow surrogate validated on a simple regime is often taken as evidence that the approach will carry to a richer one.<n>We test this assumption on two transient flows under time-varying boundary conditions emulating the process startup.
  arXiv  Detail & Related papers  (2026-07-26T14:02:46Z)
• ChunkFlow: Towards Continuity-Consistent Chunked Policy Learning [5.727608625370017]
  ChunkFlow is a seam-aware training-and-execution framework for chunked policies.<n>It partitions each chunk into frozen, editable, and future zones, applies deterministic overlap blending at execution, and trains raw predictions with seam and first- and second-order continuity losses.<n> Experiments on CALVIN, LIBERO, and real robots show an improved success-stability trade-off with low-latency inference.
  arXiv  Detail & Related papers  (2026-07-14T17:43:25Z)
• From Checker to Forecaster: Code-Owned Evaluation of Model-Generated Strategic Routes Under Delayed Ground Truth [0.0]
  RouteCast instantiates the regime for model-generated typed strategic routes.<n>It produces a provisional forecast-ranking; later outcomes evaluate the forecast.<n>It does not establish prospective calibration, causal decision improvement, route-decomposition advantage, or cross-domain validity.
  arXiv  Detail & Related papers  (2026-07-13T00:36:48Z)
• SEAM: Smooth Execution of Action-Chunked Motion for Vision-Language-Action Policies [26.372187124257362]
  Vision-Language-Action (VLA) policies that execute fixed-length action chunks can exhibit multimodal bifurcation.<n>We propose SEAM (Smooth Execution of Action-Chunked Motion), a training-free inference-time method for flow matching VLAs.<n>On LIBERO-10 with pi_0.5, SEAM reduces boundary jerk by 28%, reduces chunk transition discontinuity by 27%, preserves baseline-level task success, and keeps denoising-loop cost near the unguided baseline.
  arXiv  Detail & Related papers  (2026-07-06T02:32:10Z)
• ReactiveBFM: Reactive Closed-Loop Motion Planning Towards Universal Humanoid Whole-Body Control [54.267632784131415]
  ReactiveBFM is a real-time-loop planning-control framework for humanoids.<n>It mitigates fatal cumulative exposure bias via a scheduled prefix sampling curriculum.<n>It demonstrates unprecedented physical agility across a vast repertoire of text-conditioned closed-loop motions.
  arXiv  Detail & Related papers  (2026-06-29T14:27:27Z)
• ESPO: Early-Stopping Proximal Policy Optimization [78.79610718910628]
  ESPO (Early-Stopping Proximal Policy Optimization) detects trajectory failure on-the-fly and terminates rollouts early.<n>On DeepSeek-R1-Distill-Qwen-7B trained for mathematical reasoning, ESPO surpasses PPO on AIME2024 (46.28% vs. 45.25%), AMC2023 (85.83% vs. 82.94%), and MATH-500 (87.42% vs. 85.43%)
  arXiv  Detail & Related papers  (2026-05-28T12:40:22Z)
• Bridging Discrete Planning and Continuous Execution for Redundant Robot [12.278986080239692]
  Voxel-grid reinforcement learning is widely adopted for path planning in redundant manipulators.<n>However, direct execution through point-wise numerical inverse kinematics on 7-DoF arms often yields step-size jitter.<n>This work proposes a bridging framework between discrete planning and continuous execution without modifying the discrete planner itself.
  arXiv  Detail & Related papers  (2026-04-02T13:23:54Z)
• Stochastic Approximation with Delayed Updates: Finite-Time Rates under Markovian Sampling [73.5602474095954]
  We study the non-asymptotic performance of approximation schemes with delayed updates under Markovian sampling. Our theoretical findings shed light on the finite-time effects of delays for a broad class of algorithms.
  arXiv  Detail & Related papers  (2024-02-19T03:08:02Z)
• Clustered Switchback Designs for Experimentation Under Spatio-temporal Interference [44.644520116360106]
  We estimate the global average treatment effect (GATE), the difference between average outcomes having exposed all units at all times to treatment or to control.<n>We propose a clustered switchback design, where units are grouped into clusters and time steps are grouped into blocks.<n>We show that for graphs that admit good clustering, a truncated Horvitz-Thompson estimator achieves a $tilde O(1/NT)$ mean squared error (MSE)<n>Our results simultaneously generalize the results from citethu2022switchback,ugander2013graph and citetleung2022rate
  arXiv  Detail & Related papers  (2023-12-25T01:00:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.