LaCAM: Search-based Algorithm for Quick Multi-Agent Pathfinding

This page summarises the LaCAM (lazy constraints addition search) algorithm for multi-agent pathfinding (MAPF) and its variants. LaCAM's goal is to provide a quick, scalable, and reliable solution for MAPF.
Listed only those in which KO was involved.









@inproceedings{okumura2023lacam,
title={LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding},
booktitle={Proceedings of AAAI Conference on Artificial Intelligence (AAAI)},
year={2023},
author={Okumura, Keisuke}
}