Comparison of Constrained Geometric Approximation Strategies for Planar Information States

Yang Song, Jason M. O'Kane
In Proc. IEEE International Conference on Robotics and Automation 2012.

Abstract

This paper describes and analyzes a new technique for reasoning about uncertainty called \emph{constrained geometric approximation} (CGA). We build upon recent work that has developed methods to explicitly represent a robot's knowledge as an element, called an information state, in an appropriately defined information space. The intuition of our new approach is to constrain the I-state to remain in a structured subset of the I-space, and to enforce that constraint using appropriate overapproximation methods. The result is a collection of algorithms that enable mobile robots with extreme limitations in both sensing and computation to maintain simple but provably meaningful representations of the incomplete information available to them. We present a simulated implementation of this technique for a sensor-based navigation task, along with experimental results for this task showing that CGA, compared to a high-fidelity representation of the un-approximated I-state, achieves a similar success rate at a small fraction of the computational cost.

BibTeX

@inproceedings{SonOKa12,
author       = {Yang Song and Jason M. O'Kane},
title        = {Comparison of Constrained Geometric Approximation
Strategies for Planar Information States},
booktitle    = {Proc. IEEE International Conference on Robotics and
Automation},
year	       = {2012}
}



Thu Apr 12 13:56:08 EDT 2018