LaCAM3
- Software
- Navigation and mapping
- Library
LaCAM3 is a search-based multi-agent pathfinding (MAPF) planner in C++, designed to handle very large instances with more than a thousand agents, from the AAMAS-24 paper on engineering LaCAM*.
Source on GitHub: github.com/Kei18/lacam3 (opens in a new tab). Facts read at commit 1c3ecf8 (opens in a new tab).
Licenses
- Code
- MIT (opens in a new tab)
Read by Robotheca from LICENCE.txt (opens in a new tab) (MIT) at commit 1c3ecf8 (opens in a new tab), on 22 Oct 2026.
- Commercial use
- Yes
What it does
- Search-based MAPF algorithm aimed at real-time, large-scale planning with near-optimal solutions.
- Third generation of the LaCAM line of algorithms, building on earlier lacam and lacam2 versions.
- Builds with CMake and writes its planning result to a file, with parameters set via command-line flags.
- Output is compatible with the mapf-visualizer tool.
- Includes a Julia-based experiment pipeline and example configurations used in the paper.
- A Python binding is available on a separate branch.
Written by Robotheca from the project's README (opens in a new tab) at commit 1c3ecf8.
Getting started
- Difficulty
- Advanced
- How to start
- The project's website (opens in a new tab)
Maintenance
- Status
- Active: a commit in the last 90 days
- Newest commit
- 12 Oct 2026 on main
- Latest release
- None published on GitHub
Checked on GitHub on 22 Oct 2026.
Links
Robots that can run it
No robot on Robotheca is linked to it yet. Links come from a robot's robot.yaml, from its dependency files read as text, or from Robotheca's editors.
Robotheca lists software as a reference: nothing is hosted or run here, and every fact links to where it was read.