Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Ye, Zihe"'
Shortest-path roadmaps, also known as reduced visibility graphs, provides a highly efficient multi-query method for computing optimal paths in two-dimensional environments. Combined with Minkowski sum computations, shortest-path roadmaps can compute
Externí odkaz:
http://arxiv.org/abs/2409.03920
Long-horizon task and motion planning (TAMP) is notoriously difficult to solve, let alone optimally, due to the tight coupling between the interleaved (discrete) task and (continuous) motion planning phases, where each phase on its own is frequently
Externí odkaz:
http://arxiv.org/abs/2404.06758
Picking up multiple objects at once is a grasping skill that makes a human worker efficient in many domains. This paper presents a system to pick a requested number of objects by only picking once (OPO). The proposed Only-Pick-Once System (OPOS) cont
Externí odkaz:
http://arxiv.org/abs/2307.02662