{"total":26,"rows":[{"id":"2403.16508","title":"Return to Tradition: Learning Reliable Heuristics with Classical Machine Learning","created":"2024-03-25","cited_by_count":19,"area":null},{"id":"2503.18809","title":"Classical Planning with LLM-Generated Heuristics: Challenging the State of the Art with Python Code","created":"2025-03-24","cited_by_count":18,"area":null},{"id":"2501.18784","title":"Successor-Generator Planning with LLM-generated Heuristics","created":"2025-01-30","cited_by_count":7,"area":null},{"id":"2410.24080","title":"Graph Learning for Numeric Planning","created":"2024-10-31","cited_by_count":5,"area":null},{"id":"2406.02598","title":"Towards Learning Foundation Models for Heuristic Functions to Solve Pathfinding Problems","created":"2024-06-01","cited_by_count":4,"area":null},{"id":"2504.20318","title":"Leveraging Action Relational Structures for Integrated Learning and Planning","created":"2025-04-29","cited_by_count":4,"area":null},{"id":"2511.12913","title":"CoS: Towards Optimal Event Scheduling via Chain-of-Scheduling","created":"2025-11-17","cited_by_count":4,"area":null},{"id":"2411.19886","title":"PDDLFuse: A Tool for Generating Diverse Planning Domains","created":"2024-11-29","cited_by_count":3,"area":null},{"id":"2412.04752","title":"Graph Neural Network Based Action Ranking for Planning","created":"2024-12-06","cited_by_count":3,"area":null},{"id":"2410.07923","title":"Deep Learning for Generalised Planning with Background Knowledge","created":"2024-10-10","cited_by_count":2,"area":null},{"id":"2502.00145","title":"Counting and Reasoning with Plans","created":"2025-01-31","cited_by_count":2,"area":null},{"id":"2504.19738","title":"Learning Efficiency Meets Symmetry Breaking","created":"2025-04-28","cited_by_count":2,"area":null},{"id":"2508.18515","title":"Weisfeiler-Leman Features for Planning: A 1,000,000 Sample Size Hyperparameter Study","created":"2025-08-25","cited_by_count":2,"area":null},{"id":"2509.22626","title":"Learning Admissible Heuristics for A*: Theory and Practice","created":"2025-09-26","cited_by_count":2,"area":null},{"id":"2402.04874","title":"Choosing a Classical Planner with Graph Neural Networks","created":"2024-01-25","cited_by_count":1,"area":null},{"id":"2411.00577","title":"WLPlan: Relational Features for Symbolic Planning","created":"2024-11-01","cited_by_count":1,"area":null},{"id":"2605.29649","title":"LLM-Evolved Domain-Independent Heuristics for Symbolic AI Planning","created":"2026-05-28","cited_by_count":1,"area":null},{"id":"2412.02136","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","created":"2024-12-03","cited_by_count":0,"area":null},{"id":"2506.11721","title":"Relational GNNs Cannot Learn $C_2$ Features for Planning","created":"2025-06-13","cited_by_count":0,"area":null},{"id":"2508.18520","title":"Symmetry-Invariant Novelty Heuristics via Unsupervised Weisfeiler-Leman Features","created":"2025-08-25","cited_by_count":0,"area":null},{"id":"2509.17062","title":"From domain-landmark graph learning to problem-landmark graph generation","created":"2025-09-21","cited_by_count":0,"area":null},{"id":"2511.10164","title":"Two Constraint Compilation Methods for Lifted Planning","created":"2025-11-13","cited_by_count":0,"area":null},{"id":"2603.17544","title":"Per-Domain Generalizing Policies: On Learning Efficient and Robust Q-Value Functions (Extended Version with Technical Appendix)","created":"2026-03-18","cited_by_count":0,"area":null},{"id":"2605.16142","title":"Property-Guided LLM Program Synthesis for Planning","created":"2026-05-15","cited_by_count":0,"area":null},{"id":"2606.02438","title":"LLM-Evolved Pattern Generators for Optimal Classical Planning","created":"2026-06-01","cited_by_count":0,"area":null},{"id":"2606.04597","title":"Learning Admissible Heuristics via Cost Partitioning","created":"2026-06-03","cited_by_count":0,"area":null}],"next_cursor":null}