surynek / boOXLinks
Multi-agent path finding (MAPF), Token Swapping (TSWAP) and related solvers. Among others SMT-based solvers, variants of CBS, and SAT-based solvers are implemented. Recently also continuous variants of MAPF (MAPF^R) are supported.
☆18Updated 6 months ago
Alternatives and similar repositories for boOX
Users that are interested in boOX are comparing it to the libraries listed below
Sorting:
- A Comparion of Increasing Cost Tree Search (ICTS) and Enhanced Partial Expansion A*☆20Updated last year
- 3 algorithms for classical MAPF on 4 connected grid in one project☆34Updated 2 years ago
- ROS wrapper for CL-CBS☆21Updated 2 years ago
- Benchmark for Multi Robot Planning☆18Updated 2 years ago
- Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding (IJCAI-23)☆32Updated last week
- An optimal MAPF sovler: CBS+prioritizing conflicts+bypassing+high-level heuritstics+symmetry reasoning☆118Updated 11 months ago
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (IJCAI-19)☆38Updated 3 years ago
- Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)☆81Updated last week
- MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search☆84Updated last year
- ☆42Updated 2 months ago
- Conflict-based search for multi-agent path finding (MAPF)☆78Updated 2 years ago
- A bounded-suboptimal solver for Multi-Agent Path Finding☆112Updated 11 months ago
- A solution of Multi-Agent Path Finding problem☆59Updated last year
- Implementation of different versions of Safe Interval Path Planning algorithm that can find bounded-suboptimal solutions.☆31Updated 3 years ago
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)☆74Updated 2 months ago
- simple multi-agent pathfinding (MAPF) visualizer for research usage☆75Updated 7 months ago
- Safe Interval Path Planning with Intervals Projection (SIPP-IP) - a SIPP-based planner capable of handling non-instantaneous acceleration…☆16Updated 2 years ago
- CTRMs: Learning to Construct Cooperative Timed Roadmaps for Multi-agent Path Planning in Continuous Spaces (AAMAS-22)☆38Updated 2 years ago
- Time-Optimal Any-Angle Safe Interval Path Planning☆9Updated 4 years ago
- ☆29Updated 9 months ago
- LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)☆61Updated last week
- A MAPF Algorithm Visualizer☆11Updated 3 months ago
- C++ implementation of CBS with using SIPP as a low-level planner☆10Updated 6 years ago
- Iterative Refinement for Real-Time Multi-Robot Path Planning (IROS-21)☆131Updated 2 months ago
- A MAPF framework in C#, with implementations for MA-CBS, ICBS, CBSH, ID, A*, A*+OD, and EPEA*☆46Updated last month
- Disjoint CBSH and IDCBS integrated with LPA* and other incremental techniques☆11Updated 4 years ago
- Implementation of the SADG RHC feedback control scheme to reduce route completion times of delayed agents following MAPF plans.☆24Updated last year
- Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search☆70Updated 4 years ago
- 📍🗺️ A Python library for Multi-Agents Planning and Pathfinding (Centralized and Decentralized)☆72Updated this week
- Some Multi-Agent Path Planning algorithms☆13Updated 4 years ago