Minimum Volume Bounding Box decomposition for shape approximation in robot grasping
2008 (English)In: 2008 IEEE International Conference on Robotics and Automation, ICRA 2008: Vols 1-9, 2008, 1628-1633 p.Conference paper (Refereed)
Thinking about intelligent robots involves consideration of how such systems can be enabled to perceive, interpret and act in arbitrary and dynamic environments. While sensor perception and model interpretation focus on the robot's internal representation of the world rather passively, robot grasping capabilities are needed to actively execute tasks, modify scenarios and thereby reach versatile goals. These capabilities should also include the generation of stable grasps to safely handle even objects unknown to the robot. We believe that the key to this ability is not to select a good grasp depending on the identification of an object (e.g. as a cup), but on its shape (e.g. as a composition of shape primitives). In this paper, we envelop given 3D data points into primitive box shapes by a fit-and-split algorithm that is based on an efficient Minimum Volume Bounding Box implementation. Though box shapes are not able to approximate arbitrary data in a precise manner, they give efficient clues for planning grasps on arbitrary objects. We present the algorithm and experiments using the 3D grasping simulator GraspIt! .
Place, publisher, year, edition, pages
2008. 1628-1633 p.
, IEEE International Conference On Robotics And Automation, ISSN 1050-4729
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-38392DOI: 10.1109/ROBOT.2008.4543434ISI: 000258095001046ScopusID: 2-s2.0-51649096480ISBN: 978-1-4244-1646-2OAI: oai:DiVA.org:kth-38392DiVA: diva2:437759
IEEE International Conference on Robotics and Automation Location: Pasadena, CA Date: MAY 19-23, 2008