200 citations · 233 across the 14 of their papers we have counts for
7 papers · 1 filter
Online Submission and Evaluation System Design for Competition Operations
Zhe Chen, Daniel Harabor, Ryan Hechnenberger +1
Research communities have developed benchmark datasets across domains to compare the performance of algorithms and techniques However, tracking the progress in these research areas…
A Real-Time Rescheduling Algorithm for Multi-robot Plan Execution
Ying Feng, Adittyo Paul, Zhe Chen +1
One area of research in multi-agent path finding is to determine how replanning can be efficiently achieved in the case of agents being delayed during execution. One option is to r…
Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding
Zhe Chen, Daniel Harabor, Jiaoyang Li +1
Multi-Agent Path Finding (MAPF) is a fundamental problem in robotics that asks us to compute collision-free paths for a team of agents, all moving across a shared map. Although man…
Tracking Progress in Multi-Agent Path Finding
Bojie Shen, Zhe Chen, Muhammad Aamir Cheema +2
Multi-Agent Path Finding (MAPF) is an important core problem for many new and emerging industrial applications. Many works appear on this topic each year, and a large number of sub…
Flatland Competition 2020: MAPF and MARL for Efficient Train Coordination on a Grid World
Florian Laurent, Manuel Schneider, Christian Scheller +24
The Flatland competition aimed at finding novel approaches to solve the vehicle re-scheduling problem (VRSP). The VRSP is concerned with scheduling trips in traffic networks and th…
Symmetry Breaking for k-Robust Multi-Agent Path Finding
Zhe Chen, Daniel Harabor, Jiaoyang Li +1
During Multi-Agent Path Finding (MAPF) problems, agents can be delayed by unexpected events. To address such situations recent work describes k-Robust Conflict-BasedSearch (k-CBS):…