DeepAI AI Chat
Log In Sign Up

Learning Continuous Cost-to-Go Functions for Non-holonomic Systems

by   Jinwook Huh, et al.

This paper presents a supervised learning method to generate continuous cost-to-go functions of non-holonomic systems directly from the workspace description. Supervision from informative examples reduces training time and improves network performance. The manifold representing the optimal trajectories of a non-holonomic system has high-curvature regions which can not be efficiently captured with uniform sampling. To address this challenge, we present an adaptive sampling method which makes use of sampling-based planners along with local, closed-form solutions to generate training samples. The cost-to-go function over a specific workspace is represented as a neural network whose weights are generated by a second, higher order network. The networks are trained in an end-to-end fashion. In our previous work, this architecture was shown to successfully learn to generate the cost-to-go functions of holonomic systems using uniform sampling. In this work, we show that uniform sampling fails for non-holonomic systems. However, with the proposed adaptive sampling methodology, our network can generate near-optimal trajectories for non-holonomic systems while avoiding obstacles. Experiments show that our method is two orders of magnitude faster compared to traditional approaches in cluttered environments.


page 1

page 3

page 4

page 5

page 6


Cost-to-Go Function Generating Networks for High Dimensional Motion Planning

This paper presents c2g-HOF networks which learn to generate cost-to-go ...

Learning to Generate Cost-to-Go Functions for Efficient Motion Planning

Traditional motion planning is computationally burdensome for practical ...

A simple algorithm for uniform sampling on the surface of a hypersphere

We propose a simple method for uniform sampling of points on the surface...

qRRT: Quality-Biased Incremental RRT for Optimal Motion Planning in Non-Holonomic Systems

This paper presents a sampling-based method for optimal motion planning ...

Adaptive Sampling for Convex Regression

In this paper, we introduce the first principled adaptive-sampling proce...

ProDMPs: A Unified Perspective on Dynamic and Probabilistic Movement Primitives

Movement Primitives (MPs) are a well-known concept to represent and gene...

Adaptive Path Sampling in Metastable Posterior Distributions

The normalizing constant plays an important role in Bayesian computation...