paper-with-me

홈 › Papers

SceneScore: Learning a Cost Function for Object Arrangement

2023-11-14 · Ivan Kapelyukh, Edward Johns

Arranging objects correctly is a key capability for robots which unlocks a wide range of useful tasks. A prerequisite for creating successful arrangements is the ability to evaluate the desirability of a given arrangement. Our method "SceneScore" learns a cost function for arrangements, such that desirable, human-like arrangements have a low cost. We learn the distribution of training arrangements offline using an energy-based model, solely from example images without requiring environment interaction or human supervision. Our model is represented by a graph neural network which learns object-object relations, using graphs constructed from images. Experiments demonstrate that the learned cost function can be used to predict poses for missing objects, generalise to novel objects using semantic features, and can be composed with other cost functions to satisfy constraints at inference time.

📄 PDF Abstract BibTeX arXiv:2311.08530

Code (0)

등록된 구현이 없습니다.

Tasks

Graph Neural NetworkObject

Methods 이 논문이 사용한 방법론

Graph Neural Network 설명 없음

Similar Papers 제목 키워드 기반

"Set It Up!": Functional Object Arrangement with Compositional Generative Models

2024-05-20 · Yiqing Xu, Jiayuan Mao, Yilun Du, Tomas Lozáno-Pérez 외

This paper studies the challenge of developing robots capable of understanding under-specified instructions for creating functional object arrangements, such as "set up a dining table for two"; previous arrangement appro…

Object

ReloPush-BOSS: Optimization-guided Nonmonotone Rearrangement Planning for a Car-like Robot Pusher

2026-01-29 · Jeeho Ahn, Christoforos Mavrogiannis arxiv

We focus on multi-object rearrangement planning in densely cluttered environments using a car-like robot pusher. The combination of kinematic, geometric and physics constraints underlying this domain results in challengi…

Object Rearrangement

LEGO-Net: Learning Regular Rearrangements of Objects in Rooms

2023-01-23 · CVPR 2023 1 · Qiuhong Anna Wei, Sijie Ding, Jeong Joon Park, Rahul Sajnani 외

Humans universally dislike the task of cleaning up a messy room. If machines were to help us with this task, they must understand human criteria for regular arrangements, such as several types of symmetry, co-linearity o…

Dynamic Buffers: Cost-Efficient Planning for Tabletop Rearrangement with Stacking

2025-09-26 · Arman Barghi, Hamed Hosseini, Seraj Ghasemi, Mehdi Tale Masouleh 외 arxiv

Rearranging objects in cluttered tabletop environments remains a long-standing challenge in robotics. Classical planners often generate inefficient, high-cost plans by shuffling objects individually and using fixed buffe…

Object Rearrangement Using Learned Implicit Collision Functions

2020-11-21 · Michael Danielczuk, Arsalan Mousavian, Clemens Eppner, Dieter Fox

Robotic object rearrangement combines the skills of picking and placing objects. When object models are unavailable, typical collision-checking models may be unable to predict collisions in partial point clouds with occl…

ObjectObject Rearrangement