Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)
☆139Oct 11, 2026Updated 3 weeks ago
Alternatives and similar repositories for lacam3
Users that are interested in lacam3 are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)☆84Aug 22, 2025Updated last year
- Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding (IJCAI-23)☆42Aug 22, 2025Updated last year
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)☆122Apr 14, 2025Updated last year
- simple multi-agent pathfinding (MAPF) visualizer for research usage☆99Nov 16, 2024Updated last year
- Minimal Python implementation of PIBT for MAPF☆65Nov 4, 2025Updated last year
- Bare Metal GPUs on DigitalOcean Gradient AI • AdPurpose-built for serious AI teams training foundational models, running large-scale inference, and pushing the boundaries of what's possible.
- LaCAM: a quick and scalable multi-agent pathfinding algorithm☆30Feb 26, 2026Updated 8 months ago
- Minimal Python implementation of LaCAM* for MAPF☆49Feb 17, 2026Updated 8 months ago
- A bounded-suboptimal solver for Multi-Agent Path Finding☆140Jul 24, 2024Updated 2 years ago
- Anytime Multi-Agent Path Finding via Large-Neighborhood Search☆75May 9, 2024Updated 2 years ago
- [AAAI-2024] Follower: This study addresses the challenging problem of decentralized lifelong multi-agent pathfinding. The proposed Follow…☆67Jul 28, 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 2 years ago
- An optimal MAPF sovler: CBS+prioritizing conflicts+bypassing+high-level heuritstics+symmetry reasoning☆139Jul 24, 2024Updated 2 years ago
- ☆20Nov 11, 2025Updated 11 months ago
- ☆11Mar 22, 2022Updated 4 years ago
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- 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
- 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
- Graph Attention-Guided Search for Dense Multi-Agent Pathfinding (AAAI-26)☆45Feb 13, 2026Updated 8 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
- ☆25Oct 28, 2025Updated last year
- [AAAI-2025] This repository contains MAPF-GPT, a deep learning-based model for solving MAPF problems. Trained with imitation learning on …☆139Apr 23, 2026Updated 6 months ago
- ☆19May 20, 2026Updated 5 months ago
- Decomposing instance into subproblem with priority☆13Jul 18, 2026Updated 3 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.
- 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
- ☆56Dec 18, 2024Updated last year
- MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search☆122May 9, 2024Updated 2 years ago
- ☆18May 29, 2025Updated last year
- Benchmarking Large Neighborhood Search for Multi-Agent Path Finding☆22Aug 18, 2025Updated last year
- BCP-MAPF – branch-and-cut-and-price for multi-agent path finding☆99Jul 28, 2025Updated last year
- db-LaCAM: Fast and Scalable Multi-Robot Kinodynamic Motion Planning with Discontinuity-Bounded Search and Lightweight MAPF (ICAPS-26)☆29Updated this week
- 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
- ☆13Mar 17, 2025Updated last year
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- Our implementation of Kinodynamic Conflict Based Search (K-CBS) inside the The Open Motion Planning Library (OMPL)☆18Feb 5, 2024Updated 2 years ago
- Distilled version of LaGAT: a neuro-guided search for multi-agent pathfinding (MAPF)☆17Jul 18, 2026Updated 3 months ago
- Offline Time-Independent Multi-Agent Path Planning (IJCAI-22, T-RO-23)☆31Apr 14, 2025Updated last year
- ☆22Updated this week
- This is an umbrella repository that contains links and information about all the tools and algorithms related to the POGEMA Benchmark.☆42Dec 10, 2025Updated 10 months ago
- "When to Switch" Implementation: Addressing the PO-MAPF challenge with RePlan & EPOM policies. This repo includes search-based re-plannin…☆43Aug 26, 2024Updated 2 years ago
- Minimal Python implementation of TSWAP for unlabeled MAPF☆13Nov 14, 2025Updated 11 months ago