Recent Changes - Search:


Home Page
MAPF Info
MAPF News
Mailing List
Meetings
Publications
Researchers
Benchmarks
Competitions
Software
Apps
Tutorials
Class Projects

[Internal]

Publication

S. Zhou, S. Zhao and Z. Ren. LSRP*: Scalable and Anytime Planning for Multi-Agent Path Finding with Asynchronous Actions [Extended Abstract]. In International Symposium on Combinatorial Search (SoCS), pages 275-276, 2025.


Abstract: This extended abstract introduces LSRP*, an anytime variant of Loosely Synchronized Rule-Based Planning for Multi-Agent Path Finding with asynchronous actions. The method keeps improving solution quality within a runtime budget by combining rule-based scalability with search and pruning ideas from Loosely Synchronized Search. The paper targets settings with heterogeneous action durations and reports improved scalability and solution quality compared with existing baselines for MAPF with asynchronous actions.


Download the paper in pdf.

Edit - History - Print - Recent Changes - Search
Page last modified on September 02, 2026, at 12:34 AM