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.ROShow all

5 papers · 1 filter

cs.RO2026

Search-Aided Joint Agent-Environment Reinforcement Learning for Robust Lifelong Multi-Agent Path Finding with Rotations

He Jiang, Jingtian Yan, Yulun Zhang +5

Lifelong Multi-Agent Path Finding (LMAPF) requires repeatedly planning collision-free paths for agents that continuously receive new goals upon reaching their current ones. While m…

cs.RO2026

Judgelight: Trajectory-Level Post-Optimization for Multi-Agent Path Finding via Closed-Subwalk Collapsing

Yimin Tang, Sven Koenig, Erdem Bıyık

Multi-Agent Path Finding (MAPF) is an NP-hard problem with applications in warehouse automation and multi-robot coordination. Learning-based MAPF solvers offer fast and scalable pl…

cs.RO2025

RAILGUN: A Unified Convolutional Policy for Multi-Agent Path Finding Across Different Environments and Tasks

Yimin Tang, Xiao Xiong, Jingyi Xi +3

Multi-Agent Path Finding (MAPF), which focuses on finding collision-free paths for multiple robots, is crucial for applications ranging from aerial swarms to warehouse automation.…

cs.RO2025

Enhancing Lifelong Multi-Agent Path Finding with Cache Mechanism

Yimin Tang, Zhenghong Yu, Yi Zheng +3

Multi-Agent Path Finding (MAPF), which focuses on finding collision-free paths for multiple robots, is crucial in autonomous warehouse operations. Lifelong MAPF (L-MAPF), where age…

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…