Vinitha Ranganeni

Unobservable Monte Carlo planning for nonprehensile rearrangement tasks

In this work, we present an anytime planner for creating open-loop trajectories that solve rearrangement planning problems under uncertainty using nonprehensile manipulation. We first extend the Monte Carlo Tree Search algorithm to the unobservable domain. We then propose two default policies that a…