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.
☆29Oct 17, 2024Updated last year
Alternatives and similar repositories for MAPF-LRR2023
Users that are interested in MAPF-LRR2023 are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ☆17May 9, 2025Updated last year
- ☆22May 9, 2025Updated last year
- ☆18May 29, 2025Updated last year
- The repository contains the implementation Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding. It plans and navigates more t…☆34Jul 21, 2025Updated last year
- A bounded-suboptimal solver for Multi-Agent Path Finding☆137Jul 24, 2024Updated 2 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (IJCAI-19)☆43Nov 23, 2021Updated 4 years ago
- ☆25Oct 28, 2025Updated 10 months ago
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)☆116Apr 14, 2025Updated last year
- Official implementation of the paper "Guidance Graph Optimization for Lifelong Multi-Agent Path Finding", published in IJCAI 2024.☆26Mar 10, 2026Updated 6 months ago
- ☆58Apr 28, 2025Updated last year
- LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)☆82Aug 22, 2025Updated last year
- This is code repo for the paper, Depolying Ten Thousand Robots: Scalable Imitation Learninig for Lifelong Mulit-Agent Path Finding, which…☆74Mar 27, 2026Updated 5 months ago
- Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)☆132Sep 9, 2026Updated 2 weeks ago
- [AAAI-2024] Follower: This study addresses the challenging problem of decentralized lifelong multi-agent pathfinding. The proposed Follow…☆67Jul 28, 2025Updated last year
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- LaCAM: a quick and scalable multi-agent pathfinding algorithm☆30Feb 26, 2026Updated 6 months ago
- Lightweight and Effective Preference Construction in PIBT for Large-Scale Multi-Agent Pathfinding (SoCS-25)☆25May 21, 2025Updated last year
- Continuous CBS - a modification of conflict based search algorithm, that allows to perform actions (move, wait) of arbitrary duration. Ti…☆272May 30, 2025Updated last year
- An efficient solver for lifelong Multi-Agent Path Finding☆216Dec 17, 2024Updated last year
- ☆38Jul 15, 2026Updated 2 months ago
- ☆23Jun 8, 2026Updated 3 months ago
- Precedence constrained multi-agent task assignment and path finding☆17Dec 26, 2023Updated 2 years ago
- Safe Interval Path Planning with Intervals Projection (SIPP-IP) - a SIPP-based planner capable of handling non-instantaneous acceleration…☆20Dec 1, 2022Updated 3 years ago
- This is an umbrella repository that contains links and information about all the tools and algorithms related to the POGEMA Benchmark.☆41Dec 10, 2025Updated 9 months ago
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search☆118May 9, 2024Updated 2 years ago
- [AAAI-2025] This repository contains MAPF-GPT, a deep learning-based model for solving MAPF problems. Trained with imitation learning on …☆135Apr 23, 2026Updated 5 months ago
- Graph Attention-Guided Search for Dense Multi-Agent Pathfinding (AAAI-26)☆44Feb 13, 2026Updated 7 months ago
- Offline Time-Independent Multi-Agent Path Planning (IJCAI-22, T-RO-23)☆31Apr 14, 2025Updated last year
- Codes for paper Integrated Task Assignment and Path Planning forCapacitated Multi-Agent Pickup and Delivery☆52Jul 30, 2022Updated 4 years ago
- Kinodynamic-CBS (K-CBS) is a decentralized motion planning algorithm capable of solving complex multi-agent motion planning queries for a…☆18Dec 28, 2023Updated 2 years ago
- ☆55Dec 18, 2024Updated last year
- ☆13Apr 5, 2019Updated 7 years ago
- An optimal MAPF sovler: CBS+prioritizing conflicts+bypassing+high-level heuritstics+symmetry reasoning☆138Jul 24, 2024Updated 2 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- SMART is an efficient soft-tool that bridge the gap between Multi-Agent Path Finding (MAPF) and real-world application. More details can …☆72Jul 14, 2026Updated 2 months ago
- Minimal Python implementation of PIBT for MAPF☆63Nov 4, 2025Updated 10 months ago
- ☆19Nov 11, 2025Updated 10 months ago
- [AAAI-2024] MATS-LP addresses the challenging problem of decentralized lifelong multi-agent pathfinding. The proposed approach utilizes a…☆31Jul 28, 2025Updated last year
- ☆40Jul 10, 2022Updated 4 years ago
- Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding (IJCAI-23)☆41Aug 22, 2025Updated last year
- A Python library for multi-agent planning and pathfinding: CBS, PIBT, LaCAM, LNS, space-time A*, plus decentralized NMPC, velocity obstac…☆79Sep 7, 2026Updated 2 weeks ago