{"total":45,"rows":[{"id":"2312.08782","title":"Toward General-Purpose Robots via Foundation Models: A Survey and Meta-Analysis","created":"2023-12-14","cited_by_count":103,"area":null},{"id":"2312.11143","title":"Learning Domain-Independent Heuristics for Grounded and Lifted Planning","created":"2023-12-18","cited_by_count":31,"area":null},{"id":"2107.00110","title":"Classical Planning in Deep Latent Space","created":"2021-06-30","cited_by_count":22,"area":null},{"id":"2205.06002","title":"Learning Generalized Policies Without Supervision Using GNNs","created":"2022-05-12","cited_by_count":22,"area":null},{"id":"2109.14830","title":"Reinforcement Learning for Classical Planning: Viewing Heuristics as Dense Reward Generators","created":"2021-09-30","cited_by_count":21,"area":null},{"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":"2208.07737","title":"Learning Efficient Abstract Planning Models that Choose What to Predict","created":"2022-08-16","cited_by_count":17,"area":null},{"id":"2203.14852","title":"Learning Sketches for Decomposing Planning Problems into Subproblems of Bounded Width: Extended Version","created":"2022-03-28","cited_by_count":12,"area":null},{"id":"2112.15484","title":"A Research Agenda for AI Planning in the Field of Flexible Production Systems","created":"2021-12-31","cited_by_count":8,"area":null},{"id":"2301.10280","title":"NeSIG: A Neuro-Symbolic Method for Learning to Generate Planning Problems","created":"2023-01-24","cited_by_count":6,"area":null},{"id":"2308.11905","title":"On Using Admissible Bounds for Learning Forward Search Heuristics","created":"2023-08-23","cited_by_count":5,"area":null},{"id":"2410.24080","title":"Graph Learning for Numeric Planning","created":"2024-10-31","cited_by_count":5,"area":null},{"id":"2212.02823","title":"Hierarchical Decomposition and Analysis for Generalized Planning","created":"2022-12-06","cited_by_count":4,"area":null},{"id":"2305.09840","title":"Scale-Adaptive Balancing of Exploration and Exploitation in Classical Planning","created":"2023-05-16","cited_by_count":4,"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":"2206.14298","title":"Left Heavy Tails and the Effectiveness of the Policy and Value Networks in DNN-based best-first search for Sokoban Planning","created":"2022-06-28","cited_by_count":3,"area":null},{"id":"2207.03336","title":"Sampling from Pre-Images to Learn Heuristic Functions for Classical Planning","created":"2022-07-07","cited_by_count":3,"area":null},{"id":"2211.13316","title":"Understanding Sample Generation Strategies for Learning Heuristic Functions in Classical Planning","created":"2022-11-23","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":"2102.04518","title":"A* Search Without Expansions: Learning Heuristic Functions with Deep Q-Networks","created":"2021-02-08","cited_by_count":2,"area":null},{"id":"2107.02603","title":"Meta-Reinforcement Learning for Heuristic Planning","created":"2021-07-06","cited_by_count":2,"area":null},{"id":"2202.00907","title":"Using Deep Learning to Bootstrap Abstractions for Hierarchical Robot Planning","created":"2022-02-02","cited_by_count":2,"area":null},{"id":"2203.00669","title":"Hierarchical Reinforcement Learning with AI Planning Models","created":"2022-03-01","cited_by_count":2,"area":null},{"id":"2209.05206","title":"A Differentiable Loss Function for Learning Heuristics in A*","created":"2022-09-12","cited_by_count":2,"area":null},{"id":"2304.10590","title":"A Review of Symbolic, Subsymbolic and Hybrid Methods for Sequential Decision Making","created":"2023-04-20","cited_by_count":2,"area":null},{"id":"2306.04019","title":"Learning Search-Space Specific Heuristics Using Neural Networks","created":"2023-06-06","cited_by_count":2,"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":"2211.15666","title":"Learning Visual Planning Models from Partially Observed Images","created":"2022-11-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":"2202.01108","title":"Learning to reason about and to act on physical cascading events","created":"2022-02-02","cited_by_count":0,"area":null},{"id":"2207.04479","title":"Scaling up ML-based Black-box Planning with Partial STRIPS Models","created":"2022-07-10","cited_by_count":0,"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":"2508.13371","title":"LOOP: A Plug-and-Play Neuro-Symbolic Framework for Enhancing Planning in Autonomous Systems","created":"2025-08-18","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":"2510.14035","title":"GammaZero: Learning To Guide POMDP Belief Space Search With Graph Representations","created":"2025-10-15","cited_by_count":0,"area":null},{"id":"2602.04557","title":"Textual Planning with Explicit Latent Transitions","created":"2026-02-04","cited_by_count":0,"area":null},{"id":"2602.23148","title":"On Sample-Efficient Generalized Planning via Learned Transition Models","created":"2026-02-26","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.04597","title":"Learning Admissible Heuristics via Cost Partitioning","created":"2026-06-03","cited_by_count":0,"area":null}],"next_cursor":null}