Shao-Hung Chan

I am a Ph.D. candidate at the University of Southern California, advised by Professor Sven Koenig. Before that, I received my M.Sci degree from National Taiwan University in 2019 and B.Sci degree from National Cheng Kung University in 2017.

My long-term research goal is to develop algorithmic approaches that enable multi-robot systems to efficiently and robustly achieve collaborative tasks in dynamic environments. In particular, I am interested in developing heuristic search algorithms that solve Multi-Agent Path Finding (MAPF) with thousands of agents moving in large-scale environments, such as automated warehouses.

Selected Publications

• Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding.
  Shao-Hung Chan, Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, and Sven Koenig.
  AAAI Conference on Artificial Intelligence (AAAI), pages 9313-9322, 2022.

• New Mechanisms in Flex Distribution for Bounded Suboptimal Multi-Agent Path Finding.
  Shao-Hung Chan, Thomy Phan, Jiaoyang Li, and Sven Koenig.
  International Symposium on Combinatorial Search (SoCS), pages 47–55, 2025.

• Greedy Priority-Based Search for Suboptimal Multi-Agent Path Finding.
  Shao-Hung Chan, Roni Stern, Ariel Felner, and Sven Koenig.
  International Symposium on Combinatorial Search (SoCS), pages 11–19, 2023.

Honors and Awards

• [2024] Best system demonstration award honorable mention in ICAPS System’s Demonstration Track.
• [2023] First place of the virtual competition in the IEEE RAS Summer School on Multi-Robot Systems.
• [2022] Best student paper award in the International Symposium on Combinatorial Search (SoCS).
• [2022] Fellowship for the Ph.D. Sandwich Program from Ben-Gurion University of the Negev.
• [2020] First place in Flatland Challenge in NeurIPS 2020 Competition.
• [2019] Ph.D. fellowship for the University of Southern California.
• [2019] Best master thesis award of the year in NTUEE.
• [2018] Best student paper award finalist in the IEEE SMC.
• [2016] Fellowship for the exchange program to the University of California, Berkeley.
• [2016] Outstanding student for the academic achievement in the school year 2015-2016.

News

• [2025.07] Our paper New Mechanisms in Flex Distribution for Bounded Suboptimal Multi-Agent Path Finding was accepted to SoCS 2025.
• [2025.01] Our two papers, Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic and Counterfactual Online Learning for Open-Loop Monte-Carlo Planning, were accepted to AAAI 2025.
• [2024.08] Our paper Theoretical Study on Multi-objective Heuristic Search was accepted to IJCAI 2024.
• [2024.07] I started an internship from July 15, 2024 to January 10, 2025, working for Robert Bosch GmbH in Renningen, Germany.
• [2024.06] Our The League of Robot Runners: Competition Goals, Designs, and Implementation received the best system demonstration award honorable mention in ICAPS 2024. Please also check out our video for more info.
• [CFP] We are excited and delighted to send out the call of submissions for the 2024 League of Robot Runners Virtual Expo. The submission deadline is April 14, 2024.
• [2024.01] Our paper Anytime Multi-Agent Path Finding using Operation Parallelism in Large Neighborhood Search was accepted as an extended abstract in AAMAS 2024.