2026-09-19T19:54:17Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1063892026-06-06T00:55:11Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Tomás Lozano-Pérez.
Venkatraman, Amruth
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2017-01-12T18:18:48Z
2017-01-12T18:18:48Z
2016
2016
http://hdl.handle.net/1721.1/106389
967661833
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (page 47).
We present algorithms for motion planning that can tolerate collisions. Because finding a path of minimum cover is prohibitively expensive, we investigate algorithms that work well in practice and find solutions close to the true minimum cover solution. We introduce the notion of removal importance for obstacles and the family of iterative obstacle removing RRTs (IOR-RRTs). This family of algorithms operate similarly to the RRT but iteratively tolerate more collisions in trying to identify a path. One member of the family that performs well is the search informed IOR-RRT. This search technique first performs bidirectional collision-free search to find a clear path if possible. In failure, it iteratively selects an obstacle for removal using its removal importance. We measure the performance of our algorithms on a multi-link robot operating in both environments with feasible paths and those where collisions must be allowed.
by Amruth Venkatraman.
M.Eng.
47 pages
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.
Exploring constraint removal motion planners
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="94252454-1337-443d-b252-4948ea245532">
<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>Exploring constraint removal motion planners</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2016</PublicationDate>
<Authors>
<Author>
<DisplayName>Venkatraman, Amruth</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 present algorithms for motion planning that can tolerate collisions. Because finding a path of minimum cover is prohibitively expensive, we investigate algorithms that work well in practice and find solutions close to the true minimum cover solution. We introduce the notion of removal importance for obstacles and the family of iterative obstacle removing RRTs (IOR-RRTs). This family of algorithms operate similarly to the RRT but iteratively tolerate more collisions in trying to identify a path. One member of the family that performs well is the search informed IOR-RRT. This search technique first performs bidirectional collision-free search to find a clear path if possible. In failure, it iteratively selects an obstacle for removal using its removal importance. We measure the performance of our algorithms on a multi-link robot operating in both environments with feasible paths and those where collisions must be allowed.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>