Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios

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.

arXiv commentIn IJCAI-16 Workshop on Multi-Agent Path Finding

References in corpus (1)

• Exploiting Subgraph Structure in Multi-Robot Path Planning

Cited by in corpus (15)

• Graph-Based Multi-Robot Path Finding and Planning
• Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments
• Parallel Self-assembly for a Multi-USV System on Water Surface with Obstacles
• Multi-Agent Path Finding with Deadlines: Preliminary Results
• 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)
• Shadoks Approach to Low-Makespan Coordinated Motion Planning
• Searching with Consistent Prioritization for Multi-Agent Path Finding
• A Constraint Programming Approach to Simultaneous Task Allocation and Motion Scheduling for Industrial Dual-Arm Manipulation Tasks
• Multi-Agent Path Finding with Deadlines
• CAMETA: Conflict-Aware Multi-Agent Estimated Time of Arrival Prediction for Mobile Robots
• OF-VO: Efficient Navigation among Pedestrians Using Commodity Sensors
• On the Tour Towards DPLL(MAPF) and Beyond
• Pushing the Envelope: From Discrete to Continuous Movements in Multi-Agent Path Finding via Lazy Encodings
• A Job-Assignment Heuristic for Lifelong Multi-Agent Path Finding Problem with Multiple Delivery Locations