Sensitivity Analysis for Saturated Post-hoc Optimization in Classical Planning
Cost partitioning is the foundation of today's strongest heuristics for optimal classical
planning. However, computing a cost partitioning for each evaluated state is prohibitively …
planning. However, computing a cost partitioning for each evaluated state is prohibitively …
New Refinement Strategies for Cartesian Abstractions
Cartesian counterexample-guided abstraction refinement (CEGAR) yields strong heuristics
for optimal classical planning. CEGAR repeatedly finds counterexamples, ie, abstract plans …
for optimal classical planning. CEGAR repeatedly finds counterexamples, ie, abstract plans …
Efficiently Computing Transitions in Cartesian Abstractions
J Seipp - Proceedings of the International Conference on …, 2024 - ojs.aaai.org
Counterexample-guided Cartesian abstraction refinement yields strong heuristics for optimal
classical planning. The approach iteratively finds a new abstract solution, checks where it …
classical planning. The approach iteratively finds a new abstract solution, checks where it …
[PDF][PDF] Odin: A Planner Based on Saturated Transition Cost Partitioning
This planner abstract describes an optimal classical planner called Odin. Odin uses A⋆
search (Hart, Nilsson, and Raphael 1968) with an admissible heuristic (Pearl 1984) based …
search (Hart, Nilsson, and Raphael 1968) with an admissible heuristic (Pearl 1984) based …
Symbolic search for optimal planning with expressive extensions
D Speck - arxiv preprint arxiv:2204.00288, 2022 - arxiv.org
In classical planning, the goal is to derive a course of actions that allows an intelligent agent
to move from any situation it finds itself in to one that satisfies its goals. Classical planning is …
to move from any situation it finds itself in to one that satisfies its goals. Classical planning is …