most citedMulti-Agent Combinatorial Path Finding with Heterogeneous Task Duration

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing cs.ROShow all

2 papers · 1 filter

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★ 1 cited

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…