Skip to main content
Search

Dachuan Liu

1 related articles

Subscribe to updates
  1. arXiv

    LSRP* turns asynchronous multi-agent planning into anytime refinement: up to 25% more agents and 40% lower solution cost

    Multi-agent path finding has long assumed that all agents start together and every edge takes the same time, an assumption that fails under asynchronous actions. LSRP* adds an anytime search on top of LSRP's push-and-swap rule-based planning, producing a feasible solution quickly and then improving it within the runtime budget. On benchmark maps with up to 1000 agents, it handles up to 25% more agents than LSRP and reduces LSRP's solution cost by up to 40%.

You’re all caught up