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
Sorting:
- Official implementation of the paper "Guidance Graph Optimization for Lifelong Multi-Agent Path Finding", published in IJCAI 2024.☆13Updated last year
- The repository contains the implementation Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding. It plans and navigates more t…☆16Updated last year
- Implementation of the SADG RHC feedback control scheme to reduce route completion times of delayed agents following MAPF plans.☆23Updated last year
- ☆14Updated 9 months ago
- ☆40Updated 2 weeks ago
- MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search☆80Updated last year
- Codes for paper Integrated Task Assignment and Path Planning forCapacitated Multi-Agent Pickup and Delivery☆44Updated 2 years ago
- 3 algorithms for classical MAPF on 4 connected grid in one project☆33Updated 2 years ago
- simple multi-agent pathfinding (MAPF) visualizer for research usage☆71Updated 5 months ago
- ☆33Updated 2 years ago
- An offline visualization tool for analysing solutions to multi-robot coordination problems.☆35Updated last month
- Prioritized Multi-Agent Path Finding using Safe Interval Path Planning (SIPP) and modifications☆23Updated 3 years ago
- Anytime Multi-Agent Path Finding via Large-Neighborhood Search☆62Updated last year
- Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding (IJCAI-23)☆29Updated 9 months ago
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)☆70Updated last month
- Our implementation of Kinodynamic Conflict Based Search (K-CBS) inside the The Open Motion Planning Library (OMPL)☆15Updated last year
- A solution of Multi-Agent Path Finding problem☆55Updated last year
- Minimal Python implementation of PIBT for MAPF☆31Updated last year
- A bounded-suboptimal solver for Multi-Agent Path Finding☆107Updated 9 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
- [IROS 2024] EPH: Ensembling Prioritized Hybrid Policies for Multi-agent Pathfinding☆42Updated 7 months ago
- An optimal MAPF sovler: CBS+prioritizing conflicts+bypassing+high-level heuritstics+symmetry reasoning☆115Updated 9 months ago
- LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)☆52Updated last year
- Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)☆68Updated 2 months ago
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (IJCAI-19)☆36Updated 3 years ago
- Conflict-based search for optimal multi-agent pathfinding☆23Updated last year
- Benchmarking Large Neighborhood Search for Multi-Agent Path Finding☆10Updated 2 months ago
- Just about my master works, Including global planner, trajectory planner, decision algorithm and so on.☆2Updated 4 months 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
- Implementations of various algorithms used to solve the problem of Multi-Agent Pickup and Delivery (a generalization of Multi-Agent Path …☆64Updated 3 years ago