Robust Trajectory Selection for Rearrangement Planning as a Multi-Armed Bandit Problem

September 2015

Robust Trajectory Selection for Rearrangement Planning as a Multi-Armed Bandit Problem

Conference Paper
Proceedings of (IROS) IEEE/RSJ International Conference on Intelligent Robots and Systems

Abstract:

We present an algorithm for generating open- loop trajectories that solve the problem of rearrangement planning under uncertainty. We frame this as a selection problem where the goal is to choose the most robust trajectory from a finite set of candidates. We generate each candidate using a kinodynamic state space planner and evaluate it using noisy rollouts. Our key insight is we can formalize the selection problem as the “best arm” variant of the multi-armed bandit problem. We use the successive rejects algorithm to efficiently allocate rollouts between candidate trajectories given a rollout budget. We show that the successive rejects algorithm identifies the best candidate using fewer rollouts than a baseline algorithm in simulation. We also show that selecting a good candidate increases the likelihood of successful execution on a real robot.
@conference{Koval-2015-6016,
author = {Michael Koval And Jennifer King And Nancy Pollard And Siddhartha Srinivasa},
title = {Robust Trajectory Selection for Rearrangement Planning as a Multi-Armed Bandit Problem},
booktitle = {Proceedings of (IROS) IEEE/RSJ International Conference on Intelligent Robots and Systems},
year = {2015},
month = {September},
pages = {2678 - 2685},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.