Guaranteed Rejection-free Sampling Method Using Past Behaviours for Motion Planning of Autonomous Systems
Thomas T. Enevoldsen, Roberto Galeazzi
TL;DR
The paper addresses motion planning for autonomous systems under changing obstacle configurations by leveraging past trajectories to inform sampling. It introduces a kernel density estimation framework with a finite-support kernel and bandwidth-driven obstacle inflation to produce a non-parametric description of the free space, guaranteeing that samples remain inside the originally defined feasible region. The method supports both biased and approximately uniform sampling around historical data, with rejection-free guarantees by construction. Two real-world case studies, involving a 2D autonomous surface vessel and a 3D drone, along with Monte Carlo simulations, demonstrate improved planning efficiency and lower-cost solutions, while highlighting the approach's dependence on representative historical data.
Abstract
The paper presents a novel learning-based sampling strategy that guarantees rejection-free sampling of the free space under both biased and approximately uniform conditions, leveraging multivariate kernel densities. Historical data from a given autonomous system is leveraged to estimate a non-parametric probabilistic description of the domain, which also describes the free space where feasible solutions of the motion planning problem are likely to be found. The tuning parameters of the kernel density estimator, the bandwidth and the kernel, are used to alter the description of the free space so that no samples can fall outside the originally defined space.The proposed method is demonstrated in two real-life case studies: An autonomous surface vessel (2D) and an autonomous drone (3D). Two planning problems are solved, showing that the proposed approximately uniform sampling scheme is capable of guaranteeing rejection-free samples of the considered workspace. Furthermore, the effectiveness of the proposed method is statistically validated using Monte Carlo simulations.
