About

I have joined Shanghai Jiao Tong University (SJTU) starting from January 2024. This website is NOT maintained any more. Instead, please visit the RAP-Lab

I am a postdoc with Biorobotics Lab at Carnegie Mellon University (CMU, the U.S.). I received my Ph.D. degree from the same lab, advised by Professor Howie Choset and Professor Maxim Likhachev. I received my Master degree from Carnegie Mellon University and B.Eng. from both Tongji University (China) and FH Aachen (Germany). Prior to my Ph.D., I was a co-founder and the CTO of BITO Robotics.

I am broadly interested in Robotics and Artificial Intelligence. My research focuses on solving fundamental path and motion planning problems for single and multiple robots, by leveraging and advancing the frontier of multi-agent planning, combinatorial search and optimal control. These problems are often NP-hard, and my research exploits the underlying structure of these problems to develop algorithms that balance between runtime efficiency and solution quality guarantees, while being deployable to physical robots. These problems often arise in warehouse logistics, manufacturing and search-and-rescue. Find More.

News

• [2023.10] One paper on multi-agent task assignment and path finding is accepted to MRS-2023.
• [2023.09] One paper on ergodic trajectory planning is accepted to IROS-2023.
• [2023.07] One paper on multi-robot exploration is accepted to Science Robotics.
• [2023.07] One paper on resource constrained path planning is accepted to IEEE Transactions on Intelligent Transportation System (T-ITS).
• [2023.06] One paper on ergodic trajectory planning is accepted to IEEE Transaction on Robotics (T-RO).
• [2023.05] One paper on multi-agent exploration planning is accepted to IEEE Robotics and Automation Letters (RA-L).
• [2023.04] One paper on multi-agent path planning is accepted to IEEE Transaction on Robotics (T-RO).
• [2023.03] One paper is accepted to CVPR-2023.
• [2023.02] One paper is accepted to ICAPS-2023.
• [2023.02] One paper is accepted to ICRA-2023.