I am a senior undergraduate student in Robotics and currently visiting CMU Robotics Institute.
Visiting Intern
Carnegie Mellon University
Exchange Student
University of California, Berkeley
Undergraduate Student
South China University of Technology
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！
