← Search

Tomas Lozano-Perez

18 accepted papers

2026

SceneComplete: Open-World 3D Scene Completion in Cluttered Real World Environments for Robot Manipulation

ICRA 2026poster

Careful robot manipulation in every-day cluttered environments requires an accurate understanding of the 3D scene, in order to grasp and place objects stably and reliably and to avoid colliding with other objects. In general, we must construct such a 3D interpretation of a complex scene based on lim…

2023

Local Neural Descriptor Fields: Locally Conditioned Object Representations for Manipulation

ICRA 2023poster

A robot operating in a household environment will see a wide range of unique and unfamiliar objects. While a system could train on many of these, it is infeasible to predict all the objects a robot will see. In this paper, we present a method to generalize object manipulation skills acquired from a…

Cited by 20SourcecodeScholar
2023

Sequence-Based Plan Feasibility Prediction for Efficient Task and Motion Planning

RSS 2023poster

We present a learning-enabled Task and Motion Planning (TAMP) algorithm for solving mobile manipulation problems in environments with many articulated and movable obstacles. Our idea is to bias the search procedure of a traditional TAMP planner with a learned plan feasibility predictor. The core of…

Cited by 30SourcePDFScholar
2022

PG3: Policy-Guided Planning for Generalized Policy Generation

IJCAI 2022poster

A longstanding objective in classical planning is to synthesize policies that generalize across multiple problems from the same domain. In this work, we study generalized policy search-based methods with a focus on the score function used to guide the search over policies. We demonstrate limitations…

2021

A large-scale benchmark for few-shot program induction and synthesis

ICML 2021spotlight

A landmark challenge for AI is to learn flexible, powerful representations from small numbers of examples. On an important class of tasks, hypotheses in the form of programs provide extreme generalization capabilities from surprisingly few examples. However, whereas large natural few-shot learning i…

Cited by 24SourcePDFScholar
2020

CAMPs: Learning Context-Specific Abstractions for Efficient Planning in Factored MDPs

CoRL 2020

Meta-planning, or learning to guide planning from experience, is a promising approach to improving the computational cost of planning. A general meta-planning strategy is to learn to impose constraints on the states considered and actions taken by the agent. We observe that (1) imposing a constraint

Cited by 0SourcePDFScholar
2020

Meta-learning curiosity algorithms

ICLR 2020poster

We hypothesize that curiosity is a mechanism found by evolution that encourages meaningful exploration early in an agent's life in order to expose it to experiences that enable it to obtain high rewards over the course of its lifetime. We formulate the problem of generating curious behavior as one o…

Cited by 83SourcecodeScholar
2020

Scalable and Probabilistically Complete Planning for Robotic Spatial Extrusion

RSS 2020poster

There is increasing demand for automated systems that can fabricate 3D structures. Robotic spatial extrusion has become an attractive alternative to traditional layer-based 3D printing due to a manipulator's flexibility to print large, directionally-dependent structures. However, existing extrusion…

2019

Differentiable Algorithm Networks for Composable Robot Learning

RSS 2019poster

This paper introduces the Differentiable Algorithm Network (DAN), a composable architecture for robot learning systems. A DAN is composed of neural network modules, each encoding a differentiable robot algorithm and an associated model; and it is trained end-to-end from data. DAN combines the streng…

Cited by 81SourcePDFScholar
2019

Graph Element Networks: adaptive, structured computation and memory

ICML 2019oral

We explore the use of graph neural networks (GNNs) to model spatial processes in which there is no a priori graphical structure. Similar to finite element analysis, we assign nodes of a GNN to spatial locations and use a computational process defined on the graph to model the relationship between an…

2018

Adaptable replanning with compressed linear action models for learning from demonstrations

CoRL 2018

We propose an adaptable and efficient model-based reinforcement learning approach well suited for continuous domains with sparse samples, a setting often encountered when learning from demonstrations. The flexibility of our method originates from the approximate transition models, estimated from dat

Cited by 0SourcePDFScholar
2017

Sample-Based Methods for Factored Task and Motion Planning

RSS 2017poster

There has been a great deal of progress in developing probabilistically complete methods that move beyond motion planning to multi-modal problems including various forms of task planning. This paper presents a general-purpose formulation of a large class of discrete-time planning problems, with hybr…