The Teenager's Problem: Efficient Garment Decluttering as Probabilistic Set Cover
Abstract
This paper addresses the "Teenager's Problem": efficiently removing scattered garments from a planar surface into a basket. As grasping and transporting individual garments is highly inefficient, we propose policies to select grasp locations for multiple garments using an overhead camera. Our core approach is segment-based, which uses segmentation on the overhead RGB image of the scene. We propose a Probabilistic Set Cover formulation of the problem, aiming to minimize the number of grasps that clear all garments off the surface. Grasp efficiency is measured by Objects per Transport (OpT), which denotes the average number of objects removed per trip to the laundry basket. Additionally, we explore several depth-based methods, which use overhead depth data to find efficient grasps. Experiments suggest that our segment-based method increases OpT by over a random baseline, whereas combined hybrid methods yield improvements of . Finally, a method employing consolidation (with segmentation) is considered, which locally moves the garments on the work surface to increase OpT, when the distance to the basket is much greater than the local motion distances. This yields an improvement of over the baseline.
Cite
@article{arxiv.2310.16951,
title = {The Teenager's Problem: Efficient Garment Decluttering as Probabilistic Set Cover},
author = {Aviv Adler and Ayah Ahmad and Yulei Qiu and Shengyin Wang and Wisdom C. Agboh and Edith Llontop and Tianshuang Qiu and Jeffrey Ichnowski and Thomas Kollar and Richard Cheng and Mehmet Dogar and Ken Goldberg},
journal= {arXiv preprint arXiv:2310.16951},
year = {2024}
}
Comments
Accepted by the 16th International Workshop on the Algorithmic Foundations of Robotics (WAFR 2024)