4 citations · 9 across the 13 of their papers we have counts for
13 papers
On Minimum Aerial Photographs for Planar Region Coverage: Hardness and Approximation
Si Wei Feng, Kartik Mohta, Kangli Wang
Aerial photography with drones often requires covering a planar region with a limited number of images while maximizing image resolution, equivalently minimizing the footprint size…
Optimal and Stable Multi-Layer Object Rearrangement on a Tabletop
Andy Xu, Kai Gao, Si Wei Feng +1
Object rearrangement is a fundamental sub-task in accomplishing a great many physical tasks. As such, effectively executing rearrangement is an important skill for intelligent robo…
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…
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…
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…
Polynomial Time Near-Time-Optimal Multi-Robot Path Planning in Three Dimensions with Applications to Large-Scale UAV Coordination
Teng Guo, Siwei Feng, Jingjin Yu
For enabling efficient, large-scale coordination of unmanned aerial vehicles (UAVs) under the labeled setting, in this work, we develop the first polynomial time algorithm for the…
Barrier Forming: Separating Polygonal Sets with Minimum Number of Lines
Si Wei Feng, Jingjin Yu
In this work, we carry out structural and algorithmic studies of a problem of barrier forming: selecting theminimum number of straight line segments (barriers) that separate severa…
On Minimizing the Number of Running Buffers for Tabletop Rearrangement
Kai Gao, Si Wei Feng, Jingjin Yu
For tabletop rearrangement problems with overhand grasps, storage space outside the tabletop workspace, or buffers, can temporarily hold objects which greatly facilitates the resol…
Sensor Placement for Globally Optimal Coverage of 3D-Embedded Surfaces
Si Wei Feng, Kai Gao, Jie Gong +1
We carry out a structural and algorithmic study of a mobile sensor coverage optimization problem targeting 2D surfaces embedded in a 3D workspace. The investigated settings model m…
Optimally Guarding Perimeters and Regions with Mobile Range Sensors
Si Wei Feng, Jingjin Yu
We investigate the problem of using mobile robots equipped with 2D range sensors to optimally guard perimeters or regions, i.e., 1D or 2D sets. Given such a set of arbitrary shape…
Optimal Perimeter Guarding with Heterogeneous Robot Teams: Complexity Analysis and Effective Algorithms
Si Wei Feng, Jingjin Yu
We perform structural and algorithmic studies of significantly generalized versions of the optimal perimeter guarding (OPG) problem. As compared with the original OPG where robots…
Toward Fast and Optimal Robotic Pick-and-Place on a Moving Conveyor
Shuai D. Han, Si Wei Feng, Jingjin Yu
Robotic pick-and-place (PnP) operations on moving conveyors find a wide range of industrial applications. In practice, simple greedy heuristics (e.g., prioritization based on the t…
Efficient Algorithms for Optimal Perimeter Guarding
Si Wei Feng, Shuai D. Han, Kai Gao +1
We investigate the problem of optimally assigning a large number of robots (or other types of autonomous agents) to guard the perimeters of closed 2D regions, where the perimeter o…