Jiaoyang-Li / EECBSLinks
A bounded-suboptimal solver for Multi-Agent Path Finding
☆126Updated 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☆126Updated last year
- An efficient solver for lifelong Multi-Agent Path Finding☆190Updated last year
- Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search☆75Updated 4 years ago
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)☆88Updated 8 months ago
- Iterative Refinement for Real-Time Multi-Robot Path Planning (IROS-21)☆139Updated 8 months ago
- ☆50Updated 8 months ago
- MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search☆100Updated last year
- Multi-agent pathfinding via Conflict Based Search☆110Updated last year
- A solution of Multi-Agent Path Finding problem☆68Updated last year
- Conflict-based search for multi-agent path finding (MAPF)☆88Updated 3 years ago
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (IJCAI-19)☆39Updated 4 years ago
- Continuous CBS - a modification of conflict based search algorithm, that allows to perform actions (move, wait) of arbitrary duration. Ti…☆256Updated 6 months ago
- LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)☆65Updated 4 months ago
- CBS, MA-CBS algorithms and evaluation of these algorithms.☆30Updated 3 years ago
- 3 algorithms for classical MAPF on 4 connected grid in one project