1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.AI2024★ 1 cited
ITA-ECBS: A Bounded-Suboptimal Algorithm for the Combined Target-Assignment and Path-Finding Problem
Yimin Tang, Sven Koenig, Jiaoyang Li
Multi-Agent Path Finding (MAPF), i.e., finding collision-free paths for multiple robots, plays a critical role in many applications. Sometimes, assigning a target to each agent als…
cs.RO2024
Caching-Augmented Lifelong Multi-Agent Path Finding
Yimin Tang, Zhenghong Yu, Yi Zheng +3
Multi-Agent Path Finding (MAPF), which involves finding collision-free paths for multiple robots, is crucial in various applications. Lifelong MAPF, where targets are reassigned to…