Generalized Planning on IPC Childsnack 2023 (test)
71CoverageDistincter
Evaluation results
| Method | Links | ||
|---|---|---|---|
| Distincter2026.05 | 71 | — | |
| R-GNN (Ω-Heu)Architecture=R-GNN, Policy Formulation=Heuristic regularized (Ω-Heu), Time Limit=1 minute, Memory Limit=8 GB2026.03 | 54.4 | 41.5 | |
| WL-f2026.05 | 52 | — | |
| R-GNN (Ω-Exp)Architecture=R-GNN, Policy Formulation=Explicit regularized (Ω-Exp), Time Limit=1 minute, Memory Limit=8 GB2026.03 | 51.1 | 41.4 | |
| GSPπSearch Strategy=greedy policy, Search Budget=10,000 expansions or 1 hour2026.05 | 41 | 31 | |
| Lifted HER2026.05 | 40 | 35 | |
| LAMA2026.05 | 40 | 46 | |
| LAMA-firstTime Limit=1 minute, Memory Limit=8 GB2026.03 | 35.2 | 41.8 | |
| GSPWA⋆Search Strategy=WA⋆ (w = 2) heuristic, Search Budget=10,000 expansions or 1 hour2026.05 | 29 | 22 | |
| R-GNN (V)Architecture=R-GNN, Policy Formulation=State-value (V), Time Limit=1 minute, Memory Limit=8 GB2026.03 | 5.6 | 41.2 | |
| α0Search Strategy=AlphaZero-style learning2026.05 | 0 | — |