Now showing items 1-5 of 5

    • BLIND RRT: A PROBABILISTICALLY COMPLETE, DISTRIBUTED RRT 

      Rodriguez Villanueva, Cesar Adolfo (2013-02-06)
      Rapidly-Exploring Random Trees (RRTs) have been successful at finding feasible solutions for high-dimensional problems. With motion planning becoming more computationally de- manding, we turn to parallel motion planning ...
    • Improving Decoy Databases for Protein Folding Algorithms 

      Lindsey, Aaron Paul (2013-09-24)
      Predicting protein structures and simulating protein folding motions are two of the most important problems in computational biology today. Modern folding simulation methods rely on a scoring function which attempts to ...
    • Medial-Axis Biased Rapidly-Exploring Random Trees 

      Greco, Evan (2012-05-09)
      RRTs (Rapidly-Exploring Random Trees) have shown wide applications in robotics. RRTs are a type of sampling-based motion planners that expand to fill the space starting from one or more root configurations. RRTs are excellent ...
    • Neural Network Approach to Feature Sensitive Motion Planning 

      Medina Vargas, Jose Andres (2013-09-26)
      Motion planning (MP) is the problem of finding a valid path (e.g., collision free) from a start to a goal state for a movable object. MP is a complex problem with a myriad of applications, ranging from robotics, to ...
    • Tools for User Modification of Optimal Roadmaps 

      Julian, Nicole Violet (2013-09-26)
      Robotic motion planning is a ubiquitous field of study, with innumerable applications in sci- ence, engineering, and beyond. At its core, however, motion planning is infeasible for many complex problems. Sampling-based ...