Carlos Linares López — accepted AI-conference papers

2026

Finding Simple Shortest-Paths via Centroids

IJCAI 2026

Finding an arbitrary number of shortest paths in a graph is a fundamental problem in Graph Theory and Artificial Intelligence with numerous applications to real-world problems. While some algorithms produce paths which might contain loops, the most interesting and challenging problem variant consist

Cited by 0 Scholar ↗

2026

Not Everything Is Permitted: Constrained Cartesian Abstractions for Optimal Classical Planning

Martín Pozo, Álvaro Torralba, Carlos Linares López

AAAI 2026technical

Cartesian abstractions can flexibly approximate planning tasks to generate admissible heuristic functions. Constrained abstractions use state constraints, such as mutexes, to eliminate parts of the abstraction that cannot belong to solutions for the original problem. While this has been successfully

Cited by 0 Source ↗PDF ↗Scholar ↗