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 defree from National Cheng Kung University in 2017.

My research interests are based on multi-agent system. I am interested in developing heuristic search algorithms that solve Multi-Agent Path Finding (MAPF) in the large-scale environment such as automated warehouses.

News

• [2024/07] I will start an internship from July 15, 2024 to January 10, 2025, working for Robert Bosch GmbH in Renningen, Germany.
• [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.
• [2023/12] We finished running The League of Robot Runners. Thanks for all the participation!
• [2023/07] Our paper Greedy Priority-Based Search for Suboptimal Multi-Agent Path Finding was accepted to SoCS 2023.
• [2023/07] We won the first place of the virtual competition in The IEEE RAS Summer School on Multi-Robot Systems.
• [2022/07] Our paper On Merging Agents in Multi-Agent Pathfinding Algorithms received the Best Student Paper Award in SoCS 2022.
• [2022/03] I received a Ph.D. Sandwich research fellowship from Ben-Gurion University to visit the research group of Prof. Ariel Felner for six months. Thanks!
• [2022/01] Our paper Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding was accepted to AAAI 2022.