Abstract Multi-Agent Path Finding (MAPF) is NP-hard to solve optimally, even on graphs,
suggesting no polynomial-time algorithms can compute exact optimal solutions for them …

We study the computational complexity of multi-agent path finding (MAPF). Given a graph $
G $ and a set of agents, each having a start and target vertex, the goal is to find collision-free …

We consider the problem of retrieving a target object from a confined space by two robotic
manipulators where overhand grasps are not allowed. If other movable obstacles occlude …

Graph-based multi-robot path planning (MRPP) is NP-hard to optimally solve. In this work,
we propose the first low polynomial-time algorithm for MRPP achieving 1--1.5 asymptotic …

Reconfiguring two shortest paths in a graph means modifying one shortest path to the other
by changing one vertex at a time so that all the intermediate paths are also shortest paths …

This article describes the heuristics used by the Shadoks team for the CG: SHOP 2021
challenge. This year's problem is to coordinate the motion of multiple robots in order to reach …

We propose the redistribution-reconfiguration (red-rec) algorithm to prepare large
configurations of atoms using programmable arrays of optical traps. Red-rec exploits simple …

We give an overview of the 2021 Computational Geometry Challenge, which targeted the
problem of optimally coordinating a set of robots by computing a family of collision-free …

We consider geometric collision-detection problems for modular reconfigurable robots.
Assuming the nodes (modules) are connected squares on a grid, we investigate the …

In the 15-puzzle game, 15 labeled square tiles are reconfigured on a 4× 4 board through an
escort, wherein each (time) step, a single tile neighboring it may slide into it, leaving the …