Rubik Tables, Stack Rearrangement, and Multi-Robot Path Planning

Teng Guo, Si Wei Feng, Mario Szegedy, Jingjin Yu

Abstract: This extended abstract provides a unified summary of Rubik Tables and its applications to challenging combinatorial reconfiguration problems in robotics including stack rearrangement and multi-robot path planning, based on materials from [1]–[4]. The Rubik Table abstraction provides a simple to use yet fairly powerful tool that allows the near-optimal reconfiguration of many objects in low-polynomial computation time, which can be expected to find other high-utility applications beyond stack rearrangement and multi-robot path planning.