At Philadelphia!Attending AAAI and MAPF Workshop
Present my poster at AAAI conference!
I am a fianl-year undergraduate student in Robotics and currently visiting CMU Robotics Institute, where I will stay for another two years as MSR.
I pursue stillness within, and naturalness without.
Master Student
Carnegie Mellon University
Visiting Intern
Carnegie Mellon University
Exchange Student
University of California, Berkeley
Undergraduate Student
South China University of Technology
After wrapping up my ongoing projects at CMU around March 2nd, I am looking for internships focused on robot foundation models or any direction that may lead toward general-purpose robotics.
I was a robot planning guys and once drawn to combining neuro-symbolic planning with foundation models for long-horizon tasks, but ran into difficulties fitting classical TAMP structures into a framework that could hierarchically learn symbolic concepts while handling uncertainty and partial observability. If you know of work addressing this, or are interested in exploring it together, please reach out. More recently, I have been shifting my focus to purely learning-based approaches, such as VLAs or world models, to see how well they handle long-horizon reasoning and manipulation, and whether classical planning and control ideas at the high level can offer new perspectives.

Currently I am at CMU working on projects that with the two paradiam i mentioned ahead. One is pure learning-based manipulation for humanoid manipulation, or later cross-embodiment manipulation. And hierachical planning with learning policies, a multi-robot pushing manipulation with flow-matching sampler. Earlier, I developed algorithms for warehouse robot coordination.

I will be back at CMU Robotics Institute this Fall as an MSR, working on the direction that I mentioned above.
The Multi-Agent Path Finding (MAPF) problem aims to find collision-free paths for multiple agents while optimizing objectives such as the sum of costs or makespan. MAPF has wide …
Multi-Agent Path Finding (MAPF) seeks collision-free paths for multiple agents from their respective starting locations to their respective goal locations while minimizing path …
Multi-Agent Path Finding (MAPF) seeks collision-free paths for multiple agents from their respective starting locations to their respective goal locations while minimizing path …
A two-stage learning pipeline for humanoid robot locomotion: Teacher Policy (RL) trained with privileged information in simulation, and Student Policy (IL) distilled from teacher …
A Qt-based visualizer for Continuous Multi-Agent Path Finding (MAPF) algorithms. Renders agent movements with smooth trajectories in continuous 2D space.
Present my poster at AAAI conference!
See u in Pittsburgh!
My first, first-author paper is accepted by AAAI 2025!