DiligentPanda / MAPF-LRR2023Links
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.
☆25Updated last year
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.☆17Updated last year
- The repository contains the implementation Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding. It plans and navigates more t…☆24Updated 3 months ago
- Implementation of the SADG RHC feedback control scheme to reduce route completion times of delayed agents following MAPF plans.☆26Updated last year
- ☆48Updated 6 months ago
- 3 algorithms for classical MAPF on 4 connected grid in one project☆35Updated 3 years ago
- Safe Interval Path Planning with Intervals Projection (SIPP-IP) - a SIPP-based planner capable of handling non-instantaneous acceleration…☆17Updated 2 years ago
- CTRMs: Learning to Construct Cooperative Timed Roadmaps for Multi-agent Path Planning in Continuous Spaces (AAMAS-22)☆38Updated 2 years ago
- A solution of Multi-Agent Path Finding problem☆64Updated last year
- Our implementation of Kinodynamic Conflict Based Search (K-CBS) inside the The Open Motion Planning Library (OMPL)☆16Updated last year
- simple multi-agent pathfinding (MAPF) visualizer for research usage☆86Updated 11 months ago
- Conflict-based search for multi-agent path finding (MAPF)☆83Updated 3 years ago
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)☆84Updated 6 months ago
- Codes for paper Integrated Task Assignment and Path Planning forCapacitated Multi-Agent Pickup and Delivery☆49Updated 3 years ago
- A Multi-Agent Path Finding visualization website.☆53Updated last year
- A bounded-suboptimal solver for Multi-Agent Path Finding☆123Updated last year
- An optimal MAPF sovler: CBS+prioritizing conflicts+bypassing+high-level heuritstics+symmetry reasoning☆123Updated last year
- MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search☆98Updated last year
- ☆37Updated 3 years ago
- ☆18Updated last year
- Kinodynamic-CBS (K-CBS) is a decentralized motion planning algorithm capable of solving complex multi-agent motion planning queries for a…☆17Updated last year
- Solve Multi-agent Path Finding problem for heterogeneous robots.☆28Updated 4 years ago
- Offline Time-Independent Multi-Agent Path Planning (IJCAI-22, T-RO-23)☆31Updated 6 months ago
- Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)☆94Updated 4 months ago
- An offline visualization tool for analysing solutions to multi-robot coordination problems.☆42Updated this week
- An efficient solver for lifelong Multi-Agent Path Finding☆186Updated 10 months ago
- Demonstrations of our Kinodynamic Conflict-Based Search algorithm that are too involved to be included in OMPL.☆10Updated last year
- 📍🗺️ A Python library for Multi-Agents Planning and Pathfinding (Centralized and Decentralized)☆74Updated last week
- Iterative Refinement for Real-Time Multi-Robot Path Planning (IROS-21)☆137Updated 6 months ago
- Official implementation of the paper "Multi-Robot Coordination and Layout Design for Automated Warehousing", published in IJCAI 2023.☆23Updated 2 years ago
- Some Multi-Agent Path Planning algorithms☆13Updated 5 years ago