LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)
☆84Aug 22, 2025Updated last year
Alternatives and similar repositories for lacam
Users that are interested in lacam are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding (IJCAI-23)☆42Aug 22, 2025Updated last year
- Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)☆138Oct 11, 2026Updated 3 weeks ago
- A bounded-suboptimal solver for Multi-Agent Path Finding☆140Jul 24, 2024Updated 2 years ago
- simple multi-agent pathfinding (MAPF) visualizer for research usage☆99Nov 16, 2024Updated last year
- Offline Time-Independent Multi-Agent Path Planning (IJCAI-22, T-RO-23)☆31Apr 14, 2025Updated last year
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search☆122May 9, 2024Updated 2 years ago
- Official implementation of the paper "Guidance Graph Optimization for Lifelong Multi-Agent Path Finding", published in IJCAI 2024.☆26Mar 10, 2026Updated 7 months ago
- An efficient solver for lifelong Multi-Agent Path Finding☆222Dec 17, 2024Updated last year
- Anytime Multi-Agent Path Finding via Large-Neighborhood Search☆75May 9, 2024Updated 2 years ago
- An optimal MAPF sovler: CBS+prioritizing conflicts+bypassing+high-level heuritstics+symmetry reasoning☆139Jul 24, 2024Updated 2 years ago
- Minimal Python implementation of LaCAM* for MAPF☆49Feb 17, 2026Updated 8 months ago
- ☆25Oct 28, 2025Updated last year
- ☆19May 20, 2026Updated 5 months ago
- Distilled version of LaGAT: a neuro-guided search for multi-agent pathfinding (MAPF)☆17Jul 18, 2026Updated 3 months ago
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- 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 2 years ago
- ☆11Mar 22, 2022Updated 4 years ago
- 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
- ☆17May 9, 2025Updated last year
- Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search☆80Mar 15, 2021Updated 5 years ago
- Decomposing instance into subproblem with priority☆13Jul 18, 2026Updated 3 months ago
- ☆20Nov 11, 2025Updated 11 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
- ☆58Apr 28, 2025Updated last year
- 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.
- BCP-MAPF – branch-and-cut-and-price for multi-agent path finding☆99Jul 28, 2025Updated last year
- Continuous CBS - a modification of conflict based search algorithm, that allows to perform actions (move, wait) of arbitrary duration. Ti…☆273May 30, 2025Updated last year
- Lightweight and Effective Preference Construction in PIBT for Large-Scale Multi-Agent Pathfinding (SoCS-25)☆25May 21, 2025Updated last year
- Minimal Python implementation of PIBT for MAPF☆65Nov 4, 2025Updated 11 months ago
- Multi-agent pathfinding via Conflict Based Search☆121Apr 22, 2024Updated 2 years ago
- Our implementation of Kinodynamic Conflict Based Search (K-CBS) inside the The Open Motion Planning Library (OMPL)☆18Feb 5, 2024Updated 2 years ago
- This is code repo for the paper, Depolying Ten Thousand Robots: Scalable Imitation Learninig for Lifelong Mulit-Agent Path Finding, which…☆74Mar 27, 2026Updated 7 months ago
- SMART is an efficient soft-tool that bridge the gap between Multi-Agent Path Finding (MAPF) and real-world application. More details can …☆73Jul 14, 2026Updated 3 months ago
- Conflict-based search for optimal multi-agent pathfinding☆29Nov 8, 2025Updated 11 months ago
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- Learning Selective Communication for Multi-Agent Path Finding☆33Dec 27, 2021Updated 4 years ago
- naive implementations of Multi-Agent Path Finding algorithms☆15Sep 4, 2025Updated last year
- Algorithm for prioritized multi-agent path finding (MAPF) in grid-worlds. Moves into arbitrary directions are allowed (each agent is allo…☆128Dec 5, 2021Updated 4 years ago
- The official repo of "PRIMAL3: Pathfinding via Reinforcement and Imitation Multi-Agent Learning - Leveraging LaCAM3". Visit our project p…☆17Sep 4, 2026Updated last month
- [AAAI-2025] This repository contains MAPF-GPT, a deep learning-based model for solving MAPF problems. Trained with imitation learning on …☆137Apr 23, 2026Updated 6 months ago
- ☆18May 29, 2025Updated last year
- [AAAI-2024] Follower: This study addresses the challenging problem of decentralized lifelong multi-agent pathfinding. The proposed Follow…☆67Jul 28, 2025Updated last year