Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 41 for “"Sampling-based motion planning"”.

  1. Metrics for sampling-based motion planning

    A motion planner finds a sequence of potential motions for a robot to transit from an initial to a goal state. To deal with the intractability of this problem, a class of methods known as sampling-based planners build approximate representations of potential motions through random sampling. This …

    tamu Repository record for Metrics for sampling-based motion planning (opens in a new tab)

  2. Sampling Based Motion Planning with Reachable Volumes

    Motion planning for constrained systems is a version of the motion planning problem in which the motion of a robot is limited by constraints. For example, one can require that a humanoid robot such as a PR2 remain upright by constraining its torso to be above its base or require that an object such …

    tamu Repository record for Sampling Based Motion Planning with Reachable Volumes (opens in a new tab)

  3. Sampling-Based Motion Planning With Differential Constraints

    … of robotic systems are ignored in path planning, solutions for kinodynamic and non-holonomic planning problems from classical methods could be either inexecutable or inefficient. Motion planning with differential constraints (MPD), which directly considers differential constraints, …

    uiuc Repository record for Sampling-Based Motion Planning With Differential Constraints (opens in a new tab)

  4. Improved Sampling Based Motion Planning Through Local Learning

    Every motion made by a moving object is either planned implicitly, e.g., human natural movement from one point to another, or explicitly, e.g., pre-planned information about where a robot should move in a room to effectively avoid colliding with obstacles. Motion planning is a well-studied concept …

    tamu Repository record for Improved Sampling Based Motion Planning Through Local Learning (opens in a new tab)

  5. Using Statistical Tools to Improve Sampling-based Motion Planning

    Motion planning for systems with challenging constraints is receiving increasing interest in robotics over the last couple of decades. This work focuses on improving performance of sampling-based algorithms, a dominant family of algorithms proposed in late 1990's, which can deal with …

    unr Repository record for Using Statistical Tools to Improve Sampling-based Motion Planning (opens in a new tab)

  6. A Framework For Parallelizing Sampling-Based Motion Planning Algorithms

    Motion planning is the problem of finding a valid path for a robot from a start position to a goal position. It has many uses such as protein folding and animation. However, motion planning can be slow and take a long time in difficult environments. Parallelization can be used to speed up this …

    tamu Repository record for A Framework For Parallelizing Sampling-Based Motion Planning Algorithms (opens in a new tab)

  7. Adaptive sampling-based motion planning with control barrier functions

    In this thesis we modified a sampling-based motion planning algorithm to improve sampling efficiency. First, we modify the RRT* motion planning algorithm with a local motion planner that guarantees collision-free state trajectories without explicitly checking for collision with obstacles. The …

    bu Repository record for Adaptive sampling-based motion planning with control barrier functions (opens in a new tab)

  8. A Scalable Framework for Parallelizing Sampling-Based Motion Planning Algorithms

    Motion planning is defined as the problem of finding a valid path taking a robot (or any movable object) from a given start configuration to a goal configuration in an environment. While motion planning has its roots in robotics, it now finds application in many other areas of scientific computing …

    tamu Repository record for A Scalable Framework for Parallelizing Sampling-Based Motion Planning Algorithms (opens in a new tab)

  9. Tighter Bidirectional Heuristic Search and Lazy Optimal Sampling-Based Motion Planning

    … spaces using heuristic estimates to support planning and decision-making. In robotics, motion planning is a fundamental problem of computing feasible robot motion under constraints. A central challenge shared by both domains is how to substantially reduce unnecessary computation while …

    unh-thes Repository record for Tighter Bidirectional Heuristic Search and Lazy Optimal Sampling-Based Motion Planning (opens in a new tab)

  10. Sampling Based Motion PLanning for Minimizing Position Uncertainty with Stewart Platforms

    … dissertation provides a unique approach to error based motion planning. Originally designed specifically for use on a parallel robot,these methods can be extended to a more general case of any well-defined robotic platforms. Requirements for application of these methods are a known method of …

    maryland Repository record for Sampling Based Motion PLanning for Minimizing Position Uncertainty with Stewart Platforms (opens in a new tab)

  11. Time-optimal sampling-based motion planning for manipulators with acceleration limits

    … can change their velocity. The more accurately planning algorithms consider these limitations, the better the robot is able to perform. Sampling-based algorithms have been successful in geometric domains, which ignore actuator limitations. They are simple, parameter-free, probabilistically …

    gatech Repository record for Time-optimal sampling-based motion planning for manipulators with acceleration limits (opens in a new tab)

  12. Leveraging Adversarial Machine Learning Techniques for Deceptive Sampling-Based Motion Planning

    … learning. Presented in this thesis is a novel planning algorithm, dubbed Adversarial RRT*. Adversarial RRT* attempts to deceive machine learning classifiers by incorporating a predicted measure of deception into the planner cost function. Adversarial RRT* considers both path cost and a measure …

    gatech Repository record for Leveraging Adversarial Machine Learning Techniques for Deceptive Sampling-Based Motion Planning (opens in a new tab)

  13. Uniform Sampling Framework for Sampling Based Motion Planning and Its Applications to Robotics and Protein Ligand Binding

    Sampling-based motion planning aims to find a valid path from a start to a goal by sampling in the planning space. Planning on surfaces is an important problem in many research problems, including traditional robotics and computational biology. It is also a difficult research question to plan on …

    tamu Repository record for Uniform Sampling Framework for Sampling Based Motion Planning and Its Applications to Robotics and Protein Ligand Binding (opens in a new tab)

  14. A Unifying Framework for Constrained Sampling-Based Planning

    … disaster relief or spacecraft logistics. Finding motions for these systems autonomously is necessary if they are to be applied in unstructured environments not known a priori, as they must compute motions on-the-fly. Sampling-based motion planning algorithms have been shown to be effective for …

    rice Repository record for A Unifying Framework for Constrained Sampling-Based Planning (opens in a new tab)

  15. Geometric Approximations and their Application to Motion Planning

    … bottleneck for applications such as motion planning. Exact resolution of these complexities might introduce other complexities such as unmanageable number of components. Hence, approximation methods provide a way to handle these complexities in a manageable state by trading off some …

    tamu Repository record for Geometric Approximations and their Application to Motion Planning (opens in a new tab)

  16. Stigmergy-Based Multi-Agent Motion Planning Using QR Codes

    … approach to asynchronous multi-agent motion planning in communication-restricted environments. Building on sampling-based motion planning, it introduces a framework for encoding paths within QR codes that are physically placed in the environment. Feasible paths generated by a robot are …

    maryland Repository record for Stigmergy-Based Multi-Agent Motion Planning Using QR Codes (opens in a new tab)

  17. Accelerating Proximity Queries Accelerating Proximity Queries for Non-convex Geometries in a Robot Cell Context

    Sampling-based motion-planners, for example rapidly exploring dense tree (RRT) based planners, depend on fast proximity queries. Regrettably, bounding volume tests are significant bottlenecks of proximity queries. Sampling-based motion-planners are therefore accelerated by reducing the number of …

    chalmers Repository record for Accelerating Proximity Queries Accelerating Proximity Queries for Non-convex Geometries in a Robot Cell Context (opens in a new tab)

  18. Improving Protein Conformational Sampling by Using Guiding Projections

    … we study the conformational space of proteins. Sampling-based motion planning algorithms from the eld of robotics have been very successful at this task. However, studying the conformational space of large proteins with hundreds or thousands of Degrees of Freedom remains a big challenge. In this …

    rice Repository record for Improving Protein Conformational Sampling by Using Guiding Projections (opens in a new tab)

  19. Motion planning for physical simulation

    Motion planning research has been successful in developing planning algorithms which are effective for solving problems with complicated geometric and kinematic constraints. Various applications in robotics and in other fields demand additional physical realism. Some progress has been made for …

    rice Repository record for Motion planning for physical simulation (opens in a new tab)

  20. Sampling and Searching Methods for Practical Motion Planning Algorithms

    In its original conception, the motion planning problem considered the search of a robot path from an initial to a goal configuration. The study of motion planning has advanced significantly in recent years, in large part due to the development of highly successful sampling and searching …

    uiuc Repository record for Sampling and Searching Methods for Practical Motion Planning Algorithms (opens in a new tab)

Page 1 of 3