2026-09-19T08:49:54Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/323402021-07-05T14:03:20Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
John N. Tsitsiklis.
Hickman, Randal E
Massachusetts Institute of Technology. Operations Research Center
Sloan School of Management
2006-03-29T18:35:41Z
2006-03-29T18:35:41Z
2005
2005
http://hdl.handle.net/1721.1/32340
61463356
Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2005.
Includes bibliographical references (p. 144-146).
Autonomous vehicles often operate in environments with imperfect information. This thesis addresses the case of a system of autonomous vehicles and sensors attempting to intercept a moving object of interest that arrives stochastically and moves stochastically after arrival. A sensor array is placed in the area of expected arrivals. As the object of interest moves across the sensor system, the system initially receives perfect information of the object's movements. After the object of interest leaves the sensor system, the algorithm uses statistical estimation techniques to develop confidence intervals about points of expected interception. The algorithm assigns the optimal, autonomous chase vehicle from a set of pre-positioned autonomous vehicles, develops movement commands for the assigned vehicle, and considers reassignment of chase vehicles as appropriate given the stochastic movements of the object of interest. Dynamic programming is employed to optimize system parameters, and the thesis considers a reformulation of the problem that uses dynamic programming as a structural model for the entire algorithm.
by Randal E. Hickman.
S.M.
146 p.
8115890 bytes
8123533 bytes
application/pdf
application/pdf
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.
Interception algorithm for autonomous vehicles with imperfect information
Thesis
application/pdf
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="a29af775-9dfd-4970-84c9-aab276937b26">
<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>Interception algorithm for autonomous vehicles with imperfect information</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2005</PublicationDate>
<Authors>
<Author>
<DisplayName>Hickman, Randal E</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>Autonomous vehicles often operate in environments with imperfect information. This thesis addresses the case of a system of autonomous vehicles and sensors attempting to intercept a moving object of interest that arrives stochastically and moves stochastically after arrival. A sensor array is placed in the area of expected arrivals. As the object of interest moves across the sensor system, the system initially receives perfect information of the object's movements. After the object of interest leaves the sensor system, the algorithm uses statistical estimation techniques to develop confidence intervals about points of expected interception. The algorithm assigns the optimal, autonomous chase vehicle from a set of pre-positioned autonomous vehicles, develops movement commands for the assigned vehicle, and considers reassignment of chase vehicles as appropriate given the stochastic movements of the object of interest. Dynamic programming is employed to optimize system parameters, and the thesis considers a reformulation of the problem that uses dynamic programming as a structural model for the entire algorithm.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>