ICRA 2012 Paper Abstract

Close

Paper WeA08.4

Song, Yang (University of South Carolina), O'Kane, Jason (University of South Carolina)

Comparison of Constrained Geometric Approximation Strategies for Planar Information States

Scheduled for presentation during the Regular Session "Motion Path Planning I" (WeA08), Wednesday, May 16, 2012, 09:15−09:30, Meeting Room 8 (Wacipi)

2012 IEEE International Conference on Robotics and Automation, May 14-18, 2012, RiverCentre, Saint Paul, Minnesota, USA

This information is tentative and subject to change. Compiled on December 17, 2017

Keywords Motion and Path Planning, Reactive and Sensor-Based Planning, Planning, Scheduling and Coordination

Abstract

This paper describes and analyzes a new technique for reasoning about uncertainty called 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.

 

 

Technical Content © IEEE Robotics & Automation Society

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2017 PaperCept, Inc.
Page generated 2017-12-17  01:44:35 PST  Terms of use