NeRP: Neural Rearrangement Planning for Unknown Objects
Robots will be expected to manipulate a wide variety of objects in complex and arbitrary ways as they become more widely used in human environments. As such, the rearrangement of objects has been noted to be an important benchmark for AI capabilities in recent years. We propose NeRP (Neural Rearrangement Planning), a deep learning based approach for multi-step neural object rearrangement planning which works with never-before-seen objects, that is trained on simulation data, and generalizes to the real world. We compare NeRP to several naive and model-based baselines, demonstrating that our approach is measurably better and can efficiently arrange unseen objects in fewer steps and with less planning time. Finally, we demonstrate it on several challenging rearrangement problems in the real world.
Code (0)
등록된 구현이 없습니다.
Tasks
Object RearrangementSimilar Papers 제목 키워드 기반
Effective Baselines for Multiple Object Rearrangement Planning in Partially Observable Mapped Environments
Many real-world tasks, from house-cleaning to cooking, can be formulated as multi-object rearrangement problems -- where an agent needs to get specific objects into appropriate goal states. For such problems, we focus on…
Deep Reinforcement LearningObjectObject RearrangementObject RecognitionPredicting Stable Configurations for Semantic Placement of Novel Objects
Human environments contain numerous objects configured in a variety of arrangements. Our goal is to enable robots to repose previously unseen objects according to learned semantic relationships in novel environments. We …
Motion PlanningvalidMonte-Carlo Tree Search for Efficient Visually Guided Rearrangement Planning
We address the problem of visually guided rearrangement planning with many movable objects, i.e., finding a sequence of actions to move a set of objects from an initial arrangement to a desired one, while relying on visu…
State EstimationToward Efficient Task Planning for Dual-Arm Tabletop Object Rearrangement
We investigate the problem of coordinating two robot arms to solve non-monotone tabletop multi-object rearrangement tasks. In a non-monotone rearrangement task, complex object-object dependencies exist that require movin…
ObjectObject RearrangementSchedulingTask PlanningNeRP: Implicit Neural Representation Learning with Prior Embedding for Sparsely Sampled Image Reconstruction
Image reconstruction is an inverse problem that solves for a computational image based on sampled sensor measurement. Sparsely sampled image reconstruction poses addition challenges due to limited measurements. In this w…
Image ReconstructionRepresentation Learning