Discovering State and Action Abstractions for Generalized Task and Motion Planning

By Aidan Curtis, Tom Silver, Josh Tenenbaum, Tomas Lozano-Perez, Leslie Pack Kaelbling. 2021

37 citations recorded by the source corpus.

Generalized planning accelerates classical planning by finding an algorithm-like policy that solves multiple instances of a task. A generalized plan can be learned from a few training examples and applied to an entire domain of problems. Generalized planning approaches perform well in discrete AI planning problems that involve large numbers of objects and extended action sequences to achieve the goal. In this paper, we propose an algorithm for learning features, abstractions, and generalized plans for continuous robotic task and motion planning (TAMP) and examine the unique difficulties that arise when forced to consider geometric and physical constraints as a part of the generalized plan. Additionally, we show that these simple generalized plans learned from only a handful of examples can be used to improve the search efficiency of TAMP solvers.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Josh Tenenbaum
  2. Tomas Lozano-Perez
  3. Leslie Pack Kaelbling
  4. Marco Pavone
  5. Tom Silver
  6. Kevin Qinghong Lin
  7. Sergey Levine
  8. Jeannette Bohg

In Computer Vision and Pattern Recognition

  1. Josh Tenenbaum
  2. Kevin Qinghong Lin
  3. Leslie Pack Kaelbling
  4. Tomas Lozano-Perez
  5. Marco Pavone
  6. Jitendra Malik
  7. Jeannette Bohg
  8. Li Fei-Fei

Citations in the corpus