2026-09-18T19:34:58Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/823422022-01-13T07:54:01Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022

Leslie Pack Kaelbling and Tomás Lozano-Pérez. Barry, Jennifer L. (Jennifer Lynn) Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science 2013-11-18T19:11:11Z 2013-11-18T19:11:11Z 2013 2013 http://hdl.handle.net/1721.1/82342 861700257 Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2013. Cataloged from PDF version of thesis. Includes bibliographical references (p. 197-201). We define the Diverse Action Manipulation (DAMA) problem in which we are given a mobile robot, a set of movable objects, and a set of diverse, possibly non-prehensile manipulation actions, and the objective is to find a sequence of actions that moves each of the objects to a goal configuration. We argue that classic sampling-based techniques cannot solve DAMA problems because of the need to move through lower-dimensional subspaces, and we give two sampling-based algorithms for this problem, DARRT and DARRTCONNECT, based on the RRT and RRTCONNECT algorithms respectively. We also show that the DAMA problem can be framed as a multi-modal planning problem [14] and describe a hierarchical algorithm, DARRTH (CONNECT), that takes advantage of this multi-modal nature. This algorithm finds a high-level sequence of transfer manipulations by planning a path only for objects in the domain. It then attempts to achieve each transfer manipulation individually. We present experimental results for all four algorithms for a set of nine problems in two complicated mobile manipulation domains. We show that the bi-directional algorithms are faster than their forward search counterparts and that the hierarchical algorithms perform better than the monolithic searches. We also formally define the conditions under which DARRT is exponentially convergent and prove that these conditions hold for two example manipulation domains, one of which includes nonprehensile manipulation. by Jennifer L. Barry. Ph.D. 201 p. eng Massachusetts Institute of Technology M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 Electrical Engineering and Computer Science. Manipulation with diverse actions Thesis application/pdf false Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="dab83fd7-71c3-4b38-84a4-02fae06162d6"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>Manipulation with diverse actions</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2013</PublicationDate> <Authors> <Author> <DisplayName>Barry, Jennifer L. (Jennifer Lynn)</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://dspace.mit.edu/handle/1721.1/7582</License> <Keyword>Electrical Engineering and Computer Science.</Keyword> <Abstract>We define the Diverse Action Manipulation (DAMA) problem in which we are given a mobile robot, a set of movable objects, and a set of diverse, possibly non-prehensile manipulation actions, and the objective is to find a sequence of actions that moves each of the objects to a goal configuration. We argue that classic sampling-based techniques cannot solve DAMA problems because of the need to move through lower-dimensional subspaces, and we give two sampling-based algorithms for this problem, DARRT and DARRTCONNECT, based on the RRT and RRTCONNECT algorithms respectively. We also show that the DAMA problem can be framed as a multi-modal planning problem [14] and describe a hierarchical algorithm, DARRTH (CONNECT), that takes advantage of this multi-modal nature. This algorithm finds a high-level sequence of transfer manipulations by planning a path only for objects in the domain. It then attempts to achieve each transfer manipulation individually. We present experimental results for all four algorithms for a set of nine problems in two complicated mobile manipulation domains. We show that the bi-directional algorithms are faster than their forward search counterparts and that the hierarchical algorithms perform better than the monolithic searches. We also formally define the conditions under which DARRT is exponentially convergent and prove that these conditions hold for two example manipulation domains, one of which includes nonprehensile manipulation.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>