Improved Complexity Results and an Efficient Solution for Connected Multi-Agent Path Finding

Isseïnie Calviac, Ocan Sankur, François Schwarzentruber. Improved Complexity Results and an Efficient Solution for Connected Multi-Agent Path Finding. In Noa Agmon, Bo An 0001, Alessandro Ricci, William Yeoh 0001, editors, Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2023, London, United Kingdom, 29 May 2023 - 2 June 2023. pages 896-904, ACM, 2023. [doi]

@inproceedings{CalviacSS23,
  title = {Improved Complexity Results and an Efficient Solution for Connected Multi-Agent Path Finding},
  author = {Isseïnie Calviac and Ocan Sankur and François Schwarzentruber},
  year = {2023},
  url = {https://dl.acm.org/doi/10.5555/3545946.3598727},
  researchr = {https://researchr.org/publication/CalviacSS23},
  cites = {0},
  citedby = {0},
  pages = {896-904},
  booktitle = {Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2023, London, United Kingdom, 29 May 2023 - 2 June 2023},
  editor = {Noa Agmon and Bo An 0001 and Alessandro Ricci and William Yeoh 0001},
  publisher = {ACM},
  isbn = {978-1-4503-9432-1},
}