Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain

SP Fekete, R Kosfeld, P Kramer, J Neutzner… - arXiv preprint arXiv …, 2024 - arxiv.org
We study Multi-Agent Path Finding for arrangements of labeled agents in the interior of a
simply connected domain: Given a unique start and target position for each agent, the goal …

Reconfiguration of a 2D Structure Using Spatio-Temporal Planning and Load Transferring

J Garcia, M Yannuzzi, P Kramer, C Rieck… - … on Robotics and …, 2024 - ieeexplore.ieee.org
We present progress on the problem of reconfiguring a 2D arrangement of building material
by a cooperative group of robots. These robots must avoid collisions, deadlocks, and are …

Sliding Squares in Parallel

HA Akitaya, SP Fekete, P Kramer, S Molaei… - arXiv preprint arXiv …, 2024 - arxiv.org
We consider algorithmic problems motivated by modular robotic reconfiguration, for which
we are given $ n $ square-shaped modules (or robots) in a (labeled or unlabeled) start …

Tandem Running Algorithm with Route Selection

F Abramov, V Serzhanov, O Andreiev… - 2024 IEEE 7th …, 2024 - ieeexplore.ieee.org
This article examines the problem of choosing the optimal route by a swarm of robots
controlled by the tandem running algorithm. It is proven that in the case of using the tandem …

Cooperative 2D Reconfiguration using Spatio-Temporal Planning and Load Transferring

J Garcia, M Yannuzzi, P Kramer, C Rieck… - arXiv preprint arXiv …, 2022 - arxiv.org
We present progress on the problem of reconfiguring a 2D arrangement of building material
by a cooperative set of robots. These robots are subjected to the constraints of avoiding …