Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Feng Si-wei"'
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 robots to master. In this study, we conduct the first algorithmic study on
Externí odkaz:
http://arxiv.org/abs/2306.14251
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 simultaneous storage spaces, or "running buffers", are required so that cert
Externí odkaz:
http://arxiv.org/abs/2304.01764
Autor:
Feng, Si Wei, Yu, Jingjin
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 perfect information of the attack events within some time (finite or infini
Externí odkaz:
http://arxiv.org/abs/2302.09706
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 rescue, coverage, surveillance, monitoring, pursuit-evasion, and so on
Externí odkaz:
http://arxiv.org/abs/2302.04319
Autor:
Feng, Si Wei, Yu, Jingjin
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 several sets of mutually disjoint objects in the plane. The problem models t
Externí odkaz:
http://arxiv.org/abs/2111.09151
For tabletop rearrangement problems with overhand grasps, storage space outside the tabletop workspace, or buffers, can temporarily hold objects which greatly facilitates the resolution of a given rearrangement task. This brings forth the natural que
Externí odkaz:
http://arxiv.org/abs/2105.06357
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 multiple important applications including camera network deployment for
Externí odkaz:
http://arxiv.org/abs/2103.10521
Autor:
Feng, Si Wei, Yu, Jingjin
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 to be guarded, and $k$ mobile sensors where the $i$-th sensor can guar
Externí odkaz:
http://arxiv.org/abs/2002.08477
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 time to process a single object) are applied that achieve reasonable ef
Externí odkaz:
http://arxiv.org/abs/1912.08009
Autor:
Feng, Si Wei, Yu, Jingjin
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 are uniform, in this paper, many mobile robots with heterogeneous sens
Externí odkaz:
http://arxiv.org/abs/1912.08591