☆20May 9, 2025Updated last year
Alternatives and similar repositories for Code-Archive
Users that are interested in Code-Archive are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ☆18May 9, 2025Updated last year
- 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 Move…☆29Oct 17, 2024Updated last year
- ☆18May 29, 2025Updated last year
- Official implementation of LSMART, an open-source simulator to evaluate any lifelong Multi-Agent Path Finding algorithms with real-world …☆22Jun 29, 2026Updated 3 weeks ago
- The repository contains the implementation Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding. It plans and navigates more t…☆33Jul 21, 2025Updated last year
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Official implementation of the paper "Guidance Graph Optimization for Lifelong Multi-Agent Path Finding", published in IJCAI 2024.☆25Mar 10, 2026Updated 4 months ago
- ☆17May 20, 2026Updated 2 months ago
- Lightweight and Effective Preference Construction in PIBT for Large-Scale Multi-Agent Pathfinding (SoCS-25)☆24May 21, 2025Updated last year
- ☆18Nov 11, 2025Updated 8 months ago
- ☆57Apr 28, 2025Updated last year
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)☆111Apr 14, 2025Updated last year
- This is code repo for the paper, Depolying Ten Thousand Robots: Scalable Imitation Learninig for Lifelong Mulit-Agent Path Finding, which…☆72Mar 27, 2026Updated 3 months ago
- A bounded-suboptimal solver for Multi-Agent Path Finding☆135Jul 24, 2024Updated last year
- Pairwise is Not Enough: Hypergraph Neural Networks for Multi-Agent Pathfinding (ICLR-2026)☆16Mar 3, 2026Updated 4 months 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.
- ☆37Jul 15, 2026Updated last week
- SMART is an efficient soft-tool that bridge the gap between Multi-Agent Path Finding (MAPF) and real-world application. More details can …☆65Jul 14, 2026Updated last week
- Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)☆125Jun 21, 2025Updated last year
- db-LaCAM: Fast and Scalable Multi-Robot Kinodynamic Motion Planning with Discontinuity-Bounded Search and Lightweight MAPF (ICAPS-26)☆23Jul 4, 2026Updated 2 weeks ago
- Distilled version of LaGAT: a neuro-guided search for multi-agent pathfinding (MAPF)☆15Updated this week
- Solution of NeurIPS 2020 Flatland Challenge from the team An_old_driver.☆68Nov 16, 2021Updated 4 years ago
- LaCAM: a quick and scalable multi-agent pathfinding algorithm☆30Feb 26, 2026Updated 4 months 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
- This is an umbrella repository that contains links and information about all the tools and algorithms related to the POGEMA Benchmark.☆41Dec 10, 2025Updated 7 months ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Our implementation of Kinodynamic Conflict Based Search (K-CBS) inside the The Open Motion Planning Library (OMPL)☆18Feb 5, 2024Updated 2 years ago
- A Multi-Agent Path Finding visualization website.☆53Jan 7, 2024Updated 2 years ago
- ☆40Jul 10, 2022Updated 4 years ago
- Minimal Python implementation of PIBT for MAPF☆60Nov 4, 2025Updated 8 months ago
- An implementation of formulations described in Jabrayilov and Mutzel (2023)☆10Jun 7, 2023Updated 3 years ago
- ☆12May 8, 2024Updated 2 years ago
- ☆24Oct 28, 2025Updated 8 months ago
- An optimal MAPF sovler: CBS+prioritizing conflicts+bypassing+high-level heuritstics+symmetry reasoning☆136Jul 24, 2024Updated last year
- ☆17Jul 27, 2023Updated 2 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Anytime Multi-Agent Path Finding via Large-Neighborhood Search☆75May 9, 2024Updated 2 years ago
- CBS, MA-CBS algorithms and evaluation of these algorithms.☆31Mar 16, 2022Updated 4 years ago
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (IJCAI-19)☆42Nov 23, 2021Updated 4 years ago
- ☆15Mar 28, 2021Updated 5 years ago
- Time-Optimal Any-Angle Safe Interval Path Planning☆10Mar 13, 2021Updated 5 years ago
- Use LLM and arxiv reader to obtain arxiv paper every day; Please check Wiki page or the ReadingCollectionWebsite☆20May 30, 2026Updated last month
- 集成学习思维导图☆21Apr 6, 2023Updated 3 years ago