Jiaoyang-Li / EECBSLinks
A bounded-suboptimal solver for Multi-Agent Path Finding
☆120Updated last year
Alternatives and similar repositories for EECBS
Users that are interested in EECBS are comparing it to the libraries listed below
Sorting:
- An optimal MAPF sovler: CBS+prioritizing conflicts+bypassing+high-level heuritstics+symmetry reasoning☆121Updated last year
- An efficient solver for lifelong Multi-Agent Path Finding☆180Updated 8 months ago
- Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search☆73Updated 4 years ago
- MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search☆90Updated last year
- ☆46Updated 4 months ago
- Iterative Refinement for Real-Time Multi-Robot Path Planning (IROS-21)☆136Updated 5 months ago
- LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)☆62Updated 3 weeks ago
- 3 algorithms for classical MAPF on 4 connected grid in one project☆34Updated 3 years ago
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)☆80Updated 5 months ago
- Multi-agent pathfinding via Conflict Based Search