@InProceedings{Tan2023AcyclicDiMAPF,
  author     = {Xing Tan and Pascal Bercher},
  title      = {Intractability of Optimal Multi-Agent Pathfinding on Directed Graphs},
  booktitle  = {Proceedings of the 26th European Conference on Artificial Intelligence (ECAI 2023)},
  year       = {2023},
  publisher  = {IOS Press},
  pages      = {2315--2321},
  abstract   = {In Multi-Agent Pathfinding (MAPF) problems, multiple agents move simultaneously to reach their individual destinations without colliding with each other. The computational complexity of the problem has been extensively studied for undirected graphs over the past decades. However, plan existence for Directed MAPF (diMAPF) was only recently studied and was shown to be in PSPACE as well as NP-hard. In this paper, we study the optimization versions (on makespan and on travel distance of agents) of diMAPF problems and show that they remain NP-hard even when various important non-trivial restrictions are imposed (e.g., when considering the problem on directed, acyclic, and planar graphs where the vertex-degrees are bounded). We have also provide membership results, thus presenting the first set of NP-completeness results for various optimal diMAPF variants.},
  doi        = {10.3233/FAIA230531},
  url_Paper  = {https://bercher.net/publications/2023/Tan2023optimalDiMAPFComplexity.pdf},
  url_Poster = {https://bercher.net/publications/2023/Tan2023optimalDiMAPFComplexityPoster.pdf},
  url_Slides = {https://bercher.net/publications/2023/Tan2023optimalDiMAPFComplexitySlides.pdf},
  keywords   = {conference}
}

{"_id":"33vv4Gq5T3KKtdYH4","bibbaseid":"tan-bercher-intractabilityofoptimalmultiagentpathfindingondirectedgraphs-2023","author_short":["Tan, X.","Bercher, P."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Xing"],"propositions":[],"lastnames":["Tan"],"suffixes":[]},{"firstnames":["Pascal"],"propositions":[],"lastnames":["Bercher"],"suffixes":[]}],"title":"Intractability of Optimal Multi-Agent Pathfinding on Directed Graphs","booktitle":"Proceedings of the 26th European Conference on Artificial Intelligence (ECAI 2023)","year":"2023","publisher":"IOS Press","pages":"2315–2321","abstract":"In Multi-Agent Pathfinding (MAPF) problems, multiple agents move simultaneously to reach their individual destinations without colliding with each other. The computational complexity of the problem has been extensively studied for undirected graphs over the past decades. However, plan existence for Directed MAPF (diMAPF) was only recently studied and was shown to be in PSPACE as well as NP-hard. In this paper, we study the optimization versions (on makespan and on travel distance of agents) of diMAPF problems and show that they remain NP-hard even when various important non-trivial restrictions are imposed (e.g., when considering the problem on directed, acyclic, and planar graphs where the vertex-degrees are bounded). We have also provide membership results, thus presenting the first set of NP-completeness results for various optimal diMAPF variants.","doi":"10.3233/FAIA230531","url_paper":"https://bercher.net/publications/2023/Tan2023optimalDiMAPFComplexity.pdf","url_poster":"https://bercher.net/publications/2023/Tan2023optimalDiMAPFComplexityPoster.pdf","url_slides":"https://bercher.net/publications/2023/Tan2023optimalDiMAPFComplexitySlides.pdf","keywords":"conference","bibtex":"@InProceedings{Tan2023AcyclicDiMAPF,\n author = {Xing Tan and Pascal Bercher},\n title = {Intractability of Optimal Multi-Agent Pathfinding on Directed Graphs},\n booktitle = {Proceedings of the 26th European Conference on Artificial Intelligence (ECAI 2023)},\n year = {2023},\n publisher = {IOS Press},\n pages = {2315--2321},\n abstract = {In Multi-Agent Pathfinding (MAPF) problems, multiple agents move simultaneously to reach their individual destinations without colliding with each other. The computational complexity of the problem has been extensively studied for undirected graphs over the past decades. However, plan existence for Directed MAPF (diMAPF) was only recently studied and was shown to be in PSPACE as well as NP-hard. In this paper, we study the optimization versions (on makespan and on travel distance of agents) of diMAPF problems and show that they remain NP-hard even when various important non-trivial restrictions are imposed (e.g., when considering the problem on directed, acyclic, and planar graphs where the vertex-degrees are bounded). We have also provide membership results, thus presenting the first set of NP-completeness results for various optimal diMAPF variants.},\n doi = {10.3233/FAIA230531},\n url_Paper = {https://bercher.net/publications/2023/Tan2023optimalDiMAPFComplexity.pdf},\n url_Poster = {https://bercher.net/publications/2023/Tan2023optimalDiMAPFComplexityPoster.pdf},\n url_Slides = {https://bercher.net/publications/2023/Tan2023optimalDiMAPFComplexitySlides.pdf},\n keywords = {conference}\n}\n\n","author_short":["Tan, X.","Bercher, P."],"key":"Tan2023AcyclicDiMAPF","id":"Tan2023AcyclicDiMAPF","bibbaseid":"tan-bercher-intractabilityofoptimalmultiagentpathfindingondirectedgraphs-2023","role":"author","urls":{" paper":"https://bercher.net/publications/2023/Tan2023optimalDiMAPFComplexity.pdf"," poster":"https://bercher.net/publications/2023/Tan2023optimalDiMAPFComplexityPoster.pdf"," slides":"https://bercher.net/publications/2023/Tan2023optimalDiMAPFComplexitySlides.pdf"},"keyword":["conference"],"metadata":{"authorlinks":{}},"downloads":11},"bibtype":"inproceedings","biburl":"https://bercher.net/bibtex/bibliography.bib","dataSources":["zKgS72cAu6Ez7npdh","bPpsmYWjffAy6QHP5","wYF8yPQT6a4TgShWe"],"keywords":["conference"],"search_terms":["intractability","optimal","multi","agent","pathfinding","directed","graphs","tan","bercher"],"title":"Intractability of Optimal Multi-Agent Pathfinding on Directed Graphs","year":2023,"downloads":11}