PPaperPicks

Jiaoyang Li

Carnegie Mellon University, PA, USA

18 papers at tracked venues · 10 at CORE A* · active 20242026

Venues

Frequent coauthors

Papers

  1. BTPG-max: Achieving Local Maximal Bidirectional Pairs for Bidirectional Temporal Plan Graphs
  2. Dynamic Agent Grouping ECBS: Scaling Windowed Multi-Agent Path Finding with Completeness Guarantees
  3. Accelerating Focal Search in Multi-Agent Path Finding with Tighter Lower Bounds
  4. Benchmarking Shortcutting Techniques for Multi-Robot-Arm Motion Planning
  5. Deploying Ten Thousand Robots: Scalable Imitation Learning for Lifelong Multi-Agent Path Finding
  6. LNS2+RL: Combining Multi-agent Reinforcement Learning with Large Neighborhood Search in Multi-agent Path Finding
  7. Multi-Agent Motion Planning for Differential Drive Robots Through Stationary State Search
  8. Multi-Robot Motion Planning with Diffusion Models
  9. Online Guidance Graph Optimization for Lifelong Multi-Agent Path Finding
  10. RAILGUN: A Unified Convolutional Policy for Multi-Agent Path Finding Across Different Environments and Tasks
  11. Speedup Techniques for Switchable Temporal Plan Graph Optimization
  12. Windowed MAPF with Completeness Guarantees
  13. Work Smarter Not Harder: Simple Imitation Learning with CS-PIBT Outperforms Large-Scale Imitation Learning for MAPF
  14. Bidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Execution
  15. Guidance Graph Optimization for Lifelong Multi-Agent Path Finding
  16. Optimal Task Assignment and Path Planning using Conflict-Based Search with Precedence and Temporal Constraints
  17. Scalable Mechanism Design for Multi-Agent Path Finding
  18. Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding