Active model learning and diverse action sampling for task and motion planning

03/02/2018
by   Zi Wang, et al.
0

The objective of this work is to augment the basic abilities of a robot by learning to use new sensorimotor primitives to enable the solution of complex long-horizon problems. Solving long-horizon problems in complex domains requires flexible generative planning that can combine primitive abilities in novel combinations to solve problems as they arise in the world. In order to plan to combine primitive actions, we must have models of the preconditions and effects of those actions: under what circumstances will executing this primitive achieve some particular effect in the world? We use, and develop novel improvements on, state-of-the-art methods for active learning and sampling. We use Gaussian process methods for learning the conditions of operator effectiveness from small numbers of expensive training examples collected by experimentation on a robot. We develop adaptive sampling methods for generating diverse elements of continuous sets (such as robot configurations and object poses) during planning for solving a new task, so that planning is as efficient as possible. We demonstrate these methods in an integrated system, combining newly learned models with an efficient continuous-space robot task and motion planner to learn to solve long horizon problems more efficiently than was previously possible.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/08/2020

Learning compositional models of robot skills for task and motion planning

The objective of this work is to augment the basic abilities of a robot ...
research
11/15/2022

Learning to Correct Mistakes: Backjumping in Long-Horizon Task and Motion Planning

As robots become increasingly capable of manipulation and long-term auto...
research
06/22/2023

DiMSam: Diffusion Models as Samplers for Task and Motion Planning under Partial Observability

Task and Motion Planning (TAMP) approaches are effective at planning lon...
research
06/26/2018

A Constraint-based Encoding for Domain-Independent Temporal Planning

We present a general constraint-based encoding for domain-independent ta...
research
12/06/2022

Solving Rearrangement Puzzles using Path Defragmentation in Factored State Spaces

Rearrangement puzzles are variations of rearrangement problems in which ...
research
11/07/2020

MAGIC: Learning Macro-Actions for Online POMDP Planning using Generator-Critic

When robots operate in the real-world, they need to handle uncertainties...
research
07/13/2023

Embodied Lifelong Learning for Task and Motion Planning

A robot deployed in a home over long stretches of time faces a true life...

Please sign up or login with your details

Forgot password? Click here to reset