200 citations · 233 across the 14 of their papers we have counts for
4 papers · 1 filter
Flow-Based Task Assignment for Large-Scale Online Multi-Agent Pickup and Delivery
Yue Zhang, Zhe Chen, Daniel Harabor +2
We study the problem of online Multi-Agent Pickup and Delivery (MAPD), where a team of agents must repeatedly serve dynamically appearing tasks on a shared map. Existing online met…
Online Guidance Graph Optimization for Lifelong Multi-Agent Path Finding
Hongzhi Zang, Yulun Zhang, He Jiang +4
We study the problem of optimizing a guidance policy capable of dynamically guiding the agents for lifelong Multi-Agent Path Finding based on real-time traffic patterns. Multi-Agen…
Anytime Multi-Agent Path Finding using Operation Parallelism in Large Neighborhood Search
Shao-Hung Chan, Zhe Chen, Dian-Lun Lin +5
Multi-Agent Path Finding (MAPF) is the problem of finding a set of collision-free paths for multiple agents in a shared environment while minimizing the sum of travel time. Since s…
Integrated Task Assignment and Path Planning for Capacitated Multi-Agent Pickup and Delivery
Zhe Chen, Javier Alonso-Mora, Xiaoshan Bai +2
Multi-agent Pickup and Delivery (MAPD) is a challenging industrial problem where a team of robots is tasked with transporting a set of tasks, each from an initial location and each…