Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios
Multi-agent path finding (MAPF) is well-studied in artificial intelligence, robotics, theoretical computer science and operations research. We discuss issues that arise when generalizing MAPF methods to real-world scenarios and four research directions that address them. We emphasize the importance...
Saved in:
Main Authors | , , , , , , , , , |
---|---|
Format | Journal Article |
Language | English |
Published |
17.02.2017
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Multi-agent path finding (MAPF) is well-studied in artificial intelligence,
robotics, theoretical computer science and operations research. We discuss
issues that arise when generalizing MAPF methods to real-world scenarios and
four research directions that address them. We emphasize the importance of
addressing these issues as opposed to developing faster methods for the
standard formulation of the MAPF problem. |
---|---|
DOI: | 10.48550/arxiv.1702.05515 |