A Theoretical Bound Which Improves the Performance of Compilation-Based Multi-Agent Path Finding
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 solving, the underlying solver is invoked mu...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/11002511/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|