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 35 for “"rapidly-exploring random trees"”.

  1. Single-Query Robot Motion Planning using Rapidly Exploring Random Trees (RRTs)

    Robots moving about in complex environments must be capable of determining and performing difficult motion sequences to accomplish tasks. As the tasks become more complicated, robots with greater dexterity are required. An increase in the number of degrees of freedom and a desire for autonomy in …

    manitoba Repository record for Single-Query Robot Motion Planning using Rapidly Exploring Random Trees (RRTs) (opens in a new tab)

  2. Multi-Goal Path Planning for Inventory Tracking

    … various path planning algorithms based on RRT (rapidly exploring random trees) and RRT* (optimal rapidly exploring random trees) are studied and compared in three simulated environments with obstacles. Computer simulation results show that, the modified RRT* algorithm with node reuse achieves …

    calpoly Repository record for Multi-Goal Path Planning for Inventory Tracking (opens in a new tab)

  3. Safe navigation and path planning for multiagent systems with control barrier functions

    … is the multiagent extension of the CBF guided rapidly-exploring random trees (CBF-RRT) to demonstrate how the CBF Toolbox can be applied. This work addresses the theory behind the CBF Toolbox, as well as presenting examples of how it is applied to multiagent systems. Examples are shown for its …

    bu Repository record for Safe navigation and path planning for multiagent systems with control barrier functions (opens in a new tab)

  4. Plánování cesty neholonomního mobilního robotu

    … algoritmů. Konkrétně se jedná o metody: RRT (Rapidly-Exploring Random Trees), IGPPR (The Intelligent Global Path Planner With Replanning) a ISSD (Incorporating State Space Discretization). Teoretická část je věnována dosavadním přístupům k plánování cesty a vysvětlení výše zmíněných algoritmů. …

    brno-tech Repository record for Plánování cesty neholonomního mobilního robotu (opens in a new tab)

  5. Path-planning algorithms in high-dimensional spaces

    … optimization is integrated in the framework of Rapidly-exploring Random Trees to introduce the Deformable Rapidly-exploring Random Trees algorithm. This algorithm rapidly finds a feasible solution, similarly to the other RRT algorithms, and it also significantly increases the convergence rate of …

    gatech Repository record for Path-planning algorithms in high-dimensional spaces (opens in a new tab)

  6. Obstacle Detection and Avoidance System for Unmanned Aerial Vehicles Based on Monocular Camera

    … around large, static objects like buildings or trees. However, detecting small objects and handling dynamic aerial environments remain challenging. To address this, we introduce an innovative system for small object detection and real-time path planning using a monocular camera. Our dual-stage …

    calgary Repository record for Obstacle Detection and Avoidance System for Unmanned Aerial Vehicles Based on Monocular Camera (opens in a new tab)

  7. Obstacle Avoidance for Small Unmanned Air Vehicles

    … to avoid obstacles. This research compares rapidly-exploring random trees to genetic algorithms for UAV pre-mission path planning. It also presents two methods for using image feature movement and UAV telemetry to calculate depth and detect obstacles. The first method uses pixel ray …

    byu Repository record for Obstacle Avoidance for Small Unmanned Air Vehicles (opens in a new tab) Download PDF for Obstacle Avoidance for Small Unmanned Air Vehicles (opens in a new tab)

  8. A Study on Rapidly Exploring Random Tree Algorithms for Robot Path Planning

    … is a critical feature of autonomous systems. Rapidly-exploring Random Trees (RRT) is a path planning technique that randomly samples the robot configuration space to find a path between the start and end point. This thesis studies and compares the performance of four important RRT algorithms, …

    calpoly Repository record for A Study on Rapidly Exploring Random Tree Algorithms for Robot Path Planning (opens in a new tab)

  9. Surveying Underwater Shipwrecks with Probabilistic Roadmaps

    … by a probabilistic roadmap algorithm that uses a rapidly-exploring random tree to quickly cover the volume of exploration space and generate small maps with good coverage. The roadmap is constructed out of nodes, each having its own weight. The weight of a given node is calculated using an …

    calpoly Repository record for Surveying Underwater Shipwrecks with Probabilistic Roadmaps (opens in a new tab)

  10. Comparison of Path Planning Approaches of Autonomous Vehicles for Obstacle Avoidance Application

    … in this work. Approach 1 (RRT*-Spline) uses rapidly exploring random trees* (RRT*) path planning algorithm combined with cubic spline trajectory generation algorithm. Approach 2 (A*-Polynomial Curve) plans a feasible path by using A* algorithm and generates a smooth trajectory using 5th order …

    mtu Repository record for Comparison of Path Planning Approaches of Autonomous Vehicles for Obstacle Avoidance Application (opens in a new tab)

  11. Multi-Robot Path Planning Using Sampling-Based Algorithms and Reinforcement Learning

    … puts sampling-based algorithms such as RRT (Rapidly-exploring Random Trees), RRT*, and M* to the test to determine which has the best performance in terms of time spent developing and executing the path plan, overall path plan route length, completion success rate, and scalability to more …

    calpoly Repository record for Multi-Robot Path Planning Using Sampling-Based Algorithms and Reinforcement Learning (opens in a new tab)

  12. Enhanced Path Planning Method for Improving Safety and Productivity of Excavation Operations

    … established algorithms from robotics, such as Rapidly-exploring Random Trees (RRT) and Probabilistic Roadmaps (PRM), these studies do not fully consider the engineering constrains of the equipment and do not result in smooth and optimal paths that can be applied in practice. This research aims …

    concordia Download PDF for Enhanced Path Planning Method for Improving Safety and Productivity of Excavation Operations (opens in a new tab)

  13. Learning-Based Guidance Map Generation for Heuristically Biased RRT Path Planning

    … the solution. Traditional sampling planners like Rapidly-exploring Random Trees (RRT) and Rapidly-exploring Random Tree Star (RRT*) offer probabilistic completeness and asymptotic optimality, but often suffer from high computational costs and inefficient exploration in complex environments. To …

    buffalo Repository record for Learning-Based Guidance Map Generation for Heuristically Biased RRT Path Planning (opens in a new tab)

  14. Formal Model Validation by Reachset Conformance between Low and High Order Tractor Semitrailer Vehicle Models

    … of a high order model are explored using rapidly exploring random trees, and checked against reachable sets calculated for the linear low order model with uncertainties. While the method applied for quantifying the unstructured uncertainty between the low and high order models is based on …

    chalmers Repository record for Formal Model Validation by Reachset Conformance between Low and High Order Tractor Semitrailer Vehicle Models (opens in a new tab)

  15. Motion Planning For Autonomous Vehicles In Non-Signalized Intersections

    … flow, which raises the risk of accidents. Rapidly Exploring Random Trees (RRT) is a widely adopted algorithm in robotics for motion planning due to its simplicity and probabilistic completeness. Over the years, researchers have made modifications to the basic RRT algorithm to improve its …

    vt Repository record for Motion Planning For Autonomous Vehicles In Non-Signalized Intersections (opens in a new tab)

  16. Learning Probabilistic Generative Models For Fast Sampling-Based Planning

    … based on Gaussian Mixture Models (GMMs) for Rapidly-exploring Random Trees (RRT). In addition, we introduce a new probabilistically safe local steering primitive based on the probabilistic model. Our local steering procedure is based on a new notion of a convex probabilistically safety …

    penn Repository record for Learning Probabilistic Generative Models For Fast Sampling-Based Planning (opens in a new tab)

  17. Path Planning and Control for Vertical Takeoff and Landing Aircraft

    … generation efficiency. A variation of the rapidly exploring random trees (rrt) algorithm was developed for planning a path through obstacle-laden environments. This variation finds a series of obstacle-free regions known as safe flight corridors (sfcs) and optimizes a b-spline path through …

    byu Repository record for Path Planning and Control for Vertical Takeoff and Landing Aircraft (opens in a new tab) Download PDF for Path Planning and Control for Vertical Takeoff and Landing Aircraft (opens in a new tab)

  18. A Partially Randomized Approach to Trajectory Planning and Optimization for Mobile Robots with Flat Dynamics

    … planning approach is presented, based on the randomized Rapidly-exploring Random Trees framework (RRT*). The local planner relies on differential flatness of the equations of motion to obtain tree branch candidates that automatically satisfy the differential constraints. Flat output …

    qucosa-diss

  19. Motion planning and control for safety-critical systems

    … motion planner. The motion planner is based on Rapidly-exploring Random Trees. I introduce a function that generates collision-free trajectories and controls on-the-fly to avoid separate collision checks during edge extensions. The developed motion planner works for nonlinear systems and can be …

    bu Repository record for Motion planning and control for safety-critical systems (opens in a new tab)

  20. Towards Robot-Agnostic Motion Planning in Dynamic Environments: Integrating Reinforcement Learning with Sampling-Based Planners

    … and success rate compared to methods based on rapidly-exploring random trees. Then, a full-stack planning framework is developed to address the same planning problem but for systems subject to kinematic and dynamic constraints. The main contribution of the framework lies in its robot-agnostic …

    queens Repository record for Towards Robot-Agnostic Motion Planning in Dynamic Environments: Integrating Reinforcement Learning with Sampling-Based Planners (opens in a new tab)

Page 1 of 2