AI Planning Comparison Hub
6 papers - avg viability 3.8
Recent research in AI planning is increasingly focused on enhancing the efficiency and adaptability of planning systems through innovative modeling techniques. A notable trend is the shift from traditional symbolic representations to learned transition models, which allow planners to better generalize across diverse problem instances while reducing the need for extensive training data. This approach not only improves performance in out-of-distribution scenarios but also addresses the limitations of existing action-sequence prediction methods. Additionally, the introduction of the Epistemic Planning Domain Definition Language aims to standardize the representation of knowledge and beliefs in multi-agent settings, facilitating interoperability and systematic benchmarking. Concurrently, advancements in goal recognition are addressing biases in existing datasets, enabling more robust evaluations of goal recognizers under varied conditions. These developments collectively suggest a maturation of the field, with a clear trajectory toward more versatile, efficient, and practical planning systems capable of addressing complex real-world challenges.
Top Papers
- On Sample-Efficient Generalized Planning via Learned Transition Models(6.0)
Develop a planning system leveraging learned transition models for efficient generalization across planning problems.
- The Epistemic Planning Domain Definition Language: Official Guideline(5.0)
EPDDL standardizes the representation of epistemic planning tasks to enhance interoperability and reproducibility in AI planning.
- Removing Planner Bias in Goal Recognition Through Multi-Plan Dataset Generation(5.0)
Develop a goal recogniser that leverages multi-plan datasets to improve resilience against planner biases in multi-agent systems.
- PathWise: Planning through World Model for Automated Heuristic Design via Self-Evolving LLMs(3.0)
PathWise optimizes heuristic design for combinatorial problems through a multi-agent reasoning and planning framework leveraging self-evolving LLMs.
- Intermediate Results on the Complexity of STRIPS$_{1}^{1}$(2.0)
Explores the computational complexity of propositional STRIPS planning with a focus on small solution hypotheses and literal graphs.
- Petri Net Relaxation for Infeasibility Explanation and Sequential Task Planning(2.0)
A system utilizing Petri net reachability relaxation for efficient detection of infeasibility and sequential task planning.