2 papers
cs.MA2026
From Gridworlds to Warehouses: Adapting Lightweight One-shot Multi-Agent Pathfinding for AGVs
Hiroki Nagai, Keisuke Okumura
Multi-agent pathfinding (MAPF) under one-shot planning is a core component of warehouse automation, yet classical formulations typically assume four-connected 2D grids with unit-ti…
cs.MA2025
Lightweight and Effective Preference Construction in PIBT for Large-Scale Multi-Agent Pathfinding
Keisuke Okumura, Hiroki Nagai
PIBT is a computationally lightweight algorithm that can be applied to a variety of multi-agent pathfinding (MAPF) problems, generating the next collision-free locations of agents…