Article
 

Sampling-based robotic information gathering algorithms

Public Deposited

Downloadable Content

Download PDF
https://ir.library.oregonstate.edu/concern/articles/37720f628

Descriptions

Attribute NameValues
Creator
Abstract
  • We propose three sampling-based motion planning algorithms for generating informative mobile robot trajectories. The goal is to find a trajectory that maximizes an information quality metric (e.g. variance reduction, information gain, or mutual information) and also falls within a pre-specified budget constraint (e.g. fuel, energy, or time). Prior algorithms have employed combinatorial optimization techniques to solve these problems, but existing techniques are typically restricted to discrete domains and often scale poorly in the size of the problem. Our proposed rapidly exploring information gathering (RIG) algorithms combine ideas from sampling-based motion planning with branch and bound techniques to achieve efficient information gathering in continuous space with motion constraints. We provide analysis of the asymptotic optimality of our algorithms, and we present several conservative pruning strategies for modular, submodular, and time-varying information objectives. We demonstrate that our proposed techniques find optimal solutions more quickly than existing combinatorial solvers, and we provide a proof-of-concept field implementation on an autonomous surface vehicle performing a wireless signal strength monitoring task in a lake.
  • Keywords: Motion and path planning, Field robotics, Robotic information gathering
Resource Type
DOI
Date Available
Date Issued
Citation
  • Hollinger, G. A., & Sukhatme, G. S. (2014). Sampling-based robotic information gathering algorithms. The International Journal of Robotics Research, 33(9), 1271-1287. doi:10.1177/0278364914533443
Journal Title
Journal Volume
  • 33
Journal Issue/Number
  • 9
Rights Statement
Funding Statement (additional comments about funding)
  • This research has been funded in part by the O ce of Naval Research [grant numbers N00014-09-1-0700, N00014-07-1-00738, N00014-06-10043]; and the National Science Foundation [grant numbers CCR-0120778, CNS-1035866, IIS-1317815].
Publisher
Peer Reviewed
Language
Replaces

Relationships

Parents:

This work has no parents.

Items