- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
DynamicManip proposes and implements a new system for dynamic manipulation. The key contributions are twofold:
- It introduces a data augmentation pipeline that synthesizes trajectories for dynamic manipulation tasks from a single static demonstration, using a combination of heuristically defined rules and motion-planning methods.
- It introduces an adaptive policy that dynamically adjusts the feedback interval and computational allocation during inference.
The authors demonstrate clear improvements in inference latency and task performance on their proposed benchmark.
Critical strengths
The proposed methods are technically sound and could be valuable to the robotics community, particularly if the codebase and benchmark suite are made publicly available.
Critical weaknesses
- Limited methodological novelty. The proposed methods are relatively intuitive and offer limited originality. While applying this data augmentation pipeline to dynamic manipulation tasks may be novel, the underlying approach of manual keyframe selection and trajectory planning between keyframes is well established in the literature. Similarly, adaptive inference for reducing latency and improving computational efficiency has been widely explored in prior work.
- Limited scope of experimental evaluation. Although the authors demonstrate significant improvements on their proposed benchmark, they do not evaluate their method on existing dynamic manipulation benchmarks, such as DOMINO. Furthermore, the main policy comparisons primarily focus on DP3, with limited comparisons against alternative approaches to dynamic manipulation.
Questions for authors
- Could the authors evaluate their data augmentation method on dynamic manipulation tasks from existing benchmarks, such as DOMINO, to further demonstrate its generalizability?
- Could the authors provide additional experiments or discuss the following comparison between two approaches?
- Trajectory synthesis + IL: Generate 100 trajectories using the proposed data augmentation pipeline, followed by imitation learning.
- Demonstration-guided RL: Start with 5 simulation demonstrations and use demonstration-guided RL (e.g., RLPD) to learn a policy through exploration and environmental feedback.
The central question is whether the exploration required for dynamic manipulation is better guided by manually designed rules and motion planning, as in the proposed method, or learned autonomously through RL. How do these approaches compare in terms of policy performance, human engineering effort, and computational cost?
- In Table 1, when controlling for dataset size (50 trajectories), the proposed augmentation method achieves substantially higher success rates than conventional simulated demonstrations on several tasks, particularly Dynamic Tapping (45% vs. 19%) and Object Catching (70% vs. 37%). Could the authors explain why the generated trajectories lead to substantially better downstream policy performance despite having the same number of training examples? Additionally, this performance gap seems to become much smaller when the dataset size increases to 200 trajectories. Could the authors explain this scaling behavior?
8 comments
Weakness 2: Evaluation beyond our benchmark and DP3
Thank you for highlighting the need to make this evidence more prominent.Our evaluation extends beyond DP3: we add DOMINO experiments and already report π₀ transfer in the submitted appendix.
External benchmark: DOMINO. We evaluate two tasks over 100 test episodes each:
| Method | Handover Mic (%) | Move Can Pot (%) | Average (%) |
|---|---|---|---|
| DP3: 50 conventional expert demonstrations | 32 | 16 | 24.0 |
| DynamicManip: augmented training + stage-aware scheduling | 51 | 51 | 51.0 |
Question 1 provides the intermediate configurations. These results extend the evaluation to two tasks from an independently developed benchmark.
Transfer to a VLA policy. Appendix F.3 and Table 17 evaluate our stage-prediction and stage-conditioned replanning strategy with π₀:
| Policy | Goal Blocking (%) | Object Catching (%) |
|---|---|---|
| π₀ | 22 | 28 |
| π₀ + our stage-aware learning and replanning | 62 | 40 |
This experiment supports transfer of the stage-aware learning and replanning component to another policy family, complementing the point-cloud data-augmentation evaluation.
DP3 is the main controlled baseline because it directly consumes the generated point clouds. We will highlight the existing comparisons in the main text and add the DOMINO results in the revision.
Question 1: Generalization to DOMINO
On two DOMINO tasks, mean success increases from 24.0% for conventional DP3 to 44.5% with augmentation-based training and 51.0% with stage-aware scheduling. We evaluate Handover Mic and Move Can Pot over 100 test episodes per task.
| Experimental setting | Specification |
|---|---|
| Conventional baseline | DP3 trained on 50 dynamic expert demonstrations per task. |
| Augmentation-based training | 50 generated trajectories from one source demonstration per task, with automatic stage labels for auxiliary supervision. |
| Inference variants | Standard inference; fixed Taylor acceleration and action-chunk scheduling; predicted-stage scheduling. |
| Evaluation | 100 test episodes per task and configuration. |
| Configuration | Handover Mic (%) | Move Can Pot (%) | Average (%) |
|---|---|---|---|
| DP3: 50 conventional expert demonstrations | 32 | 16 | 24.0 |
| Augmented training + standard inference | 43 | 46 | 44.5 |
| Augmented training + fixed scheduling | 44 | 47 | 45.5 |
| Augmented training + stage-aware scheduling | 51 | 51 | 51.0 |
The comparisons distinguish the training pipeline from the additional benefit of inference scheduling:
| Comparison | Handover Mic gain (pp) | Move Can Pot gain (pp) | Mean gain (pp) |
|---|---|---|---|
| Augmented training + standard inference vs. conventional DP3 | +11 | +30 | +20.5 |
| Stage-aware vs. validation-tuned fixed scheduling | +7 | +4 | +5.5 |
| Stage-aware vs. standard inference on augmented training | +8 | +5 | +6.5 |
Here, pp denotes percentage points. The first comparison reflects the augmentation-based training pipeline, including auxiliary stage supervision. The latter comparisons assess the additional gains from stage-aware inference.
We will include these settings and results in the revision, identifying their scope as two external tasks rather than the full DOMINO suite.
We thank the reviewer for recognizing the technical soundness and potential value of DynamicManip. Below, we clarify the methodological contribution, present the additional DOMINO and demonstration-guided RL experiments, and explain the data-scaling results.
Weakness 1: Methodological novelty
Our contribution is a unified interaction-stage formulation that connects static-to-dynamic trajectory synthesis, stage-supervised policy learning, and adaptive execution. We agree that keyframe-based trajectory editing, motion planning, and inference acceleration are established techniques. The technical distinction lies in how these components address the temporal requirements of dynamic manipulation together (Sections 3.2–3.3).
1. Dynamic synthesis requires temporal coordination. A spatially valid motion can fail when the target moves before contact. Our pipeline samples object motions and constructs time-varying interaction targets, so the robot's alignment motion is coordinated with the moving object. The four stage operators assign different roles to planning and demonstration reuse: planning generates feasible alignment and transition motions, while anchor-based replay preserves short, contact-rich interaction patterns that are difficult to specify through motion planning alone. This decomposition supports new dynamic episodes from one static demonstration while retaining its task-relevant interaction structure.
2. The synthesis process also supplies supervision for adaptive execution. Each generated timestep inherits the identity of its generating stage operator. These labels supervise a lightweight stage-prediction head alongside action learning, without requiring additional per-timestep annotation. At deployment, the policy predicts the stage from observations; it does not require ground-truth stage labels. Thus, the same interaction structure used to generate demonstrations also teaches the policy when different execution behaviors are needed.
3. Stage-conditioned inference addresses different control requirements. The predicted stage selects the Taylor recomputation interval, approximation order, and action-chunk execution length through stage-conditioned rules. Dynamic alignment uses short action chunks and accelerated inference for frequent feedback; contact execution uses more frequent full computation and longer action prefixes to preserve local motion consistency. These choices follow the distinct requirements of the stages used during synthesis. Table 4 provides supporting evidence: with the same checkpoint and evaluation episodes, stage-aware scheduling achieves 64% versus 34% for fixed Taylor acceleration on Object Catching, and 88% versus 67% on Goal Blocking.
We will sharpen this distinction in the revision: the contribution is the shared stage structure and its concrete use across data generation, supervision, and execution. We will also make clear which underlying techniques are inherited from prior work and that the scheduling rules are heuristic.