Now showing items 1-10 of 10

    • 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 ...
    • Li, Qingqing (2017-05-10)
      Motion planning is the problem of finding a valid path for a moveable object from a start to a goal state. Current state-of-the-art sampling based planners are able to solve a variety of problems. Sometimes, it is difficult ...
    • Burgos, Juan Luis (2013-04-13)
      Motion planning is the problem of computing valid paths through an environment. Since computing exact solutions is intractable, sampling-based algorithms, such as Probabilistic RoadMaps (PRMs), have gained popularity. PRMs ...
    • 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 ...
    • Yang, Everett Siyan
      This project focuses on planning the motion for high degree of freedom manipulator robots under dynamic (or temporal) constraints. Manipulator robots are widely used in industry and are important because they can do jobs ...
    • 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 ...
    • VanToorn, Darek (1997)
      Automation of the design and manufacturing process of complex mechanical systems could save countless man-hours and reduce costs. The development of practical motion planning algorithms could aid this automation by increasing ...
    • 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 ...
    • Denny, Jory 1991- (2011-04-14)
      Motion planning for robotic applications is difficult. This is a widely studied problem in which the best known deterministic solution is doubly exponential in the dimensionality of the problem. A class of probabilistic ...
    • 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 ...