ICRA 2011 Paper Abstract


Paper WeP209.2

Li, Yanbo (University of Nevada at Reno), Bekris, Kostas E. (University of Nevada, Reno)

Learning Approximate Cost-To-Go Metrics to Improve Sampling-Based Motion Planning

Scheduled for presentation during the Regular Sessions "Motion and Path Planning IV" (WeP209), Wednesday, May 11, 2011, 15:40−15:55, Room 5D

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 Motion and Path Planning, Nonholonomic Motion Planning


Sampling-based planners have been shown to be effective in searching unexplored parts of a system's state space. Their desirable properties, however, depend on the availability of an appropriate metric, which is often difficult to be defined for some robots, such as non-holonomic and under-actuated ones. This paper investigates a methodology to approximate optimum cost-to-go metrics by employing an offline learning phase in an obstacle-free workspace. The proposed method densely samples a graph that approximates the connectivity properties of the state space. This graph can be used online to compute approximate distances between states using nearest neighbor queries and standard graph search algorithms, such as A*. Unfortunately, this process significantly increases the online cost of a sampling-based planner. This work then investigates ways for the computationally efficient utilization of the learned metric during the planner's online operation. One idea is to map the sampled states into a higher-dimensional Euclidean space through multi-dimensional scaling that retains the relative distances represented by the sampled graph. Simulations on a first-order car and on an illustrative example of an asymmetric state space indicate that the approach has merit and can lead into more effective planning.



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  15:11:18 PST  Terms of use