activity
20242026
most citedITA-ECBS: A Bounded-Suboptimal Algorithm for the Combined Target-Assignment and Path-Finding Problem

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

collaborators
Showing cs.MAShow all

1 paper · 1 filter

cs.MA2025

Accelerating Focal Search in Multi-Agent Path Finding with Tighter Lower Bounds

Yimin Tang, Zhenghong Yu, Jiaoyang Li +1

Multi-Agent Path Finding (MAPF) involves finding collision-free paths for multiple agents while minimizing a cost function--an NP-hard problem. Bounded suboptimal methods like Enha…