Integrated Task and Motion Planning

By Caelan Reed Garrett, Rohan Chitnis, Rachel Holladay, Beomjoon Kim, Tom Silver, Leslie Pack Kaelbling, Tomas Lozano-Perez. 2020

718 citations recorded by the source corpus.

The problem of planning for a robot that operates in environments containing a large number of objects, taking actions to move itself through the world as well as to change the state of the objects, is known as task and motion planning (TAMP). TAMP problems contain elements of discrete task planning, discrete–continuous mathematical programming, and continuous motion planning and thus cannot be effectively addressed by any of these fields directly. In this article, we define a class of TAMP problems and survey algorithms for solving them, characterizing the solution methods in terms of their strategies for solving the continuous-space subproblems and their techniques for integrating the discrete and continuous components of the search.

Subfields: Artificial Intelligence, Computer Networks and Communications, Computer Vision and Pattern Recognition, Robotics & Control

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. Sergey Levine
  2. Chelsea Finn
  3. Josh Tenenbaum
  4. Trevor Darrell
  5. Pieter Abbeel
  6. Abhinav Kumar Gupta
  7. Li Fei-Fei
  8. Antonio Torralba

In Computer Networks and Communications

  1. Jitendra Malik
  2. Sonia Chernova
  3. Andrew J. Davison
  4. Tomas Lozano-Perez
  5. Antonio Torralba
  6. Chuang Gan
  7. Hao Su
  8. Dieter Fox

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Jitendra Malik
  3. Trevor Darrell
  4. Li Fei-Fei
  5. Dacheng Tao
  6. Abhinav Kumar Gupta
  7. Kristen Grauman
  8. Andrew Zisserman

In Robotics & Control

  1. Sergey Levine
  2. Dhruv Batra
  3. Dieter Fox
  4. Vladlen Koltun
  5. Roozbeh Mottaghi
  6. Jitendra Malik
  7. Manolis Savva
  8. Devendra Singh Chaplot

Citations in the corpus