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 …
Motion planning with temporal-logic specifications: Progress and challenges
Integrating task and motion planning is becoming increasingly important due to the
recognition that a growing number of robotics applications in navigation, search-and-rescue …
recognition that a growing number of robotics applications in navigation, search-and-rescue …
Motion planning algorithms for molecular simulations: A survey
Motion planning is a fundamental problem in robotics that has motivated research since
more than three decades ago. A large variety of algorithms have been proposed to compute …
more than three decades ago. A large variety of algorithms have been proposed to compute …
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 …
Resolution independent density estimation for motion planning in high-dimensional spaces
This paper presents a new motion planner, Search Tree with Resolution Independent
Density Estimation (STRIDE), designed for rapid exploration and path planning in high …
Density Estimation (STRIDE), designed for rapid exploration and path planning in high …
Region-guided and sampling-based tree search for motion planning with dynamics
E Plaku - IEEE Transactions on Robotics, 2015 - ieeexplore.ieee.org
This paper presents a motion planner, termed Guided Sampling Tree (GUST), geared
toward mobile robots with nonlinear dynamics and nonholonomic constraints operating in …
toward mobile robots with nonlinear dynamics and nonholonomic constraints operating in …
Structure-guided protein transition modeling with a probabilistic roadmap algorithm
Proteins are macromolecules in perpetual motion, switching between structural states to
modulate their function. A detailed characterization of the precise yet complex relationship …
modulate their function. A detailed characterization of the precise yet complex relationship …
A connectivity-based method for enhancing sampling in probabilistic roadmap planners
MT Rantanen - Journal of Intelligent & Robotic Systems, 2011 - Springer
The motion planning is a difficult problem but nevertheless, a crucial part of robotics. The
probabilistic roadmap planners have shown to be an efficient way to solve these planning …
probabilistic roadmap planners have shown to be an efficient way to solve these planning …
Sample-based models of protein energy landscapes and slow structural rearrangements
T Maximova, Z Zhang, DB Carr, E Plaku… - Journal of …, 2018 - liebertpub.com
Proteins often undergo slow structural rearrangements that involve several angstroms and
surpass the nanosecond timescale. These spatiotemporal scales challenge physics-based …
surpass the nanosecond timescale. These spatiotemporal scales challenge physics-based …
A general, adaptive, roadmap-based algorithm for protein motion computation
Precious information on protein function can be extracted from a detailed characterization of
protein equilibrium dynamics. This remains elusive in wet and dry laboratories, as function …
protein equilibrium dynamics. This remains elusive in wet and dry laboratories, as function …