Show simple item record

dc.contributor.advisorFranz S. Hover.en_US
dc.contributor.authorEnglot, Brendan Jen_US
dc.contributor.otherMassachusetts Institute of Technology. Dept. of Mechanical Engineering.en_US
dc.date.accessioned2013-03-28T18:16:54Z
dc.date.available2013-03-28T18:16:54Z
dc.date.copyright2012en_US
dc.date.issued2012en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/78209
dc.descriptionThesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2012.en_US
dc.descriptionThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.en_US
dc.descriptionCataloged from student-submitted PDF version of thesis.en_US
dc.descriptionIncludes bibliographical references (p. 173-186).en_US
dc.description.abstractPath planning is an essential capability for autonomous robots, and many applications impose challenging constraints alongside the standard requirement of obstacle avoidance. Coverage planning is one such task, in which a single robot must sweep its end effector over the entirety of a known workspace. For two-dimensional environments, optimal algorithms are documented and well-understood. For threedimensional structures, however, few of the available heuristics succeed over occluded regions and low-clearance areas. This thesis makes several contributions to sampling-based coverage path planning, for use on complex three-dimensional structures. First, we introduce a new algorithm for planning feasible coverage paths. It is more computationally efficient in problems of complex geometry than the well-known dual sampling method, especially when high-quality solutions are desired. Second, we present an improvement procedure that iteratively shortens and smooths a feasible coverage path; robot configurations are adjusted without violating any coverage constraints. Third, we propose a modular algorithm that allows the simple components of a structure to be covered using planar, back-and-forth sweep paths. An analysis of probabilistic completeness, the first of its kind applied to coverage planning, accompanies each of these algorithms, as well as ensemble computational results. The motivating application throughout this work has been autonomous, in-water ship hull inspection. Shafts, propellers, and control surfaces protrude from a ship hull and pose a challenging coverage problem at the stern. Deployment of a sonar-equipped underwater robot on six large vessels has led to robust operations that yield triangle mesh models of these structures; these models form the basis for planning inspections at close range. We give results from a coverage plan executed at the stern of a US Coast Guard Cutter, and results are also presented from an indoor experiment using a precision scanning laser and gantry positioning system.en_US
dc.description.statementofresponsibilityby Brendan J. Englot.en_US
dc.format.extent186 p.en_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.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.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582en_US
dc.subjectMechanical Engineering.en_US
dc.titleSampling-based coverage path planning for complex 3D structuresen_US
dc.typeThesisen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mechanical Engineering
dc.identifier.oclc829699625en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record