Articles with "rejection sampling" as a keyword



A New Adaptive Rejection Sampling Method Using Kernel Density Approximations and Its Application to Subset Simulation

Sign Up to like & get
recommendations!
Published in 2017 at "ASCE-ASME Journal of Risk and Uncertainty in Engineering Systems, Part A: Civil Engineering"

DOI: 10.1061/ajrua6.0000841

Abstract: AbstractIn stochastic analysis of engineering systems, the task of generating samples according to a target probability distribution involving some performance function of the system response often arises. This paper introduces an adaptive method for rejection… read more here.

Keywords: adaptive rejection; rejection sampling; method; density ... See more keywords

Modifications to Swisdak (2013)'s rejection sampling algorithm for a Maxwell–Jüttner distribution in particle simulations

Sign Up to like & get
recommendations!
Published in 2024 at "Physics of Plasmas"

DOI: 10.1063/5.0226859

Abstract: Modifications to Swisdak's [Phys. Plasmas 20, 062110 (2013)] rejection sampling algorithm for drawing a Maxwell–Jüttner distribution in particle simulations are presented. Handy approximations for e-folding points and a linear slope in the envelope function are… read more here.

Keywords: sampling algorithm; rejection sampling; maxwell ttner; ttner distribution ... See more keywords

FasterGICP: Acceptance-Rejection Sampling Based 3D Lidar Odometry

Sign Up to like & get
recommendations!
Published in 2022 at "IEEE Robotics and Automation Letters"

DOI: 10.1109/lra.2021.3124072

Abstract: Distribution-to-distribution-based lidar odometry is known for its good accuracy, while it cannot run in real-time when the number of points is large. To alleviate this problem, Faster Generalized Iterative Closest Point (FasterGICP) is proposed in… read more here.

Keywords: acceptance rejection; rejection sampling; lidar odometry; odometry ... See more keywords

Acceptance–Rejection Sampling-Guided Discrete RRT for Multiagent Path Finding

Sign Up to like & get
recommendations!
Published in 2025 at "IEEE Transactions on Industrial Informatics"

DOI: 10.1109/tii.2025.3609137

Abstract: Discrete rapid-exploring random tree (dRRT) methods have been proposed but remain to be improved, showing great potential for efficiently solving multiagent path finding (MAPF) problems. This article proposes a new dRRT algorithm designed to tackle… read more here.

Keywords: path finding; multiagent path; acceptance rejection; rejection sampling ... See more keywords