surynek / boOX
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.
☆17Updated last year
Related projects ⓘ
Alternatives and complementary repositories for boOX
- A Comparion of Increasing Cost Tree Search (ICTS) and Enhanced Partial Expansion A*☆19Updated last year
- 📍🗺️ A Python library for Multi-Agents Planning and Pathfinding (Centralized and Decentralized)☆69Updated 3 weeks ago
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (IJCAI-19)☆32Updated 2 years ago
- 3 algorithms for classical MAPF on 4 connected grid in one project☆33Updated 2 years ago
- Conflict-based search for multi-agent path finding (MAPF)☆65Updated 2 years ago
- Iterative Refinement for Real-Time Multi-Robot Path Planning (IROS-21)☆118Updated last year
- Benchmark for Multi Robot Planning☆17Updated last year
- simple multi-agent pathfinding (MAPF) visualizer for research usage☆52Updated 4 months ago
- ☆36Updated last year
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)☆58Updated 2 months ago
- Anytime Multi-Agent Path Finding via Large-Neighborhood Search☆55Updated 6 months ago
- Kinodynamic-CBS (K-CBS) is a decentralized motion planning algorithm capable of solving complex multi-agent motion planning queries for a…☆13Updated 10 months ago
- An optimal MAPF sovler: CBS+prioritizing conflicts+bypassing+high-level heuritstics+symmetry reasoning☆101Updated 3 months ago
- Implementation of different versions of Safe Interval Path Planning algorithm that can find bounded-suboptimal solutions.☆28Updated 3 years ago
- Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding (IJCAI-23)☆24Updated 3 months ago
- A bounded-suboptimal solver for Multi-Agent Path Finding☆100Updated 3 months ago
- CTRMs: Learning to Construct Cooperative Timed Roadmaps for Multi-agent Path Planning in Continuous Spaces (AAMAS-22)☆32Updated last year
- Algorithm for prioritized multi-agent path finding (MAPF) in grid-worlds. Moves into arbitrary directions are allowed (each agent is allo…☆107Updated 2 years ago
- LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)☆40Updated 7 months ago
- ROS wrapper for CL-CBS☆19Updated last year
- Some Multi-Agent Path Planning algorithms☆12Updated 4 years ago
- An offline visualization tool for analysing solutions to multi-robot coordination problems.☆28Updated this week
- An efficient solver for lifelong Multi-Agent Path Finding☆145Updated last year
- Safe Interval Path Planning with Intervals Projection (SIPP-IP) - a SIPP-based planner capable of handling non-instantaneous acceleration…☆12Updated last year
- Codes for paper Integrated Task Assignment and Path Planning forCapacitated Multi-Agent Pickup and Delivery☆40Updated 2 years ago
- Continuous CBS - a modification of conflict based search algorithm, that allows to perform actions (move, wait) of arbitrary duration. Ti…☆218Updated 7 months ago
- A simulation system based on ROS and Gazebo which is specially built for multi-robot task allocation (exploration and destruction problem…☆120Updated 3 months ago
- Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search☆69Updated 3 years ago
- Minimal Python implementation of PIBT for MAPF☆18Updated 11 months ago
- MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search☆65Updated 6 months ago