Author

Carlos Linares López

h-index 0 View on Semantic Scholar

We have 2 of 5 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access Aug 2026

New Flaw Search Strategies in CEGAR for Cartesian Abstractions in Optimal Classical Planning

Background: 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 start from the trivial abstraction—an abstract state representing all concrete states—and iteratively refine it in a loop by split...

Martín Pozo, Á. Torralba, Carlos Linares López · Journal of Artificial Intell... · 0 citations

Conference Open access Sep 2026

Finding Simple Shortest-Paths via Centroids

Centroids are used to compute an arbitrary number of simple paths with some important benefits: the expansion of a single centroid delivers an arbitrary number of paths; only a single Dijk-stra search is required to complete the task; the same algorithm can be easily coupled with heuristics that improve search efficien...

Carlos Linares López, I. Herman · Proceedings of the Thirty-Fi... · 0 citations