{"total":79,"rows":[{"id":"2305.11014","title":"Generalized Planning in PDDL Domains with Pretrained Large Language Models","created":"2023-05-18","cited_by_count":139,"area":null},{"id":"2106.02757","title":"Heuristic-Guided Reinforcement Learning","created":"2021-06-05","cited_by_count":42,"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":"2103.11505","title":"Policy-Guided Heuristic Search with Guarantees","created":"2021-03-21","cited_by_count":20,"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":"2103.14434","title":"Generalized Planning as Heuristic Search","created":"2021-03-26","cited_by_count":18,"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":"2205.04850","title":"Scaling-up Generalized Planning as Heuristic Search with Landmarks","created":"2022-05-10","cited_by_count":14,"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":"2206.00702","title":"Fast and Precise: Adjusting Planning Horizon with Adaptive Subgoal Search","created":"2022-06-01","cited_by_count":12,"area":null},{"id":"2105.04250","title":"Expressing and Exploiting the Common Subgoal Structure of Classical Planning Domains Using Sketches: Extended Version","created":"2021-05-10","cited_by_count":9,"area":null},{"id":"2202.06356","title":"Goal Recognition as Reinforcement Learning","created":"2022-02-13","cited_by_count":9,"area":null},{"id":"2210.02377","title":"Goal Recognition as a Deep Learning Task: the GRNet Approach","created":"2022-10-05","cited_by_count":9,"area":null},{"id":"2511.09378","title":"Frontier Large Language Models Rival State-of-the-Art Planners","created":"2025-11-12","cited_by_count":7,"area":null},{"id":"2112.01918","title":"Heuristic Search Planning with Deep Neural Networks using Imitation, Attention and Curriculum Learning","created":"2021-12-03","cited_by_count":6,"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":"2301.11087","title":"Generalized Planning as Heuristic Search: A new planning search-space that leverages pointers over objects","created":"2023-01-26","cited_by_count":6,"area":null},{"id":"2311.05490","title":"General Policies, Subgoal Structure, and Planning Width","created":"2023-11-09","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":"2307.00735","title":"Novelty and Lifted Helpful Actions in Generalized Planning","created":"2023-07-03","cited_by_count":5,"area":null},{"id":"2508.07743","title":"Symmetry-Aware Transformer Training for Automated Planning","created":"2025-08-11","cited_by_count":5,"area":null},{"id":"2105.07691","title":"Approximate Novelty Search","created":"2021-05-17","cited_by_count":4,"area":null},{"id":"2402.11489","title":"What's the Plan? Evaluating and Developing Planning-Aware Techniques for Language Models","created":"2024-02-18","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":"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":"2301.10289","title":"PushWorld: A benchmark for manipulation planning with tools and movable obstacles","created":"2023-01-24","cited_by_count":3,"area":null},{"id":"2107.08739","title":"E-PDDL: A Standardized Way of Defining Epistemic Planning Problems","created":"2021-07-19","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":"2406.03091","title":"Improving Plan Execution Flexibility using Block-Substitution","created":"2024-06-05","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":"2504.19738","title":"Learning Efficiency Meets Symmetry Breaking","created":"2025-04-28","cited_by_count":2,"area":null},{"id":"2109.08301","title":"Comprehensive Multi-Agent Epistemic Planning","created":"2021-09-17","cited_by_count":1,"area":null},{"id":"2212.00506","title":"Fairness in Multi-Agent Planning","created":"2022-12-01","cited_by_count":1,"area":null},{"id":"2212.14462","title":"Planning with Complex Data Types in PDDL","created":"2022-12-29","cited_by_count":1,"area":null},{"id":"2303.13638","title":"Planning as Theorem Proving with Heuristics","created":"2023-03-23","cited_by_count":1,"area":null},{"id":"2305.06485","title":"Multimodal Contextualized Plan Prediction for Embodied Task Completion","created":"2023-05-10","cited_by_count":1,"area":null},{"id":"2403.07510","title":"Relevance Score: A Landmark-Like Heuristic for Planning","created":"2024-03-12","cited_by_count":1,"area":null},{"id":"2404.06325","title":"Automatically Learning HTN Methods from Landmarks","created":"2024-04-09","cited_by_count":1,"area":null},{"id":"2404.09631","title":"Action Model Learning with Guarantees","created":"2024-04-15","cited_by_count":1,"area":null},{"id":"2404.15184","title":"Reducing Human-Robot Goal State Divergence with Environment Design","created":"2024-04-10","cited_by_count":1,"area":null},{"id":"2406.18615","title":"Improving Execution Concurrency in Partial-Order Plans via Block-Substitution","created":"2024-06-25","cited_by_count":1,"area":null},{"id":"2408.13719","title":"Count-based Novelty Exploration in Classical Planning","created":"2024-08-25","cited_by_count":1,"area":null},{"id":"2409.20259","title":"Learning to Ground Existentially Quantified Goals","created":"2024-09-30","cited_by_count":1,"area":null},{"id":"2508.11493","title":"Landmark-Assisted Monte Carlo Planning","created":"2025-08-15","cited_by_count":1,"area":null},{"id":"2603.06813","title":"Reinforcing the World's Edge: A Continual Learning Problem in the Multi-Agent-World Boundary","created":"2026-03-06","cited_by_count":1,"area":null},{"id":"2604.02910","title":"Analysis of Optimality of Large Language Models on Planning Problems","created":"2026-04-03","cited_by_count":1,"area":null},{"id":"2605.03625","title":"Self-Improvement for Fast, High-Quality Plan Generation","created":"2026-05-05","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":"2607.11197","title":"What We Talk About When We Talk About LLM Planning: Evidence for Two Distinct Planning Abilities","created":"2026-07-13","cited_by_count":1,"area":null},{"id":"2109.00449","title":"Planning from video game descriptions","created":"2021-09-01","cited_by_count":0,"area":null},{"id":"2307.08242","title":"Lifted Sequential Planning with Lazy Constraint Generation Solvers","created":"2023-07-17","cited_by_count":0,"area":null},{"id":"2308.02666","title":"Solving Witness-type Triangle Puzzles Faster with an Automatically Learned Human-Explainable Predicate","created":"2023-08-04","cited_by_count":0,"area":null},{"id":"2308.06922","title":"Probabilistic contingent planning based on HTN for high-quality plans","created":"2023-08-14","cited_by_count":0,"area":null},{"id":"2310.01471","title":"A Good Snowman is Hard to Plan","created":"2023-10-02","cited_by_count":0,"area":null},{"id":"2312.06490","title":"Automated Planning Techniques for Elementary Proofs in Abstract Algebra","created":"2023-12-11","cited_by_count":0,"area":null},{"id":"2404.03587","title":"Anticipate & Collab: Data-driven Task Anticipation and Knowledge-driven Planning for Human-robot Collaboration","created":"2024-04-04","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":"2503.09545","title":"A Planning Compilation to Reason about Goal Achievement at Planning Time","created":"2025-03-12","cited_by_count":0,"area":null},{"id":"2504.21131","title":"A Formalism for Optimal Search with Dynamic Heuristics (Extended Version)","created":"2025-04-29","cited_by_count":0,"area":null},{"id":"2508.21564","title":"Revisiting Landmarks: Learning from Previous Plans to Generalize over Problem Instances","created":"2025-08-29","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":"2511.12677","title":"Dynamic Tree Databases in Automated Planning","created":"2025-11-16","cited_by_count":0,"area":null},{"id":"2512.06002","title":"POrTAL: Plan-Orchestrated Tree Assembly for Lookahead","created":"2025-12-02","cited_by_count":0,"area":null},{"id":"2601.20021","title":"Fuzzy Categorical Planning: Autonomous Goal Satisfaction with Graded Semantic Constraints","created":"2026-01-27","cited_by_count":0,"area":null},{"id":"2602.12096","title":"Multi Graph Search for High-Dimensional Robot Motion Planning","created":"2026-02-12","cited_by_count":0,"area":null},{"id":"2602.14691","title":"Removing Planner Bias in Goal Recognition Through Multi-Plan Dataset Generation","created":"2026-02-16","cited_by_count":0,"area":null},{"id":"2602.22067","title":"Semantic Partial Grounding via LLMs","created":"2026-02-25","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":"2603.14824","title":"Planning as Goal Recognition: Deriving Heuristics from Intention Models -- Extended Version","created":"2026-03-16","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":"2605.28454","title":"GONDOR to the Rescue: Satisficing Planning with Low Memory","created":"2026-05-27","cited_by_count":0,"area":null},{"id":"2606.00618","title":"Efficient Test-time Inference for Generative Planning Models with OCL Search","created":"2026-05-30","cited_by_count":0,"area":null},{"id":"2606.06877","title":"Neuro-Symbolic Learning for Long-Horizon Task Planning Under Complex Logical Constraints","created":"2026-06-05","cited_by_count":0,"area":null},{"id":"2608.11318","title":"Terminal Symmetry as a Carrier of Asymmetric Process Knowledge: Statewise Refinement for Anytime Verified Construction","created":"2026-08-11","cited_by_count":0,"area":null},{"id":"2608.28300","title":"MaCoPlanner: LLM-Assisted Manual-Compiled Task Planning with Proactive Safety Verification for Robotic Industrial Panel Operation","created":"2026-08-28","cited_by_count":0,"area":null},{"id":"2610.18523","title":"APTree: Extended Behavior Trees for Adaptive and Scalable Automated Robotic Task Planning in Construction","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}