MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A roadmap-based planner for fast collision-free motion in changing environments

Author(s)
Orton, Matthew Ralph
Thumbnail
DownloadFull printable version (7.001Mb)
Other Contributors
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Advisor
Andreas Hofmann and Brian Williams.
Terms of use
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Abstract
This thesis describes the development of a roadmap-based planner to enable high- DOF robotic arms to accomplish tasks based around motion planning problems with motions that feel reactive and intuitive in changing environments. My approach to accomplish this is to combine a roadmap-based motion planner with a sequential, convex trajectory optimization library called TrajOpt. The roadmap is used to produce collision-free seed trajectories, which are then provided to TrajOpt for optimization based on path length and proximity to obstacles. The difficulty of this approach arises from how to quickly update the roadmap as the environment changes to ensure that the seed trajectory provided to TrajOpt is always collision-free. This difficulty is addressed with a few different innovations. The roadmaps used by this planner are relatively sparse, so they are faster to update and perform searches on. Next, the sparse roadmaps are constructed offline along with a cache of shortest path solutions to minimize online search requirements. These solution caches are combined with an iterative search algorithm based around A* search with lazy collision checking. Finally, an adaptation of an incremental search algorithm, D* Lite, is developed to take advantage of the full environment knowledge assumed by my motion planner and the rapid optimization provided by TrajOpt while utilizing a lazier collision checking approach than the original algorithm.
Description
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.
 
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 (pages 129-130).
 
Date issued
2018
URI
http://hdl.handle.net/1721.1/119726
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Publisher
Massachusetts Institute of Technology
Keywords
Electrical Engineering and Computer Science.

Collections
  • Graduate Theses

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.