2000 character limit reached
Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios
Published 17 Feb 2017 in cs.AI, cs.MA, and cs.RO | (1702.05515v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.