3 citations · 12 across the 18 of their papers we have counts for
3 papers · 1 filter
Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Real Arithmetic
Tomáš Kolárik, Stefan Ratschan, Pavel Surynek
This paper introduces a new approach to solving a continuous-time version of the multi-agent path finding problem. The algorithm translates the problem into an extension of the cla…
Multi-Agent Path Finding with Capacity Constraints
Pavel Surynek, T. K. Satish Kumar, Sven Koenig
In multi-agent path finding (MAPF) the task is to navigate agents from their starting positions to given individual goals. The problem takes place in an undirected graph whose vert…
Maintaining Ad-Hoc Communication Network in Area Protection Scenarios with Adversarial Agents
Marika Ivanová, Pavel Surynek, Diep Thi Ngoc Nguyen
We address a problem of area protection in graph-based scenarios with multiple mobile agents where connectivity is maintained among agents to ensure they can communicate. The probl…