DiligentPanda / MAPF-LRR2023
This is the repo for the team Pikachu's solution in the League of Robot Competition 2023. Our solution won the Overall Best and Fast Mover tracks and ranked second in the Line Honours track.
☆18Updated 6 months ago
Alternatives and similar repositories for MAPF-LRR2023:
Users that are interested in MAPF-LRR2023 are comparing it to the libraries listed below
- Official implementation of the paper "Guidance Graph Optimization for Lifelong Multi-Agent Path Finding", published in IJCAI 2024.☆11Updated 11 months ago
- The repository contains the implementation Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding. It plans and navigates more t…☆16Updated 11 months ago
- Implementation of the SADG RHC feedback control scheme to reduce route completion times of delayed agents following MAPF plans.☆23Updated last year
- ☆42Updated 2 years ago
- ☆14Updated 8 months ago
- A solution of Multi-Agent Path Finding problem☆53Updated last year
- An optimal MAPF sovler: CBS+prioritizing conflicts+bypassing+high-level heuritstics+symmetry reasoning☆115Updated 9 months ago
- ☆33Updated 2 years ago
- 3 algorithms for classical MAPF on 4 connected grid in one project☆33Updated 2 years ago
- An offline visualization tool for analysing solutions to multi-robot coordination problems.☆34Updated 2 weeks ago
- MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search☆77Updated 11 months ago
- simple multi-agent pathfinding (MAPF) visualizer for research usage☆67Updated 5 months ago
- Minimal Python implementation of PIBT for MAPF☆30Updated last year
- Codes for paper Integrated Task Assignment and Path Planning forCapacitated Multi-Agent Pickup and Delivery☆44Updated 2 years ago
- Anytime Multi-Agent Path Finding via Large-Neighborhood Search☆60Updated 11 months ago
- CBS, MA-CBS algorithms and evaluation of these algorithms.☆26Updated 3 years ago
- Our implementation of Kinodynamic Conflict Based Search (K-CBS) inside the The Open Motion Planning Library (OMPL)☆15Updated last year
- LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)☆51Updated last year
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)☆70Updated last week
- [IROS 2024] EPH: Ensembling Prioritized Hybrid Policies for Multi-agent Pathfinding☆42Updated 6 months ago
- ☆27Updated 4 months ago
- Prioritized Multi-Agent Path Finding using Safe Interval Path Planning (SIPP) and modifications☆24Updated 3 years ago
- Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding (IJCAI-23)☆28Updated 9 months ago
- Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)☆66Updated last month
- Benchmarking Large Neighborhood Search for Multi-Agent Path Finding☆9Updated last month
- Implementations of various algorithms used to solve the problem of Multi-Agent Pickup and Delivery (a generalization of Multi-Agent Path …☆63Updated 3 years ago
- A bounded-suboptimal solver for Multi-Agent Path Finding☆107Updated 9 months ago
- Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search☆69Updated 4 years ago
- A Multi-Agent Path Finding visualization website.☆55Updated last year
- offical code of paper 'SCRIMP: Scalable Communication for Reinforcement- and Imitation-Learning-Based Multi-Agent Pathfinding'☆49Updated last year