144 citations · 199 across the 14 of their papers we have counts for
Showing cs.AIShow all
3 papers · 1 filter
cs.AI2023
Engineering LaCAM: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding
Keisuke Okumura
This paper addresses the challenges of real-time, large-scale, and near-optimal multi-agent pathfinding (MAPF) through enhancements to the recently proposed LaCAM* algorithm. LaCAM…
cs.AI2023★ 5 cited
Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding
Keisuke Okumura
This study extends the recently-developed LaCAM algorithm for multi-agent pathfinding (MAPF). LaCAM is a sub-optimal search-based algorithm that uses lazy successor generation to d…
cs.AI2022★ 4 cited
LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding
Keisuke Okumura
We propose a novel complete algorithm for multi-agent pathfinding (MAPF) called lazy constraints addition search for MAPF (LaCAM). MAPF is a problem of finding collision-free paths…