The following publications are possibly variants of this publication:
- Anytime Multi-Agent Path Finding via Large Neighborhood SearchJiaoyang Li 0001, Zhe Chen, Daniel Harabor, Peter J. Stuckey, Sven Koenig. atal 2021: 1581-1583 [doi]
- Anytime Multi-Agent Path Finding via Machine Learning-Guided Large Neighborhood SearchTaoan Huang, Jiaoyang Li 0001, Sven Koenig, Bistra Dilkina. AAAI 2022: 9368-9376 [doi]
- Exact Anytime Multi-Agent Path Finding Using Branch-and-Cut-and-Price and Large Neighborhood SearchEdward Lam 0001, Daniel Damir Harabor, Peter J. Stuckey, Jiaoyang Li 0001. aips 2023: 254-258 [doi]
- Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood SearchThomy Phan, Taoan Huang, Bistra Dilkina, Sven Koenig. AAAI 2024: 17514-17522 [doi]
- Anytime Multi-Agent Path Finding using Operation Parallelism in Large Neighborhood SearchShao-Hung Chan, Zhe Chen 0016, Dian-Lun Lin, Yue Zhang, Daniel Harabor, Sven Koenig, Tsung-Wei Huang, Thomy Phan. atal 2024: 2183-2185 [doi]
- MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood SearchJiaoyang Li 0001, Zhe Chen, Daniel Harabor, Peter J. Stuckey, Sven Koenig. AAAI 2022: 10256-10265 [doi]