- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes A2-CAP, a causal attribute–affordance graph framework for long-horizon manipulation with frozen VLA policies. PiCausal constructs structured graphs using predefined strategies, while CAP-Plan uses these graphs for skill planning, outcome verification, and failure recovery. The authors introduce A2-CausalHOI, containing 1,305 interaction videos, and evaluate graph recovery across three datasets. Real-robot experiments on two dual-arm tasks demonstrate improvements over the reported baselines.
Critical strengths
The attribute–affordance graph provides an interpretable way to connect object properties, executable skills, and expected outcomes without updating the VLA policy during execution. The new dataset and evaluations across three VLM backbones demonstrate consistent improvements in graph recovery. The additional experiments on independent annotations help assess the robustness of these results.
Critical weaknesses
The ground-truth graphs are generated using the same strategy templates employed by PiCausal, while the VLM-only baseline does not have access to these templates. Although the authors provide additional annotation controls, the large F1 improvements may partly reflect alignment with the predefined graph representation rather than general causal understanding. All scored robot experiments use pre-generated graphs, and no valid trial exercises graph-guided rollback. Furthermore, the task success metric includes graph-dependent planning penalties, making it difficult to isolate improvements in physical execution. The small number of trials also limits the strength of the conclusions.
Questions for authors
Appendix E.6 indicates that strategy activation in the main evaluation relies on the object database rather than fused visual observations. How does PiCausal adapt to changes in an object's observed state when its category remains the same? Could the authors report physical task success separately from the graph-dependent planning score? This would help clarify whether the improvements reflect better physical execution or agreement with the predefined graph. Could the authors provide a controlled evaluation of the complete online graph-to-action pipeline, including a failure requiring graph-guided rollback rather than a local retry?