DeepAI AI Chat
Log In Sign Up

Non-Trivial Query Sampling For Efficient Learning To Plan

by   Sagar Suhas Joshi, et al.

In recent years, learning-based approaches have revolutionized motion planning. The data generation process for these methods involves caching a large number of high quality paths for different queries (start, goal pairs) in various environments. Conventionally, a uniform random strategy is used for sampling these queries. However, this leads to inclusion of "trivial paths" in the dataset (e.g.,, straight line paths in case of length-optimal planning), which can be solved efficiently if the planner has access to a steering function. This work proposes a "non-trivial" query sampling procedure to add more complex paths in the dataset. Numerical experiments show that a higher success rate can be attained for neural planners trained on such a non-trivial dataset.


Interactive Query Formulation using Query By Navigation

Effective information disclosure in the context of databases with a larg...

Guided Incremental Local Densification for Accelerated Sampling-based Motion Planning

Sampling-based motion planners rely on incremental densification to disc...

Learning Sampling Dictionaries for Efficient and Generalizable Robot Motion Planning with Transformers

Motion planning is integral to robotics applications such as autonomous ...

Data-Efficient Learning of High-Quality Controls for Kinodynamic Planning used in Vehicular Navigation

This paper aims to improve the path quality and computational efficiency...

Hierarchical Annotated Skeleton-Guided Tree-based Motion Planning

We present a hierarchical tree-based motion planning strategy, HAS-RRT, ...

On sampling from data with duplicate records

Data deduplication is the task of detecting records in a database that c...

Custom Distribution for Sampling-Based Motion Planning

Sampling-based algorithms are widely used in robotics because they are v...