CabiNet: Scaling Neural Collision Detection for Object Rearrangement with Procedural Scene Generation
We address the important problem of generalizing robotic rearrangement to clutter without any explicit object models. We first generate over 650K cluttered scenes - orders of magnitude more than prior work - in diverse everyday environments, such as cabinets and shelves. We render synthetic partial point clouds from this data and use it to train our CabiNet model architecture. CabiNet is a collision model that accepts object and scene point clouds, captured from a single-view depth observation, and predicts collisions for SE(3) object poses in the scene. Our representation has a fast inference speed of 7 microseconds per query with nearly 20% higher performance than baseline approaches in challenging environments. We use this collision model in conjunction with a Model Predictive Path Integral (MPPI) planner to generate collision-free trajectories for picking and placing in clutter. CabiNet also predicts waypoints, computed from the scene's signed distance field (SDF), that allows the robot to navigate tight spaces during rearrangement. This improves rearrangement performance by nearly 35% compared to baselines. We systematically evaluate our approach, procedurally generate simulated experiments, and demonstrate that our approach directly transfers to the real world, despite training exclusively in simulation. Robot experiment demos in completely unknown scenes and objects can be found at this http https://cabinet-object-rearrangement.github.io
Code (0)
등록된 구현이 없습니다.
Tasks
NavigateObjectObject RearrangementScene GenerationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Object Rearrangement Using Learned Implicit Collision Functions
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 RearrangementPaiP: An Operational Aware Interactive Planner for Unknown Cabinet Environments
Box/cabinet scenarios with stacked objects pose significant challenges for robotic motion due to visual occlusions and constrained free space. Traditional collision-free trajectory planning methods often fail when no col…
Trajectory PlanningVER: Scaling On-Policy RL Leads to the Emergence of Navigation in Embodied Rearrangement
We present Variable Experience Rollout (VER), a technique for efficiently scaling batched on-policy reinforcement learning in heterogenous environments (where different environments take vastly different times to generat…
GPUNavigateObjectGoal NavigationOut-of-Distribution Generalization+1Uniform Object Rearrangement: From Complete Monotone Primitives to Efficient Non-Monotone Informed Search
Object rearrangement is a widely-applicable and challenging task for robots. Geometric constraints must be carefully examined to avoid collisions and combinatorial issues arise as the number of objects increases. This wo…
ObjectObject RearrangementMINSU (Mobile Inventory And Scanning Unit):Computer Vision and AI
The MINSU(Mobile Inventory and Scanning Unit) algorithm uses the computational vision analysis method to record the residual quantity/fullness of the cabinet. To do so, it goes through a five-step method: object detectio…
ClusteringManagementobject-detectionObject Detection