6 research outputs found
Hierarchical Annotated Skeleton-Guided Tree-based Motion Planning
We present a hierarchical tree-based motion planning strategy, HAS-RRT,
guided by the workspace skeleton to solve motion planning problems in robotics
and computational biology. Relying on the information about the connectivity of
the workspace and the ranking of available paths in the workspace, the strategy
prioritizes paths indicated by the workspace guidance to find a valid motion
plan for the moving object efficiently. In instances of suboptimal guidance,
the strategy adapts its reliance on the guidance by hierarchically reverting to
local exploration of the planning space. We offer an extensive comparative
analysis against other tree-based planning strategies and demonstrate that
HAS-RRT reliably and efficiently finds low-cost paths. In contrast to methods
prone to inconsistent performance across different environments or reliance on
specific parameters, HAS-RRT is robust to workspace variability
Topology-Guided Roadmap Construction With Dynamic Region Sampling
Many types of planning problems require discovery of multiple pathways through the environment, such as multi-robot coordination or protein ligand binding. The Probabilistic Roadmap (PRM) algorithm is a powerful tool for this case, but often cannot efficiently connect the roadmap in the presence of narrow passages. In this letter, we present a guidance mechanism that encourages the rapid construction of well-connected roadmaps with PRM methods. We leverage a topological skeleton of the workspace to track the algorithm\u27s progress in both covering and connecting distinct neighborhoods, and employ this information to focus computation on the uncovered and unconnected regions. We demonstrate how this guidance improves PRM\u27s efficiency in building a roadmap that can answer multiple queries in both robotics and protein ligand binding applications
Using robotics to fold proteins and dock ligands
The problems of protein folding and ligand docking have been explored largely using molecular dynamics or Monte Carlo methods. These methods are very compute intensive because they often explore a much wider range of energies, conformations and time than necessary. In addition, Monte Carlo methods often get trapped in local minima. We initially showed that robotic motion planning permitted one to determine the energy of binding and dissociation of ligands from protein binding sites (Singh et al., 1999). The robotic motion planning method maps complicated three-dimensional conformational states into amuch simpler, but higher dimensional space in which conformational rearrangements can be represented as linear paths. The dimensionality of the conformatio