Guiding Search in Continuous State-Action Spaces by Learning an Action Sampler From Off-Target Search Experience

Authors

  • Beomjoon Kim Massachusetts Institute of Technology
  • Leslie Kaelbling Massachusetts Institute of Technology
  • Tomás Lozano-Pérez Massachusetts Institute of Technology

Abstract

In robotics, it is essential to be able to plan efficiently in high-dimensional continuous state-action spaces for long horizons. For such complex planning problems, unguided uniform sampling of actions until a path to a goal is found is hopelessly inefficient, and gradient-based approaches often fall short when the optimization manifold of a given problem is not smooth. In this paper, we present an approach that guides search in continuous spaces for generic planners by learning an action sampler from past search experience. We use a Generative Adversarial Network (GAN) to represent an action sampler, and address an important issue: search experience consists of a relatively large number of actions that are not on a solution path and a relatively small number of actions that actually are on a solution path. We introduce a new technique, based on an importance-ratio estimation method, for using samples from a non-target distribution to make GAN learning more data-efficient. We provide theoretical guarantees and empirical evaluation in three challenging continuous robot planning problems to illustrate the effectiveness of our algorithm.

Downloads

Published

2018-04-26

How to Cite

Kim, B., Kaelbling, L., & Lozano-Pérez, T. (2018). Guiding Search in Continuous State-Action Spaces by Learning an Action Sampler From Off-Target Search Experience. Proceedings of the AAAI Conference on Artificial Intelligence, 32(1). Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/12106