Sampling-based motion planning: A comparative review
Sampling-based motion planning is one of the fundamental paradigms to generate robot
motions, and a cornerstone of robotics research. This comparative review provides an up-to …
motions, and a cornerstone of robotics research. This comparative review provides an up-to …
Sampling-based robot motion planning: A review
M Elbanhawi, M Simic - Ieee access, 2014 - ieeexplore.ieee.org
Motion planning is a fundamental research area in robotics. Sampling-based methods offer
an efficient solution for what is otherwise a rather challenging dilemma of path planning …
an efficient solution for what is otherwise a rather challenging dilemma of path planning …
Prm-rl: Long-range robotic navigation tasks by combining reinforcement learning and sampling-based planning
We present PRM-RL, a hierarchical method for long-range navigation task completion that
combines sampling-based path planning with reinforcement learning (RL). The RL agents …
combines sampling-based path planning with reinforcement learning (RL). The RL agents …
Long-range indoor navigation with PRM-RL
Long-range indoor navigation requires guiding robots with noisy sensors and controls
through cluttered environments along paths that span a variety of buildings. We achieve this …
through cluttered environments along paths that span a variety of buildings. We achieve this …
Large-Scale Conformational Changes and Protein Function: Breaking the in silico Barrier
L Orellana - Frontiers in molecular biosciences, 2019 - frontiersin.org
Large-scale conformational changes are essential to link protein structures with their
function at the cell and organism scale, but have been elusive both experimentally and …
function at the cell and organism scale, but have been elusive both experimentally and …
A survey on path planning algorithms for mobile robots
MM Costa, MF Silva - 2019 IEEE International Conference on …, 2019 - ieeexplore.ieee.org
The use of mobile robots is growing every day. Path planning algorithms are needed to
allow the coordination of several robots, and make them travel with the least cost and …
allow the coordination of several robots, and make them travel with the least cost and …
Accelerating motion planning via optimal transport
AT Le, G Chalvatzaki, A Biess… - Advances in Neural …, 2024 - proceedings.neurips.cc
Motion planning is still an open problem for many disciplines, eg, robotics, autonomous
driving, due to their need for high computational resources that hinder real-time, efficient …
driving, due to their need for high computational resources that hinder real-time, efficient …
Balancing global exploration and local-connectivity exploitation with rapidly-exploring random disjointed-trees
Sampling efficiency in a highly constrained environment has long been a major challenge
for sampling-based planners. In this work, we propose Rapidly-exploring Random disjointed …
for sampling-based planners. In this work, we propose Rapidly-exploring Random disjointed …
Balancing exploration and exploitation in sampling-based motion planning
We present the exploring/exploiting tree (EET) algorithm for motion planning. The EET
planner deliberately trades probabilistic completeness for computational efficiency. This …
planner deliberately trades probabilistic completeness for computational efficiency. This …
Bayesian local sampling-based planning
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 …
sampling-based planners use a global random sampling scheme to guarantee probabilistic …