Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Libraries
  3. MIT Theses
  4. Graduate Theses
  5. Information-rich path planning under general constraints using Rapidly-exploring Random Trees

Information-rich path planning under general constraints using Rapidly-exploring Random Trees

Thumbnail Image
Download
Name

668232182-MIT.pdf

Description
Full printable version
Size

9.14 MB

Format

Adobe PDF

Checksum (MD5)

c16dc9905362620dd2775aea8e6ca074

Author(s)
Levine, Daniel S., Ph. D. Massachusetts Institute of Technology.
Advisor(s)
Jonathan P. How.
Date Issued
2010
Publisher
Massachusetts Institute of Technology
Abstract
This thesis introduces the Information-rich Rapidly-exploring Random Tree (IRRT), an extension of the RRT algorithm that embeds information collection as predicted using Fisher information matrices. The primary contribution of this trajectory generation algorithm is target-based information maximization in general (possibly heavily constrained) environments, with complex vehicle dynamic constraints and sensor limitations, including limited resolution and narrow field-of-view. Extensions of IRRT both for decentralized, multiagent missions and for information-rich planning with multimodal distributions are presented. IRRT is distinguished from previous solution strategies by its computational tractability and general constraint characterization. A progression of simulation results demonstrates that this implementation can generate complex target-tracking behaviors from a simple model of the trade-off between information gathering and goal arrival.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2010.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 99-104).
Subjects
Aeronautics and Astronautics.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
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/59684
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.