Bayesian Local Sampling-based Planning

2019-09-08 · Tin Lai, Philippe Morere, Fabio Ramos, Gilad Francis

Sampling-based planning is the predominant paradigm for motion planning in robotics. Most sampling-based planners use a global random sampling scheme to guarantee probabilistic completeness. However, most schemes are often inefficient as the samples drawn from the global proposal distribution, and do not exploit relevant local structures. Local sampling-based motion planners, on the other hand, take sequential decisions of random walks to samples valid trajectories in configuration space. However, current approaches do not adapt their strategies according to the success and failures of past samples. In this work, we introduce a local sampling-based motion planner with a Bayesian learning scheme for modelling an adaptive sampling proposal distribution. The proposal distribution is sequentially updated based on previous samples, consequently shaping it according to local obstacles and constraints in the configuration space. Thus, through learning from past observed outcomes, we maximise the likelihood of sampling in regions that have a higher probability to form trajectories within narrow passages. We provide the formulation of a sample-efficient distribution, along with theoretical foundation of sequentially updating this distribution. We demonstrate experimentally that by using a Bayesian proposal distribution, a solution is found faster, requiring fewer samples, and without any noticeable performance overhead.

📄 PDF Abstract BibTeX arXiv:1909.03452

Code (0)

등록된 구현이 없습니다.

Tasks

Motion Planningvalid

Better Optimism By Bayes: Adaptive Planning with Rich Models

2014-02-09 · Arthur Guez, David Silver, Peter Dayan

The computational costs of inference and planning have confined Bayesian model-based reinforcement learning to one of two dismal fates: powerful Bayes-adaptive planning but only for simplistic models, or powerful, Bayesi…

Model-based Reinforcement Learning Reinforcement Learning Reinforcement Learning (RL)Thompson Sampling

BOWConnect: Parallel Bayesian Optimization over Windows with Learned Local Cost Maps for Sample-Efficient Kinodynamic Motion Planning

2026-06-25 · Sourav Raxit, Abdullah Al Redwan Newaz, Jose Fuentes, Leonardo Bobadilla arxiv

This paper presents BOWConnect, a bidirectional parallel kinodynamic motion planner that addresses three fundamental limitations of existing sampling-based methods: sample inefficiency in high-dimensional state spaces, u…

Motion Planning

Multi-Robot Trajectory Planning via Constrained Bayesian Optimization and Local Cost Map Learning with STL-Based Conflict Resolution

2026-03-06 · Sourav Raxit, Abdullah Al Redwan Newaz, Jose Fuentes, Paulo Padrao 외 arxiv

We address multi-robot motion planning under Signal Temporal Logic (STL) specifications with kinodynamic constraints. Exact approaches face scalability bottlenecks and limited adaptability, while conventional sampling-ba…

Trajectory Planning Motion Planning

A Bayesian Approach to Online Planning

2024-06-04 · Nir Greshler, David Ben Eli, Carmel Rabinovitz, Gabi Guetta 외

The combination of Monte Carlo tree search and neural networks has revolutionized online planning. As neural network approximations are often imperfect, we ask whether uncertainty estimates about the network outputs coul…

Thompson Sampling Uncertainty Quantification

Bayesian Optimized Monte Carlo Planning

2020-10-07 · John Mern, Anil Yildiz, Zachary Sunberg, Tapan Mukerji 외

Online solvers for partially observable Markov decision processes have difficulty scaling to problems with large action spaces. Monte Carlo tree search with progressive widening attempts to improve scaling by sampling fr…

Bayesian Optimization