ICRA 2011 Paper Abstract


Paper WeA107.4

Akce, Abdullah (University of Illinois at Urbana-Champaign), Bretl, Timothy (University of Illinois at Urbana-Champaign)

A Compact Representation of Locally-Shortest Paths and Its Application to a Human-Robot Interface

Scheduled for presentation during the Regular Sessions "Biologically-Inspired Robots IV" (WeA107), Wednesday, May 11, 2011, 09:05−09:20, Room 5B

2011 IEEE International Conference on Robotics and Automation, May 9-13, 2011, Shanghai International Conference Center, Shanghai, China

This information is tentative and subject to change. Compiled on July 14, 2020

Keywords Brain Machine Interface, Motion and Path Planning


The space of all possible paths through a finite-dimensional configuration space is infinite-dimensional. Nevertheless, paths taken by “real” robotic systems often cluster on a finite-dimensional manifold that is embedded in this infinite-dimensional space and that is governed by a principle of optimality. We take advantage of this property to enable a human user to efficiently specify a desired path for a robot moving through a planar workspace with polygonal obstacles using a sequence of noisy binary inputs, as might be derived from a brain-machine interface. First, we show that the space of all such paths having length that is bounded and locally minimal is homeomorphic to the unit disk. Second, we note that any path mapped to the interior of this disk is a subset of some other path mapped to its boundary. Third, we provide an optimal communication protocol by which the user can, with vanishing error probability, select a point on this boundary. Finally, we validate our approach in preliminary experiments with human subjects.



Technical Content © IEEE Robotics & Automation Society

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2020 PaperCept, Inc.
Page generated 2020-07-14  16:48:46 PST  Terms of use