Efficient Object Manipulation Planning with Monte Carlo Tree Search

by   Huaijiang Zhu, et al.

This paper presents an efficient approach to object manipulation planning using Monte Carlo Tree Search (MCTS) to find contact sequences and an efficient ADMM-based trajectory optimization algorithm to evaluate the dynamic feasibility of candidate contact sequences. To accelerate MCTS, we propose a methodology to learn a goal-conditioned policy-value network used to direct the search towards promising nodes. Further, manipulation-specific heuristics enable to drastically reduce the search space. Systematic object manipulation experiments in a physics simulator demonstrate the efficiency of our approach. In particular, our approach scales favorably for long manipulation sequences thanks to the learned policy-value network, significantly improving planning success rate.


Enhancing Dexterity in Robotic Manipulation via Hierarchical Contact Exploration

We present a hierarchical planning framework for dexterous robotic manip...

Monte-Carlo Tree Search as Regularized Policy Optimization

The combination of Monte-Carlo tree search (MCTS) with deep reinforcemen...

Monte-Carlo Tree Search with Prioritized Node Expansion for Multi-Goal Task Planning

Task planning for robots is computationally challenging due to the combi...

Habits of Mind: Reusing Action Sequences for Efficient Planning

When we exercise sequences of actions, their execution becomes more flue...

Stable Prehensile Pushing: In-Hand Manipulation with Alternating Sticking Contacts

This paper presents an approach to in-hand manipulation planning that ex...

Please sign up or login with your details

Forgot password? Click here to reset