- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper uses a learned world model to plan LEGO assembly sequences through look-ahead, with exact checks before committing actions. It reports higher success rates and fewer oracle calls than the evaluated baselines.
Critical strengths
The paper tackles a practical planning problem where a feasible action can lead to a dead end.
Combining learned look-ahead with exact checks before committing actions is a sensible design.
The ablations provide evidence that look-ahead and broader geometric context improve performance.
Critical weaknesses
The problem is interesting, and combining learned look-ahead with exact checks before committing actions makes sense. However, I have several concerns:
-
Timeouts are excluded from the success rate. The reported 95.4% is based on 925 of the 1,200 test structures. Excluding harder cases could make the results overly optimistic. Please report results on the full test set, counting timeouts as failures.
-
The benefit of learned dynamics is unclear. Removing a brick gives a known next state. Why predict its latent representation instead of updating the structure and re-encoding the affected anchors? This is a key missing baseline.
-
Fewer oracle calls do not mean faster planning. In Table 1, depth 3 improves success from 80.5% to 83.9%, but increases median runtime from 43 to 137 seconds. Please compare success rates under the same time budget.
-
The local search restriction needs justification. Removing a brick can affect distant collisions or stability. Why does look-ahead only expand neighboring bricks? Are other feasible actions still considered?
-
The feasibility checks need a shared configuration. As written, press, reach, and collision can each pass under different gripper configurations. A valid action needs one configuration satisfying all three. Does the implementation enforce this?
-
The baseline comparison needs clarification. ASAP uses pretrained weights from another setting, and its near-zero success rates deserve a failure analysis. Does the WorkBenchMark implementation preserve its full search procedure?
-
Relevant search-based work is missing. State-Based Disassembly Planning (Lei et al., AAAI 2025) reduces redundant simulation through intermediate-state reuse and directional blocking graphs. Although the task assumptions differ, please discuss this work and explain what learned dynamics adds beyond improved search and state reuse. An adapted baseline would help separate these effects.
Overall, the approach looks promising, but the current experiments do not yet clearly establish the added value of the learned world model.
Questions for authors
See Weakness
2 comments
Response to Reviewer r52J (2/2)
Q4: The local search restriction needs justification. Removing a brick can affect distant collisions or stability. Why does look-ahead only expand neighboring bricks? Are other feasible actions still considered?
We want to clarify a possible misreading, since these are two separate things. Collision and stability are always checked globally: every feasibility check reads the full set of anchor tokens, not a neighborhood, so when removing a brick, our method can detect distant collisions or instability. The neighborhood restriction applies only to which future candidates a rollout expands when it looks ahead, which is a pruning of the search tree. The set of actions that can actually be committed is always fully enumerated. We select one candidate from that full set and commit a single step, so there is no requirement that the next step be near the previous one.
Q5: The feasibility checks need a shared configuration. As written, press, reach, and collision can each pass under different gripper configurations. A valid action needs one configuration satisfying all three. Does the implementation enforce this?
Yes. A valid action enforces a single gripper configuration that satisfies press, reach, stability, and collision together, and this is shown in equation 1 as a conjunction of the five predicates.
Q6: The baseline comparison needs clarification. ASAP uses pretrained weights from another setting, and its near-zero success rates deserve a failure analysis. Does the WorkBenchMark implementation preserve its full search procedure?
On ASAP, we retrained ASAP on our own data with our exact LP stability labels, and we report a ladder on the 75 small structures under the same exact ruler: success rises from 2 of 75 with the original weights, to 6 of 75 when those weights are paired with our LP, to 11 of 75 when ASAP is retrained on our data, to 26 of 75 when it is both retrained and scored with our LP. For reference, our planner solves 49 of 75 at and 75 of 75 at on the same structures. Retraining changes the order of the search, but it still cannot pass the collision verification, which indicates the contribution of the world model and collision head.
On WorkBenchMark, yes, our implementation preserves its full search procedure.
Q7: Relevant search-based work is missing. State-Based Disassembly Planning (Lei et al., AAAI 2025) reduces redundant simulation through intermediate-state reuse and directional blocking graphs. Although the task assumptions differ, please discuss this work and explain what learned dynamics adds beyond improved search and state reuse. An adapted baseline would help separate these effects.
We will add and discuss this work. We note first that intermediate-state reuse is not a point of difference, since we also memorize repeated states, with a hit rate of 64.3 percent inside the look-ahead. Scoped to the latent dynamics model, it predicts states that are never materialized, whereas both state reuse and directional blocking graphs accelerate evaluation on states that must first be constructed. Moreover, it is trained once and amortized across all held-out structures, whereas a directional blocking graph is built per assembly.
Response to Reviewer r52J (1/2)
We thank the reviewer for the insightful comments and feedback. Below we address the questions and concerns:
Q1: Timeouts are excluded from the success rate. The reported 95.4% is based on 925 of the 1,200 test structures. Excluding harder cases could make the results overly optimistic. Please report results on the full test set, counting timeouts as failures.
We report the full test set of 4,785 structures.
With timeouts counted as failures, our method remains the strongest.
Q2: The benefit of learned dynamics is unclear. Removing a brick gives a known next state. Why predict its latent representation instead of updating the structure and re-encoding the affected anchors? This is a key missing baseline.
The necessity of latent dynamics model is that it avoids re-deriving the global quantities in latent rollouts. An incremental encoder must still maintain the occupancy grid, the exposed-face set, and the per-brick contact counts for the next state, while the latent dynamics model infers the change to latent features from the given brick alone and reconstructs nothing else. Updating the latent through the dynamics model takes 0.34 milliseconds, against 1.56 milliseconds to produce the same update by re-encoding. The substitution is lossless: against a control that re-encodes the exact next structure, the two agree under a paired test with p equal to 1, at 0.0175 against 0.0178 misplacements per brick.
Q3: Fewer oracle calls do not mean faster planning. In Table 1, depth 3 improves success from 80.5% to 83.9%, but increases median runtime from 43 to 137 seconds. Please compare success rates under the same time budget.
The main table is already produced under a fixed wall-clock budget of 1800 seconds per structure. The depth-3 and depth-0 numbers are therefore already a same-budget comparison.