{"total":19,"rows":[{"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":"2203.04605","title":"Representation, learning, and planning algorithms for geometric task and motion planning","created":"2022-03-09","cited_by_count":8,"area":null},{"id":"2203.04120","title":"Graph-based Reinforcement Learning meets Mixed Integer Programs: An application to 3D robot assembly discovery","created":"2022-03-08","cited_by_count":6,"area":null},{"id":"2404.05235","title":"Novelty Heuristics, Multi-Queue Search, and Portfolios for Numeric Planning","created":"2024-04-08","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":"2305.09840","title":"Scale-Adaptive Balancing of Exploration and Exploitation in Classical Planning","created":"2023-05-16","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":"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":"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":"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":"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":"2606.04597","title":"Learning Admissible Heuristics via Cost Partitioning","created":"2026-06-03","cited_by_count":0,"area":null}],"next_cursor":null}