cs.MANov 3, 2026

Local Visibility Roadmaps in Continous Multi-agent Path Finding

Authors: Kristýna Janovská, Pavel Surynek

Organizations: Czech Technical University in Prague, Faculty of Information Technology, Thákurova 9, 160 00 Praha 6, Czechia

Abstract

We address the problem of smooth continuous multi-agent path finding (SC-MAPF), where agents move in a continuous environment along smooth curves in continuous time. The paths for individual agents are searched in local visibility roadmaps that consider obstacles and other agents. A new algorithm is proposed in this work, which combines the previous algorithm CE-CBS for high-level search with any-angle path finding for local single-agent planning, where agents are to avoid obstacles, both static and other agents. The new algorithm is tested and compared to CE-CBS, the algorithm building individual paths using RRT∗^*, and SMT-CCBS algorithm, an algorithm for MAPFR_R. Experimental results show various advantages of the new algorithm over CE-CBS and SMT-CCBS in comparable settings.

Figures & tables

Explore similar work

CardsList
  1. AOC-CBS: Anytime-Optimal Continuous-time Conflict-Based Search for Generalised Multi-Agent Path Finding

    Aug 8, 2026Alvin Combrink, Sabino Francesco Roselli, Martin FabianRobust MAPFConflict-Based Search

  2. Conflict-Based Search for Multi Agent Path Finding with Asynchronous Actions

    Mar 19, 2026Xuemian Wu, Shizhe Zhao, Zhongqiang RenMulti-Agent Path FindingConflict-Based Search

  3. The Cost of Classical Multi-Agent Path Finding

    Oct 7, 2026Alvin Combrink, Sabino Francesco Roselli, Martin FabianMulti-Agent Path FindingGraph-Based Planning