1 citations · 1 across the 1 of their papers we have counts for
Showing cs.AIShow all
3 papers · 1 filter
cs.AI2026
Pivot-and-Station Multi-Agent Path Finding: Solvability, Complexity, and Algorithms
Andrea Di Nezza, Mihir Patel, Fabio Fagnani +1
Automated high-density storage systems (warehouses, robotic parking, plant logistics, etc.) require fleets of agents to move through scarce task-critical resources and then park wi…
cs.AI2023
Learning Interpretable Heuristics for WalkSAT
Yannet Interian, Sara Bernardini
Local search algorithms are well-known methods for solving large, hard instances of the satisfiability problem (SAT). The performance of these algorithms crucially depends on heuri…
cs.AI2017★ 1 cited
Extracting Lifted Mutual Exclusion Invariants from Temporal Planning Domains
Sara Bernardini, Fabio Fagnani, David E. Smith
We present a technique for automatically extracting mutual exclusion invariants from temporal planning instances. It first identifies a set of invariant templates by inspecting the…