Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios
arXiv:1702.05515
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.
In IJCAI-16 Workshop on Multi-Agent Path Finding
Cited by in corpus (7)
- Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments
- Scalable and Safe Multi-Agent Motion Planning with Nonlinear Dynamics and Bounded Disturbances
- Multi-agent Path Finding with Continuous Time Viewed Through Satisfiability Modulo Theories (SMT)
- Searching with Consistent Prioritization for Multi-Agent Path Finding
- A Job-Assignment Heuristic for Lifelong Multi-Agent Path Finding Problem with Multiple Delivery Locations
- Pushing the Envelope: From Discrete to Continuous Movements in Multi-Agent Path Finding via Lazy Encodings
- On the Tour Towards DPLL(MAPF) and Beyond