A Theoretical Bound Which Improves the Performance of Compilation-Based Multi-Agent Path Finding
Date Issued
2025
Author(s) USM
DOI
10.1109/ACCESS.2025.3569496
Abstract
A well-known approach to optimally solving Multi-Agent Path Finding (MAPF) is by compilation to Boolean Satisfiability or Answer Set Programming. Such compilation-based approaches to MAPF are superior to others on dense, relatively small instances. During
Política de Privacidad 
