Show simple item record

dc.contributor.advisorJames B. Orlin.en_US
dc.contributor.authorMiller, John V. (John Vaala)en_US
dc.contributor.otherMassachusetts Institute of Technology. Operations Research Center.en_US
dc.date.accessioned2008-02-27T22:18:58Z
dc.date.available2008-02-27T22:18:58Z
dc.date.copyright2007en_US
dc.date.issued2007en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/40388
dc.descriptionThesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2007.en_US
dc.descriptionIncludes bibliographical references (p. 129-134).en_US
dc.description.abstractWith recent advances in research and technology, autonomous surface vessel capabilities have steadily increased. These autonomous surface vessel technologies enable missions and tasks to be performed without the direction of human operators, and have changed the way scientists and engineers approach problems. Because these robotic devices can work without manned guidance, they can execute missions that are too difficult, dangerous, expensive, or tedious for human operators to attempt. The United States government is currently expanding the use of autonomous surface vessel technologies through the United States Navy's Spartan Scout unmanned surface vessel (USV) and NASA's Ocean-Atmosphere Sensor Integration System (OASIS) USV. These USVs are well-suited to complete monotonous, dangerous, and time-consuming missions. The USVs provide better performance, lower cost, and reduced risk to human life than manned systems. In this thesis, we explore how to plan multiple USV observation schedules for two significant notional observation scenarios, collecting water temperatures ahead of the path of a hurricane, and collecting fluorometer readings to observe and track a harmful algal bloom.en_US
dc.description.abstract(cont.) A control system must be in place that coordinates a fleet of USVs to targets in an efficient manner. We develop three algorithms to solve the unmanned surface vehicle observation-planning problem. A greedy construction heuristic runs fastest, but produces suboptimal plans; a 3-phase algorithm which combines a greedy construction heuristic with an improvement phase and an insertion phase, requires more execution time, but generates significantly better plans; an optimal mixed integer programming algorithm produces optimal plans, but can only solve small problem instances.en_US
dc.description.statementofresponsibilityby John V. Miller.en_US
dc.format.extent134 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/7582
dc.subjectOperations Research Center.en_US
dc.titleLarge-scale dynamic observation planning for unmanned surface vesselsen_US
dc.typeThesisen_US
dc.description.degreeS.M.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Operations Research Center
dc.contributor.departmentSloan School of Management
dc.identifier.oclc191222917en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record