Formulates optimal knock-pick planning for grid-placed uniform blocks and solves it in polynomial time via maximum-weight perfect matching on a graphical abstraction of minimal constraining gadgets.
Robotics: Sci- ence and Systems VII1, 65–72 (2011)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.RO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Optimal Knock-Pick Planning for Tightly Packed Tabletop Blocks With Parallel Grippers
Formulates optimal knock-pick planning for grid-placed uniform blocks and solves it in polynomial time via maximum-weight perfect matching on a graphical abstraction of minimal constraining gadgets.