2026-09-19T05:15:15Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/356182021-07-05T14:03:20Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022

Nicholas M. Patrikalakis. Yilmaz, Namik Kemal, 1975- Massachusetts Institute of Technology. Dept. of Mechanical Engineering. Massachusetts Institute of Technology. Department of Mechanical Engineering 2008-02-28T16:26:55Z 2008-02-28T16:26:55Z 2005 2006 http://hdl.handle.net/1721.1/35618 75966134 Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, February 2006. Includes bibliographical references (p. 235-244). This thesis develops new methods for path planning of Autonomous Underwater Vehicles for adaptive sampling. The problem is approached in an optimization framework and two methods are developed to solve it based on Mixed Integer Programming (MIP). The first method is predicated on network-flow ideas and is shown to have similarities to the Selective Traveling Salesman Problem. An important classification of the set of path-planning problems to be solved is the number of days that are involved in the complete sampling mission. Intrinsic limitations of the first network-flow-based method limit it to single day adaptive sampling missions. The second method emerged by taking into consideration the limitations of the first method and is based on a general MIP formulation. It is a more powerful formulation as it can handle multiple-day adaptive sampling missions, it is scalable as it can address the multiple vehicle case with ease, and it is more easily extensible to cover unforeseen situations that might arise as adaptive sampling concepts and needs evolve. The second formulation also allowed solution of auxiliary problems, required to determine suitable initial conditions for the main method. The method is applied to various test problems including evaluation of performance issues. (cont.) A real-world problem is also solved by the second method taking two different approaches. The first approach (static approach) involves a three-day-long adaptive sampling mission using the uncertainty information available on the first day. The second approach (dynamic approach) involves updating of the uncertainty information for each day using data assimilation features of the Harvard Ocean Prediction System and the Error Subspace Statistical Estimation system. The dynamic method is illustrative of how path planning for adaptive sampling fits into modern dynamic data driven oceanography. The results from the dynamic approach show that the uncertainty of the forecast decreases and becomes confined to a smaller region, indicating the strength of the method. by Namik Kemal Yilmaz. Ph.D. 244 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 Mechanical Engineering. Path planning of Autonomous Underwater Vehicles for adaptive sampling Path planning of AUVs for adaptive sampling Thesis application/pdf Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="bc54cbf5-f92f-4d96-ab07-b211ac65a6b0"> <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>Path planning of Autonomous Underwater Vehicles for adaptive sampling</Title> <Subtitle>Path planning of AUVs for adaptive sampling</Subtitle> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2006</PublicationDate> <Authors> <Author> <DisplayName>Yilmaz, Namik Kemal, 1975-</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>Mechanical Engineering.</Keyword> <Abstract>This thesis develops new methods for path planning of Autonomous Underwater Vehicles for adaptive sampling. The problem is approached in an optimization framework and two methods are developed to solve it based on Mixed Integer Programming (MIP). The first method is predicated on network-flow ideas and is shown to have similarities to the Selective Traveling Salesman Problem. An important classification of the set of path-planning problems to be solved is the number of days that are involved in the complete sampling mission. Intrinsic limitations of the first network-flow-based method limit it to single day adaptive sampling missions. The second method emerged by taking into consideration the limitations of the first method and is based on a general MIP formulation. It is a more powerful formulation as it can handle multiple-day adaptive sampling missions, it is scalable as it can address the multiple vehicle case with ease, and it is more easily extensible to cover unforeseen situations that might arise as adaptive sampling concepts and needs evolve. The second formulation also allowed solution of auxiliary problems, required to determine suitable initial conditions for the main method. The method is applied to various test problems including evaluation of performance issues.</Abstract> <Abstract>(cont.) A real-world problem is also solved by the second method taking two different approaches. The first approach (static approach) involves a three-day-long adaptive sampling mission using the uncertainty information available on the first day. The second approach (dynamic approach) involves updating of the uncertainty information for each day using data assimilation features of the Harvard Ocean Prediction System and the Error Subspace Statistical Estimation system. The dynamic method is illustrative of how path planning for adaptive sampling fits into modern dynamic data driven oceanography. The results from the dynamic approach show that the uncertainty of the forecast decreases and becomes confined to a smaller region, indicating the strength of the method.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>