4 papers · 1 filter
Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding
Jiarui Li, Federico Pecora, Runyu Zhang +1
Multi-Agent Path Finding (MAPF) is a core coordination problem for large robot fleets in automated warehouses and logistics. Existing approaches are typically either open-loop plan…
FICO: Finite-Horizon Closed-Loop Factorization for Unified Multi-Agent Path Finding
Jiarui Li, Alessandro Zanardi, Federico Pecora +2
Multi-Agent Path Finding is a fundamental problem in robotics and AI, yet most existing formulations treat planning and execution separately and address variants of the problem in…
Collaborative Multi-Robot Non-Prehensile Manipulation via Flow-Matching Co-Generation
Yorai Shaoul, Zhe Chen, Mohamed Naveed Gul Mohamed +3
Coordinating a team of robots to reposition multiple objects in cluttered environments requires reasoning jointly about where robots should establish contact, how to manipulate obj…
Destination-to-Chutes Task Mapping Optimization for Multi-Robot Coordination in Robotic Sorting Systems
Yulun Zhang, Alexandre O. G. Barbosa, Federico Pecora +1
We study optimizing a destination-to-chutes task mapping to improve throughput in Robotic Sorting Systems (RSS), where a team of robots sort packages on a sortation floor by transp…