2026-09-19T09:06:29Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/677712022-01-13T07:54:48Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Patrick Jaillet.
Cates, Jacob Roy
Massachusetts Institute of Technology. Operations Research Center.
Massachusetts Institute of Technology. Operations Research Center
Sloan School of Management
2011-12-19T18:49:22Z
2011-12-19T18:49:22Z
2011
2011
http://hdl.handle.net/1721.1/67771
767528290
Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2011.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 87).
As our technology continues to increase, our military wishes to reduce the risk service members endure by using unmanned vehicles. These unmanned vehicles will, over time, become more independent and trustworthy in our operational military. The goal of this thesis is to improve the intelligence an unmanned vehicle has in its decision making to keep up with ever increasing capabilities. In this thesis, we assume an Unmanned Underwater Vehicle (UUV) is given tasks and must decide which ones to perform (or not perform) in which order. If there is enough time and energy to perform all of the tasks, then the UUV only needs to solve a traveling salesman problem to find the best order. We focus on a tightly constrained situation, where the UUV must choose which tasks to perform to collect the highest reward. In prize collecting traveling salesman problems, authors are often dismissive about stochastic problem parameters, and are satisfied with using expected value of random variables. In this thesis a more rigorous probabilistic model is formulated which establishes a guaranteed confidence level for the probability the UUV breaks mission critical time and energy constraints. The formulation developed takes the stochasticity of the problem parameters into account and produces solutions which are robust. The thesis first presents a linear programming problem which calculates the transition probabilities for a specific route. This linear programming problem is then used to create a constraint which forces the UUV to choose a route that maintains an appropriate confidence level for satisfying the time and energy constraints. Once the exact model is created, heuristics are discussed and analyzed. The heuristics are designed to provide "good"' solutions for larger sized problems and maintain a relatively low run time.
by Jacob Roy Cates.
S.M.
87 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
Operations Research Center.
Route optimization under uncertainty for Unmanned Underwater Vehicles
Route optimization under uncertainty for UUVs
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="c8b6c41e-82b5-4846-8338-85a713d34d55">
<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>Route optimization under uncertainty for Unmanned Underwater Vehicles</Title>
<Subtitle>Route optimization under uncertainty for UUVs</Subtitle>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2011</PublicationDate>
<Authors>
<Author>
<DisplayName>Cates, Jacob Roy</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>Operations Research Center.</Keyword>
<Abstract>As our technology continues to increase, our military wishes to reduce the risk service members endure by using unmanned vehicles. These unmanned vehicles will, over time, become more independent and trustworthy in our operational military. The goal of this thesis is to improve the intelligence an unmanned vehicle has in its decision making to keep up with ever increasing capabilities. In this thesis, we assume an Unmanned Underwater Vehicle (UUV) is given tasks and must decide which ones to perform (or not perform) in which order. If there is enough time and energy to perform all of the tasks, then the UUV only needs to solve a traveling salesman problem to find the best order. We focus on a tightly constrained situation, where the UUV must choose which tasks to perform to collect the highest reward. In prize collecting traveling salesman problems, authors are often dismissive about stochastic problem parameters, and are satisfied with using expected value of random variables. In this thesis a more rigorous probabilistic model is formulated which establishes a guaranteed confidence level for the probability the UUV breaks mission critical time and energy constraints. The formulation developed takes the stochasticity of the problem parameters into account and produces solutions which are robust. The thesis first presents a linear programming problem which calculates the transition probabilities for a specific route. This linear programming problem is then used to create a constraint which forces the UUV to choose a route that maintains an appropriate confidence level for satisfying the time and energy constraints. Once the exact model is created, heuristics are discussed and analyzed. The heuristics are designed to provide "good"' solutions for larger sized problems and maintain a relatively low run time.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>