CBS with Continuous-Time Revisit

Andy Li, Zhe Chen, Danial Harabor +1

Multi-Agent Path Finding in Continuous Time (\mapfr) extends the classical MAPF problem by allowing agents to operate in continuous time. Conflict-Based Search with Continuous Time…