Information-rich Path Planning with General Constraints using Rapidly-exploring Random Trees
This paper 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 algorithm is target-based information maximization in general (pos...
Main Authors: | Levine, Daniel S., Luders, Brandon Douglas, How, Jonathan P. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Aerospace Controls Laboratory |
Format: | Article |
Language: | en_US |
Published: |
American Institute of Aeronautics and Astronautics
2010
|
Online Access: | http://hdl.handle.net/1721.1/60027 https://orcid.org/0000-0001-8576-1930 |
Similar Items
-
Information-rich path planning under general constraints using Rapidly-exploring Random Trees
by: Levine, Daniel S., Ph. D. Massachusetts Institute of Technology.
Published: (2010) -
Bounds on tracking error using closed-loop rapidly-exploring random trees
by: Luders, Brandon Douglas, et al.
Published: (2010) -
Robotic path planning using rapidly-exploring random trees
by: Sherwani, Fahad
Published: (2013) -
Threat-aware Path Planning in Uncertain Urban Environments
by: Aoude, Georges, et al.
Published: (2011) -
Information-rich Task Allocation and Motion Planning for Heterogeneous Sensor Platforms
by: Luders, Brandon Douglas, et al.
Published: (2018)