Push and rotate: a complete multi-agent pathfinding algorithm
DOI10.1613/JAIR.4447zbMATH Open1367.68319OpenAlexW2167979940MaRDI QIDQ2929587FDOQ2929587
Authors: Boris de Wilde, Adriaan W. ter Mors, Cees Witteveen 
Publication date: 13 November 2014
Published in: The Journal of Artificial Intelligence Research (JAIR) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.4447
Recommendations
- scientific article; zbMATH DE number 5959974
- Solving multi-agent path finding on strongly biconnected digraphs
- Conflict-based search for optimal multi-agent pathfinding
- Multi-agent pathfinding with \(n\) agents on graphs with \(n\) vertices: combinatorial classification and tight algorithmic bounds
- Branch-and-cut-and-price for multi-agent path finding
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40) Agent technology and artificial intelligence (68T42)
Cited In (9)
- Multi-agent pathfinding with \(n\) agents on graphs with \(n\) vertices: combinatorial classification and tight algorithmic bounds
- Constrained motion planning and multi-agent path finding on directed graphs
- Conflict-based search for optimal multi-agent pathfinding
- Shadoks Approach to Low-Makespan Coordinated Motion Planning
- Solving simultaneous target assignment and path planning efficiently with time-independent execution
- Solving multi-agent path finding on strongly biconnected digraphs
- The computational complexity of multi-agent pathfinding on directed graphs
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
- Robust multi-agent path finding and executing
Uses Software
This page was built for publication: Push and rotate: a complete multi-agent pathfinding algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2929587)
