Colored Multi-Agent Path Finding: Solving Approaches
Multi-Agent Path Finding (MAPF) deals with the problem of finding collision-free paths for a set of agents moving in a shared environment while each agent has specified its destination. Colored MAPF generalizes MAPF by defining groups of agents that share a set of destination locations. In the paper...
| Published in: | Proceedings of the International Florida Artificial Intelligence Research Society Conference |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Published: |
LibraryPress@UF
2021-04-01
|
| Subjects: | |
| Online Access: | https://journals.flvc.org/FLAIRS/article/view/128535 |