Zhe Chen
陈喆 • Postdoctoral Scientist, Amazon Robotics. Previously Monash University.
Amazon Robotics
North Reading, MA
I am a Postdoctoral Scientist at Amazon Robotics working on efficient motion planning and coordination of mobile robots in warehouse environments. My research focuses on Multi-Agent Path Finding (MAPF), Heuristic Search, and Planning algorithms that enable large teams of robots to coordinate seamlessly.
I received my PhD in Computer Science from Monash University in 2024, advised by Prof Daniel Harabor and Prof Peter Stuckey.
Research Interests
- Multi-Agent Path Finding: Developing scalable algorithms for coordinating large teams of robots
- Heuristic Search: Creating efficient search algorithms for path planning problems
- Planning and Scheduling: Designing algorithms that handle dynamic environments and uncertainties
- Traffic Flow Optimization: Optimizing robot movement in dense environments
- Real-time Planning: Developing algorithms that can adapt to changing conditions
My research has practical applications in warehouse robotics, autonomous vehicle coordination, and any scenario requiring efficient coordination of multiple autonomous agents. I am passionate about bridging the gap between theoretical advances and real-world deployment.
I actively contribute to the research community through organizing workshops (AAAI Workshop on Multi-Agent Path Finding), competitions (Grid-Based Path Planning Competition, League of Robot Runners), and serving on program committees for top-tier venues including AAAI, ICAPS, and SoCS.
System Demonstrations
My research translates into practical systems and tools. Here are demonstrations of some key projects:
A competitive platform for multi-agent path finding algorithms with real-time constraints and dynamic environments.
Visualization system showing real-time progress tracking and performance metrics for MAPF algorithms.
Our winning solution for the 2020 Flatland Challenge, demonstrating scalable train coordination in complex rail networks.
News
| May 29, 2026 | “Flow-Based Task Assignment for Large-Scale Online Multi-Agent Pickup and Delivery” was named an AAMAS 2026 Best Student Paper nominee. |
|---|---|
| Apr 20, 2026 | Our paper “A Lightweight Traffic Map for Efficient Anytime LaCAM” has been accepted at IJCAI 2026. |
| Apr 08, 2026 | Invited by Prof. Jiaoyang Li, I gave a guest lecture at CMU for the Multi-Robot Planning and Coordination unit. |
| Jan 20, 2026 | Two papers accepted at AAMAS 2026: “Flow-Based Task Assignment for Large-Scale Online Multi-Agent Pickup and Delivery” and “Flexibility-Based Traffic Flow Optimisation in Lifelong Multi-Agent Path Finding”. |
| Aug 25, 2025 | Our paper “Symbolic Planning and Multi-Agent Path Finding in Extremely Dense Environments with Unassigned Agents” has been accepted at AAAI 2026. |
| Feb 01, 2025 | Two Papers Accepted at AAAI 2025 |
Selected publications
- Flow-Based Task Assignment for Large-Scale Online Multi-Agent Pickup and DeliveryIn Proceedings of the 25th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2026, 2026
- Traffic Flow Optimisation for Lifelong Multi-Agent Path FindingIn Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-27, 2024, Vancouver, Canada, 2024