Discovering State and Action Abstractions for Generalized Task and Motion Planning

Aidan Curtis, Tom Silver, Joshua B. Tenenbaum, Tomás Lozano-Pérez, Leslie Kaelbling

Research output: Chapter in Book/Report/Conference proceedingConference contribution

17 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publicationAAAI-22 Technical Tracks 5
PublisherAssociation for the Advancement of Artificial Intelligence
Pages5377-5384
Number of pages8
ISBN (Electronic)1577358767, 9781577358763
DOIs
StatePublished - Jun 30 2022
Externally publishedYes
Event36th AAAI Conference on Artificial Intelligence, AAAI 2022 - Virtual, Online
Duration: Feb 22 2022Mar 1 2022

Publication series

NameProceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022
Volume36

Conference

Conference36th AAAI Conference on Artificial Intelligence, AAAI 2022
CityVirtual, Online
Period2/22/223/1/22

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Discovering State and Action Abstractions for Generalized Task and Motion Planning'. Together they form a unique fingerprint.

Cite this