A Compact Answer Set Programming Encoding of Multi-Agent Pathfinding
Multi-agent pathfinding (MAPF) is the problem of finding <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> non-colliding paths connecting <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-fo...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2021-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9333548/ |