3 papers
cs.AI2026
Conflict-Based Search for Multi Agent Path Finding with Asynchronous Actions
Xuemian Wu, Shizhe Zhao, Zhongqiang Ren
Multi-Agent Path Finding (MAPF) seeks collision-free paths for multiple agents from their respective start locations to their respective goal locations while minimizing path costs.…
cs.RO2026
Conflict-Based Search for Multi-Agent Path Finding with Elevators
Haitong He, Xuemian Wu, Shizhe Zhao +1
This paper investigates a problem called Multi-Agent Path Finding with Elevators (MAPF-E), which seeks conflict-free paths for multiple agents from their start to goal locations th…
cs.RO2023
Multi-Agent Combinatorial Path Finding with Heterogeneous Task Duration
Yuanhang Zhang, Xuemian Wu, Hesheng Wang +1
Multi-Agent Combinatorial Path Finding (MCPF) seeks collision-free paths for multiple agents from their initial locations to destinations, visiting a set of intermediate target loc…