Information-rich Path Planning Under General Constraints Using Rapidly-exploring Random Trees
Author: Daniel S. Levine (Ph. D.)
Publisher:
Published: 2010
Total Pages: 104
ISBN-13:
DOWNLOAD EBOOKThis 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.