Robotic Path Planning Algorithms Peer reviewed

Conflict-directed Temporal-geometric LaCAM for Multi-agent Path Finding With Disc Robots

JangHo Seo, Joonwoo Lee

Journal of Institute of Control Robotics and Systems | Nov 6, 2026

Abstract

Abstract

Conventional multi-agent path finding (MAPF) models agents as points and validates only vertex and edge-swap conflicts. When the same plan is executed by disc robots, geometrically close following turns can collide despite a valid discrete joint action. This paper presents conflict-directed Temporal Geo-LaCAM (Temporal-CD), which integrates finite-disc geometry and continuous-time safety into LaCAM. We precompute an exact squared-clearance profile of every local action pair as a function of the relative start-time offset. When d/D > √2/2, unsafe synchronous turns induce forced temporal precedence constraints. We show that the resulting scheduling problem is a simple temporal problem and extract the agents on each positive cycle to modify only LaCAM's low-level branching order . Temporally infeasible joint actions are rejected exactly, whereas conflict-directed branching changes only variable ordering and never prunes a feasible successor, preserving completeness under the stated motion model. With paired scenarios and random seeds, it solved all 300 MovingAI instances within 5s . On den520d with 1,000 agents, success was 99% and 84% at diameter ratios 0.80 and 0.95, versus 12% and 6% without mixed-sign-cycle branching. Independent continuous-time validation identified no infeasible transitions.

Direct answer

What can I do from this paper page?

Use this page to scan "Conflict-directed Temporal-geometric LaCAM for Multi-agent Path Finding With Disc Robots" quickly: start with the summary and abstract, then check the authors, source, topics, and related papers. From here, open Scollr to follow Robotic Path Planning Algorithms research, save the paper, or map adjacent work.

Authors

Researchers on this paper

JangHo Seo

first | ORCID 0009-0002-8041-0191

Joonwoo Lee

last | ORCID 0000-0002-3841-9603

Research areas

Follow related topics

Citation

BibTeX

@article{Seo2026Conflict,
  title = {Conflict-directed Temporal-geometric LaCAM for Multi-agent Path Finding With Disc Robots},
  author = {JangHo Seo and Joonwoo Lee},
  journal = {Journal of Institute of Control Robotics and Systems},
  year = {2026},
  doi = {10.5302/j.icros.2026.26.0222},
  url = {https://doi.org/10.5302/j.icros.2026.26.0222}
}

FAQ

Using this paper in a discovery workflow

How do I find related work for this paper?

Use the related papers and topic links on this page as starting points. In Scollr, you can also open the paper and build a literature map around its references, citing papers, and related work.

How can I keep up with new Robotic Path Planning Algorithms research papers?

Follow Robotic Path Planning Algorithms research in Scollr. New papers from the topic flow into a personalized feed, and you can save useful studies to revisit later.

Can I cite this paper from this page?

This page includes a static BibTeX block for Conflict-directed Temporal-geometric LaCAM for Multi-agent Path Finding With Disc Robots. Always verify the DOI, source, and publication details against the publisher record before submitting a manuscript.

Follow this research in Scollr

Follow the topics and authors behind this paper, save useful studies, and build a literature map when you are ready to go deeper.

Get the app