- Rating
- 2
- Confidence
- 3(+1)
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces GADAR, a domain agnostic, search free classical planning strategy. Taking the current state, goal, and domain description, denoted as π(s, G, D), as input, the strategy directly constructs domain based actions in unseen domains. Its core contribution lies in a domain general graph representation featuring two key additions: binding edges, which explicitly link applicable domain descriptions to lifted precondition instances, and chain layers, which encode producer consumer relationships between schema instances and their distance to the goal. Across eight benchmark domains, a single multi domain GADAR model achieves in domain coverage comparable to domain specific versions and demonstrates zero shot execution in held out domains, significantly outperforming random selection and symbolic multi task control models.
Critical strengths
The paper introduces two novel and well-motivated representations of relationships: (i) binding edges that connect objects in the applicable base to lifted precondition occurrences, and (ii) chain layers atop these lifted occurrences that encode enabling/threat relations and goal-distance buckets. Furthermore, by incorporating the domain description into the policy input, it bridges a significant gap between domain-independent heuristics and per-domain policies. (I place particular importance on this aspect.)
Critical weaknesses
1: Experiments show that while zero-shot coverage is significantly higher than random coverage, it remains low on average—and very low in certain domains (e.g., 4% for logistics, 6% for grippers)—highlighting the limitations of relying solely on structural, renaming-invariant features to distinguish between structurally similar patterns. (This point is important to me.)
2: Regarding the lack of comparison with related work, this paper offers only a limited discussion of recent search-guided relational strategy learning methods (such as GSP).
Questions for authors
1: Could you compare the zero-shot strategy against domain-agnostic heuristic search methods (e.g., GOOSE with LLG) on the held-out domains to demonstrate the utility of the zero-shot strategy relative to search-based zero-shot baselines?
2: Could you conduct ablation studies by incrementally adding chain edges, grounding-effect edges (), and goal features to the GADAR-BIND model to isolate their respective contributions? This would help clarify which component drives the significant performance gains observed in models like Visitall.