2 papers
cs.AI2024
The Universal PDDL Domain
Patrik Haslum, Augusto B. Corrêa
In AI planning, it is common to distinguish between planning domains and problem instances, where a "domain" is generally understood as a set of related problem instances. This dis…
cs.AI2024
Consolidating LAMA with Best-First Width Search
Augusto B. Corrêa, Jendrik Seipp
One key decision for heuristic search algorithms is how to balance exploration and exploitation. In classical planning, novelty search has come out as the most successful approach…