Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds

DOI10.1007/978-3-319-57586-5_21zbMATH Open1486.68129OpenAlexW2606892031MaRDI QIDQ5283371FDOQ5283371

Author name not available (Why is that?)

Publication date: 21 July 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-57586-5_21

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)

Cites Work

• A note on two problems in connexion with graphs
• Title not available (Why is that?)
• Graph puzzles, homotopy, and the alternating group
• The \((n^ 2-1)\)-puzzle and related relocation problems
• Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard

Cited In (6)

• k-Agent Sufficiency for Multiagent Stochastic Physical Search Problems
• Title not available (Why is that?)
• Reconfiguration of connected graph partitions
• The increasing cost tree search for optimal multi-agent pathfinding
• Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity
• Token Swapping on Trees

This page was built for publication: Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283371)