An anytime algorithm integrates sampling-based motion planning with hierarchical search for optimal object placement poses in cluttered environments.
(2) we exploit the afore- mentioned correlation and employ a Monte Carlo Tree search (MCTS) [18]-based algorithm for sampling
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.RO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Object Placement Planning and Optimization for Robot Manipulators
An anytime algorithm integrates sampling-based motion planning with hierarchical search for optimal object placement poses in cluttered environments.