Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Libraries
  3. MIT Theses
  4. Graduate Theses
  5. Interception algorithm for autonomous vehicles with imperfect information

Interception algorithm for autonomous vehicles with imperfect information

Thumbnail Image
Download
Name

61463356-MIT.pdf

Description
Full printable version
Size

7.75 MB

Format

Adobe PDF

Checksum (MD5)

cb08481b082175c0a5ece7fbe7aa0e11

Author(s)
Hickman, Randal E
Advisor(s)
John N. Tsitsiklis.
Date Issued
2005
Publisher
Massachusetts Institute of Technology
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.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2005.
Includes bibliographical references (p. 144-146).
Subjects
Operations Research Center.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Sloan School of Management
Terms of Use
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
Persistent DSpace Link
http://hdl.handle.net/1721.1/32340
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.