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.
☆16Updated 5 months ago
Alternatives and similar repositories for MAPF-LRR2023:
Users that are interested in MAPF-LRR2023 are comparing it to the libraries listed below
- The repository contains the implementation Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding. It plans and navigates more t…☆15Updated 10 months ago
- Implementation of the SADG RHC feedback control scheme to reduce route completion times of delayed agents following MAPF plans.☆22Updated last year
- ☆13Updated 7 months ago
- ☆40Updated 2 years ago
- MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search☆74Updated 10 months ago
- 3 algorithms for classical MAPF on 4 connected grid in one project☆33Updated 2 years ago
- Codes for paper Integrated Task Assignment and Path Planning forCapacitated Multi-Agent Pickup and Delivery☆44Updated 2 years ago
- An offline visualization tool for analysing solutions to multi-robot coordination problems.☆33Updated last month
- Minimal Python implementation of PIBT for MAPF☆28Updated last year
- Anytime Multi-Agent Path Finding via Large-Neighborhood Search☆58Updated 10 months ago
- Our implementation of Kinodynamic Conflict Based Search (K-CBS) inside the The Open Motion Planning Library (OMPL)☆14Updated last year
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)☆68Updated 6 months ago
- A solution of Multi-Agent Path Finding problem☆51Updated 11 months ago
- simple multi-agent pathfinding (MAPF) visualizer for research usage☆65Updated 4 months ago
- Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)☆64Updated 2 weeks ago
- CBS, MA-CBS algorithms and evaluation of these algorithms.☆26Updated 3 years ago
- A bounded-suboptimal solver for Multi-Agent Path Finding☆103Updated 8 months ago
- ☆33Updated 2 years ago
- An optimal MAPF sovler: CBS+prioritizing conflicts+bypassing+high-level heuritstics+symmetry reasoning☆114Updated 8 months ago
- Safe Interval Path Planning with Intervals Projection (SIPP-IP) - a SIPP-based planner capable of handling non-instantaneous acceleration…☆15Updated 2 years ago
- Kinodynamic-CBS (K-CBS) is a decentralized motion planning algorithm capable of solving complex multi-agent motion planning queries for a…☆13Updated last year
- Iterative Refinement for Real-Time Multi-Robot Path Planning (IROS-21)☆128Updated 2 years ago
- Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding (IJCAI-23)☆27Updated 8 months ago
- Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search☆69Updated 4 years ago
- A MAPF framework in C#, with implementations for MA-CBS, ICBS, CBSH, ID, A*, A*+OD, and EPEA*☆44Updated last year
- A Multi-Agent Path Finding visualization website.☆55Updated last year
- Implementations of various algorithms used to solve the problem of Multi-Agent Pickup and Delivery (a generalization of Multi-Agent Path …☆57Updated 3 years ago
- LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)☆49Updated last year
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (IJCAI-19)☆34Updated 3 years ago