Carlos Linares Lopez

2 accepted papers

2024

Rectangle Search: An Anytime Beam Search

Sofia Lemons, Wheeler Ruml, Rob Holte, Carlos Linares Lopez

AAAI 2024technical

Anytime heuristic search algorithms try to find a (potentially suboptimal) solution as quickly as possible and then work to find better and better solutions until an optimal solution is obtained or time is exhausted. The most widely-known anytime search algorithms are based on best-first search. In…

Cited by 2 Source ↗PDF ↗Scholar ↗

2024

When CEGAR Meets Regression: A Love Story in Optimal Classical Planning

Martín Pozo, Alvaro Torralba, Carlos Linares Lopez

AAAI 2024technical

Counterexample-Guided Abstraction Refinement (CEGAR) is a prominent technique to generate Cartesian abstractions for guiding search in cost- optimal planning. The core idea is to iteratively refine the abstraction, finding a flaw of the current optimal abstract plan. All existing approaches find the…

Cited by 2 Source ↗PDF ↗Scholar ↗