This website is hosted on GitHub Pages (Jekyll Minimal theme by orderedlist)
I am a Ph.D. candidate in the AIRob Lab at Simon Fraser University, advised by Professor Hang Ma. Previously, I worked at the Shenzhen Institute of Artificial Intelligence and Robotics for Society, advised by Professor Tin Lun Lam, and studied in the Intelligent Motion Planning and Vision Lab at East China Normal University (ECNU), advised by Professor Xinyu Zhang. My research centers on multi-robot motion and coverage planning, with a focus on mixed discrete/continuous optimization on Graphs of Convex Sets (GCS) and scalable Multi-Robot Coverage Path Planning (MCPP). I am also interested in deployment-oriented planning for real-world robotic and autonomous building-design systems.
|
📌 Search-Based Spatiotemporal and Multi-Robot Motion Planning on Graphs of Space-Time Convex Sets | 🌐 Homepage |
ArXiv | Code
💡 TL;DR: Fast continuous-space planning for robots moving through dynamic, crowded environments using search on space-time convex regions. |
|
📌 GHOST: Solving the Traveling Salesman Problem on Graphs of Convex Sets | 🌐 Homepage |
ArXiv | Code
📢 AAAI-26
💡 TL;DR: An optimal hierarchical framework for the Traveling Salesman Problem on Graphs of Convex Sets. |
|
📢 IROS-25 | RSS-25 Workshop on MRS (Best Paper Award)
💡 TL;DR: A time-optimal deterministic spatiotemporal planner for multi-robot motion planning. |
|
📌 Large-Scale Multirobot Coverage Path Planning on Grids with Path Deconfliction | 🌐 Homepage |
ArXiv | Code
📢 AAAI-24 | IEEE Transactions on Robotics (T-RO), vol. 41, pp. 3348-3367, 2025
💡 TL;DR: An algorithmic pipeline to plan conflict-free coverage paths for multiple robots on grids. |
|
📢 ICAPS-24
💡 TL;DR: A decomposition-free multi-robot coverage path planning algorithm that generates smooth and continuous trajecories for arbitrarily-shaped workspaces. |
|
📌 Mixed Integer Programming for Time-Optimal Multi-Robot Coverage Path Planning With Efficient Heuristics | 🌐 Homepage |
ArXiv | Code
📢 IEEE Robotics and Automation Letters (RA-L) 8.10 (2023): 6491-6498.
💡 TL;DR: A mixed-integer program for min-max tree cover problem and grid-based multi-robot coverage path planning. |
|
📌 Learning to Coordinate for a Worker-Station Multi-robot System in Planar Coverage Tasks | 🌐 Homepage |
ArXiv
📢 IEEE Robotics and Automation Letters (RA-L) 7.4 (2022): 12315-12322.
💡 TL;DR: A DRL-based decentralized planning for collaborative coverage task of a heteogeneous multi-robot system. |
|
📢 ICRA-21
💡 TL;DR: planning problems from an ambitious project: robot swarms for large-scale ecological restoration task. |
|
💡 TL;DR: A hybrid projection format for efficient encoding/decoding panarama VR videos. |