Jiaoyang Li
Assistant Professor
Studies multi-agent path finding and planning for large teams of robots.
Jiaoyang Li's lab at CMU works on planning, control & multi-robot systems and reasoning & neuro-symbolic AI. 55 papers since 2023, 28 at top venues, mostly ICAPS and AAAI. 6 PhD students and 3 master's students. 3 alumni. Applications close .
At a glance
- papers, 2023–2026
- 14/ year
- at T1 venues
- 51%
- PhD students
- 6
- MS students
- 3
- alumni listed
- 3
Papers by yearfrom the lab homepage, 2023–2026
- 14 papers2026 · T1 8 · collecting
- 17 papers2025 · T1 12
- 13 papers2024 · T1 4
- 11 papers2023 · T1 4
T1 venuesOtherVenues: ICAPS, AAAI, IROS, ICRA, IJCAI
Research focuspaper titles that use each topic's words
- Planning, control & multi-robot systems41 papers
- Reasoning & neuro-symbolic AI2 papers
- studies multi-agent0 papers
- teams0 papers
- robotics institute0 papers
Paper list
From the lab homepage.
202614 papers
- RA-LAdvancing MAPF Toward the Real World: A Scalable Multi-Agent Realistic Testbed (SMART) (opens in a new tab)
- ICAPSAnalyzing Planner Design Trade-Offs for MAPF Under ADG-Based Realistic Execution (opens in a new tab)
- AAAI (T1)BTPG-max: Achieving Local Maximal Bidirectional Pairs for Bidirectional Temporal Plan Graphs (opens in a new tab)
- ICRA (T1)Conflict-Based Search as a Protocol: A Multi-Agent Motion Planning Protocol for Heterogeneous Agents, Solvers, and Independent Tasks (opens in a new tab)
- IROS (T1)Diffusion for Long-Horizon Multi-Robot Path Planning in Human-Shared Environments (opens in a new tab)
- AAAI (T1)Dynamic Agent Grouping ECBS: Scaling Windowed Multi-Agent Path Finding with Completeness Guarantees (opens in a new tab)
- SoCSEmbodying Multi-Hand Manipulation Policies by Searching the Assignment and Null Spaces (opens in a new tab)
- IROS (T1)LAMP: Long-Horizon Adaptive Manipulation Planning for Multi-Robot Collaboration in Cluttered Space (opens in a new tab)
- IROS (T1)Planning over MAPF Agent Dependencies via Multi-Dependency PIBT (opens in a new tab)
- IEEE Robotics & Automation MagazinePrompt-to-Product: Generative Assembly via Bimanual Manipulation (opens in a new tab)
- AAMAS (T1)QD-MAPPER: A Quality Diversity Framework to Automatically Evaluate Multi-Agent Path Finding Algorithms in Diverse Maps (opens in a new tab)
- ICAPSScalable Algorithms with Provable Optimality Bounds for the Multiple Watchman Route Problem (opens in a new tab)
202517 papers
- IROS (T1)Accelerating Focal Search in Multi-Agent Path Finding with Tighter Lower Bounds (opens in a new tab)
- RSS (T1)APEX-MR: Multi-Robot Asynchronous Planning and Execution for Cooperative Assembly (opens in a new tab)
- IROS (T1)Benchmarking Shortcutting Techniques for Multi-Robot-Arm Motion Planning (opens in a new tab)
- ICRA (T1)Deploying Ten Thousand Robots: Scalable Imitation Learning for Lifelong Multi-Agent Path Finding (opens in a new tab)
- MRSDestination-to-Chutes Task Mapping Optimization for Multi-Robot Coordination in Robotic Sorting Systems (opens in a new tab)
- AAAI (T1)LNS2+RL: Combining Multi-agent Reinforcement Learning with Large Neighborhood Search in Multi-agent Path Finding (opens in a new tab)
- AAAI (T1)Multi-agent Motion Planning for Differential Drive Robots Through Stationary State Search (opens in a new tab)
- ICLR (T1)Multi-Robot Motion Planning with Diffusion Models (opens in a new tab)
- SoCSNew Mechanisms in Flex Distribution for Bounded Suboptimal Multi-Agent Path Finding (opens in a new tab)
- AAAI (T1)Online Guidance Graph Optimization for Lifelong Multi-Agent Path Finding (opens in a new tab)
- IROS (T1)RAILGUN: A Unified Convolutional Policy for Multi-Agent Path Finding across Different Environments and Tasks (opens in a new tab)
- SoCSReal-Time LaCAM for Real-Time MAPF (opens in a new tab)
202413 papers
- ICAPSA Real-Time Rescheduling Algorithm for Multi-robot Plan Execution (opens in a new tab)
- ICAPSAccelerating Search-Based Planning for Multi-Robot Manipulation by Leveraging Online-Generated Experiences (opens in a new tab)
- AAAI (T1)Bidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Execution (opens in a new tab)
- ICAPSEfficient Approximate Search for Multi-Objective Multi-Agent Path Finding (opens in a new tab)
- IJCAI (T1)Guidance Graph Optimization for Lifelong Multi-Agent Path Finding (opens in a new tab)
- ICAPSImproving Learnt Local MAPF Policies with Heuristic Search (opens in a new tab)
- SoCSITA-ECBS: A Bounded-Suboptimal Algorithm for The Combined Target-Assignment and Path-Finding Problem (opens in a new tab)
- ICAPSMAPF in 3D Warehouses: Dataset and Analysis (opens in a new tab)
- RA-LMulti-Agent Motion Planning With Bézier Curve Optimization Under Kinodynamic Constraints (opens in a new tab)
- IJCAI (T1)Scalable Mechanism Design for Multi-Agent Path Finding (opens in a new tab)
- SoCSScaling Lifelong Multi-Agent Path Finding to More Realistic Settings: Research Challenges and Opportunities (opens in a new tab)
- AAAI (T1)Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding (opens in a new tab)
202311 papers
- NeurIPS (T1)Arbitrarily Scalable Environment Generators via Neural Cellular Automata (opens in a new tab)
- ICAPSBeyond Pairwise Reasoning in Multi-Agent Path Finding (opens in a new tab)
- ICAPSBinary Branching Multi-Objective Conflict-Based Search for Multi-Agent Path Finding (opens in a new tab)
- Artificial Intelligence (T1)Conflict-Tolerant and Conflict-Free Multi-Agent Meeting (opens in a new tab)
- ICAPSCost Splitting for Multi-Objective Conflict-Based Search (opens in a new tab)
- ICAPSDeadline-Aware Multi-Agent Tour Planning (opens in a new tab)
- ICAPSExact Anytime Multi-Agent Path Finding Using Branch-and-Cut-and-Price and Large Neighborhood Search (opens in a new tab)
- AAAI (T1)Intersection Coordination with Priority-Based Search for Autonomous Vehicles (opens in a new tab)
- IJCAI (T1)Multi-Robot Coordination and Layout Design for Automated Warehousing (opens in a new tab)
- Autonomous RobotsMulti-Robot Geometric Task-and-Motion Planning for Collaborative Manipulation Tasks (opens in a new tab)
- MRSSolving Multi-Agent Target Assignment and Path Finding with a Single Constraint Tree (opens in a new tab)
Where alumni went3 listed, 50% to industry
Industry 1Academia 1
Also to
- USC
Apply to CMUFall 2027
CMU SCS Computer Science PhD
- Round
- Single round
- Opens
- GRE
- See program page
- English
- TOEFL / IELTS / Duolingo (F-1/J-1 non-native speakers)
- Fee
- USD 100 (USD 80 by early deadline)
Confirmed on the program page.
Similar labsnearest by research summary
- SGNUS
Armin Lederer
- Planning, control & multi-robot systems
- CNTsinghua
Li Li
- Planning, control & multi-robot systems
- USMIT
John Leonard
- Robot perception & SLAM
- USUC Berkeley
Francesco Borrelli
- Planning, control & multi-robot systems
- USUMD
Michael Otte
- Planning, control & multi-robot systems
- CNTsinghua
Huaping Liu
- Manipulation & robot learning
Your notes
Save this lab to keep notes.
Data
Checked against the lab homepage.
- Collected
- Verified
- Papers
- The lab homepage
- Members
- Lab homepage
- Alumni
- Lab homepage
Tiers are venue classifications, not lab rankings.
CMUcloses