Popular repositories Loading

1. RHCR RHCR Public

   An efficient solver for lifelong Multi-Agent Path Finding

   C++ 146 41

2. EECBS EECBS Public

   A bounded-suboptimal solver for Multi-Agent Path Finding

   C++ 102 35

3. CBSH2-RTC CBSH2-RTC Public

   An optimal MAPF sovler: CBS+prioritizing conflicts+bypassing+high-level heuritstics+symmetry reasoning

   C++ 101 46

4. CBSH2 CBSH2 Public

   Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search

   C++ 69 31

5. MAPF-LNS2 MAPF-LNS2 Public

   MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search

   C++ 65 33

6. Flatland Flatland Public

   Solution of NeurIPS 2020 Flatland Challenge from the team An_old_driver.

   C++ 57 16