most citedBidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Execution

4 citations · 4 across the 2 of their papers we have counts for

collaborators
Showing cs.MAShow all

1 paper · 1 filter

cs.MA2025

BTPG-max: Achieving Local Maximal Bidirectional Pairs for Bidirectional Temporal Plan Graphs

Yifan Su, Rishi Veerapaneni, Jiaoyang Li

Multi-Agent Path Finding (MAPF) requires computing collision-free paths for multiple agents in shared environment. Most MAPF planners assume that each agent reaches a specific loca…