3 papers
cs.RO2023
Minimizing Running Buffers for Tabletop Object Rearrangement: Complexity, Fast Algorithms, and Applications
Kai Gao, Si Wei Feng, Baichuan Huang +1
For rearranging objects on tabletops with overhand grasps, temporarily relocating objects to some buffer space may be necessary. This raises the natural question of how many simult…
cs.RO2023
Efficient Algorithms for Boundary Defense with Heterogeneous Defenders
Si Wei Feng, Jingjin Yu
This paper studies the problem of defending (1D and 2D) boundaries against a large number of continuous attacks with a heterogeneous group of defenders. The defender team has perfe…
cs.RO2023
Optimal Allocation of Many Robot Guards for Sweep-Line Coverage
Si Wei Feng, Teng Guo, Jingjin Yu
We study the problem of allocating many mobile robots for the execution of a pre-defined sweep schedule in a known two-dimensional environment, with applications toward search and…