Anonymous review materials

Shared Execution-Clock Drifting (SECD)

One-Step Generation with Explicit Execution-Time Allocation

Anonymous Authors

Submitted to ICRA 2027

Overview

Teaser

SECD · Conveyor Cup

SECD repeatedly retrieves cups from a conveyor moving at 16 m/min using one network evaluation per action chunk.

Paper

Abstract

Manipulation under time constraints requires both accurate actions and an execution rhythm that matches the evolving scene. This becomes critical when a robot must intercept moving objects or complete a sequence of adjustments before a deadline. Although one-step policies reduce generation cost, their directly predicted action sequences leave temporal allocation implicit. We propose Shared Execution-Clock Drifting (SECD), which makes execution rhythm an explicit part of one-step action generation. Conditioned on an observation and a latent sample, the policy jointly predicts a progress-indexed action curve and a shared monotone clock that maps fixed control times to locations on the curve. Demonstration-derived alignment anchors this decomposition, which is trained jointly through drifting on the decoded actions. The resulting policy retains a fixed-rate control interface and requires one network evaluation. We evaluate SECD across four real-robot tasks with inference on NVIDIA Thor. Across 300 trials, it achieves 77.00% task-averaged success and outperforms the evaluated one-step baselines on every task, including 91% success in cup retrieval from a 16 m/min conveyor and 54% in restoring and folding a crumpled shirt within 90 s. A fixed-clock variant reaches 79% on the same conveyor protocol. Complementary state-based RoboMimic experiments, including cross-seed ablations on Transport and Square, further support the joint design of the temporal representation and demonstration alignment.

Method

Shared Execution-Clock Drifting

The method jointly models an action progress curve and an execution clock, then decodes fixed-rate actions on a uniform physical-time grid.

Method overview of Shared Execution-Clock Drifting, showing joint generation, shared temporal decoding, fixed-rate actions, and the training objective
Shared Execution-Clock Drifting. A joint generator predicts a progress curve and a monotone clock, which decode to fixed-rate actions in one network evaluation. Demonstration alignment and decoded-action drifting jointly train both outputs. Curves and clock profiles are schematic.

Real-world evaluation

Hardware Setup

Experiments use single-arm and dual-arm robot platforms with wrist-camera observations and onboard inference.

Hardware setup with a Franka Research 3 single-arm robot, a Flexiv Rizon 4s dual-arm robot, wrist cameras, grippers, and a Jetson AGX Thor inference computer
Real-robot hardware setup. A Franka Research 3 arm performs conveyor retrieval, while two Flexiv Rizon 4 arms perform shirt manipulation. The insets show the gripper and wrist camera, example RGB observations, and the NVIDIA Jetson AGX Thor computer on which all compared policies run inference.

Robot experiments

Real-World Policy Comparisons

Representative rollouts compare DP (16 NFE), OneDP, Naive Drifting, and SECD under shared task data and robot-side deployment settings.

Task 01

Conveyor Cup

A single arm retrieves cups from a conveyor moving at 16 m/min within a short interception window.

DP

16 NFE
Representative failure

OneDP

1 NFE
Representative failure

Naive Drifting

1 NFE
Failure 1

SECD Ours

1 NFE
Seven consecutive retrievals
Task 02

Fold (Crumpled)

The robot must restore a randomly crumpled shirt and complete the full folding sequence within 90 seconds.

DP

16 NFE
Representative failure

OneDP

1 NFE
Representative failure

Naive Drifting

1 NFE
Representative failure

SECD Ours

1 NFE
Representative success
Task 03

Fold (Flat)

Two arms fold both sleeves of a flat shirt, complete two half-folds, and reorient the shirt between folds.

DP

16 NFE
Representative success

OneDP

1 NFE
Representative success

Naive Drifting

1 NFE
Representative failure

SECD Ours

1 NFE
Representative success
Task 04

Cup Place

A dual-arm system grasps a stationary cup and places it on a randomly positioned coaster.

DP

16 NFE
Representative success

OneDP

1 NFE
Success

Naive Drifting

1 NFE
Representative success

SECD Ours

1 NFE
Success 1

Evaluation

Quantitative Results

Real-robot success rate and mean policy inference time on NVIDIA Thor across 300 trials.

MethodNFELatency (ms)Cup PlaceFold (Flat)Fold (Crumpled)Conveyor CupAverage
DP1625298.074.030.00.050.50
OneDP12671.038.022.031.040.50
Naive Drifting12483.048.026.056.053.25
SECD (Ours)12595.068.054.091.077.00

Success rate (%). Each policy is evaluated on 100 Cup Place, 50 Fold (Flat), 50 Fold (Crumpled), and 100 Conveyor Cup trials. Bold denotes the highest success in each task.

Analysis

Fixed-Clock Ablation

A separately trained variant replaces the learned execution clock with a uniform fixed clock while retaining the curve head.

Fixed uniform clock79%Conveyor Cup success
SECD91%Conveyor Cup success

Both evaluations use 100 cups on the same 16 m/min conveyor protocol. The 12-point difference supports the complete aligned temporal representation.