|
|
- T. Phan, B. Zhang, S.-H. Chan and S. Koenig. Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic. In AAAI Conference on Artificial Intelligence (AAAI), (in print), 2025.
- S.-H. Chan, Z. Chen, D.-L. Lin, Y. Zhang, D. Harabor, S. Koenig, T.-W. Huang and T. Phan. Anytime Multi-Agent Path Finding Using Operation Parallelism in Large Neighborhood Search. In International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), (in print), 2024.
- S.-H. Chan, Z. Chen, T. Guo, H. Zhang, Y. Zhang, D. Harabor, S. Koenig, C. Wu and J. Yu. The League of Robot Runners: Competition Goals, Designs, and Implementation [System Demonstration]. In International Conference on Automated Planning and Scheduling (ICAPS), (in print), 2024.
- S.-H. Chan, R. Stern, A. Felner and S. Koenig. Greedy Priority-Based Search for Suboptimal Multi-Agent Path Finding. In Symposium on Combinatorial Search (SoCS), 2023.
- S.-H. Chan, J. Li, G. Gange, D. Harabor, P. Stuckey and S. Koenig. Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding. In AAAI Conference on Artificial Intelligence (AAAI), 2022.
- E. Boyarski, S.-H. Chan, D. Atzmon, A. Felner and S. Koenig. On Merging Agents in Multi-Agent Pathfinding Algorithms. In Symposium on Combinatorial Search (SoCS), 11-19, 2022.
- J. Li, Z. Chen, Y. Zheng, S.-H. Chan, D. Harabor, P. Stuckey, H. Ma and S. Koenig. Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge. In International Conference on Automated Planning and Scheduling (ICAPS), 477-485, 2021.
- H. Zhang, M. Yao, Z. Liu, J. Li, L. Terr, S.-H. Chan, S. Kumar and S. Koenig. A Hierarchical Approach to Multi-Agent Path Finding. In ICAPS-21 Workshop on Hierarchical Planning (HPLAN), 2021.
- S.-H. Chan, J. Li, D. Harabor, P. Stuckey, G. Gange, L. Cohen and S. Koenig. Nested ECBS for Bounded-Suboptimal Multi-Agent Path Finding. In IJCAI Workshop on Multi-Agent Path Finding, 2020.
|
