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 329 for “"Planning Algorithms"”.

  1. Extensions of motion planning algorithms

    Sample-based motion planning algorithms can be applied to a broad range of circumstances in motion planning of robotics. Though sample-based algorithms are able to generate collision-free paths without the information of obstacles, they still have two weaknesses: one is that it is challenging to …

    bu Repository record for Extensions of motion planning algorithms (opens in a new tab)

  2. Informative Path Planning Algorithms for Anomaly Detection

    Informative path planning (IPP) algorithms are widely used to control the movement of drones or ground robots when the objective is to efficiently collect information from an environment of interest. For instance, in agriculture, drones might be used for the timely detection of outbreaks of plant …

    ucf Repository record for Informative Path Planning Algorithms for Anomaly Detection (opens in a new tab)

  3. COCHLEAR IMPLANTATION: PATH PLANNING ALGORITHMS AND DYNAMICS

    … which the effects of dynamics within the path planning algorithms on simulated and modeled cochlear implantation surgery have been studied. A novel path planning algorithm has been developed by making use of Rapidly-exploring Randomized Trees (RRT), and subsequently incorporating Sequential …

    maryland Repository record for COCHLEAR IMPLANTATION: PATH PLANNING ALGORITHMS AND DYNAMICS (opens in a new tab)

  4. Path Planning Algorithms for Multiple Heterogeneous Vehicles

    … Traveling Salesman Problem (ATSP). As a result, algorithms available for the single salesman problem can be used to solve the HMDMTSP. To show the effectiveness of the transformation, the well known Lin-Kernighan-Helsgaun heuristic was applied to the transformed ATSP. Computational results show …

    tamu Repository record for Path Planning Algorithms for Multiple Heterogeneous Vehicles (opens in a new tab)

  5. Trajectory planning Algorithms for bio-inspired Drones

    Las matemáticas y la optimización computacional son fundamentales para el avance de la robótica, particularmente en el caso de los Vehículos Aéreos No Tripulados (UAVs), comúnmente conocidos como drones. Esta tesis aborda desafíos clave en la planificación y coordinación de diversos sistemas …

    sevilla Repository record for Trajectory planning Algorithms for bio-inspired Drones (opens in a new tab)

  6. Path planning algorithms for agricultural field machines

    In this thesis, a coverage path planning problem is discussed in the case of agricultural fields and agricultural machines. Methods and algorithms to solve this problem are developed. The necessary condition is to cover the whole field, while the goal is to find as efficient a route as possible. As …

    aalto Repository record for Path planning algorithms for agricultural field machines (opens in a new tab)

  7. Path-planning algorithms in high-dimensional spaces

    In this thesis, we discuss the problem of path-planning in high-dimensional spaces. Large search spaces tend to lead to slow algorithms in order to find a path or to converge towards the optimal solution of a path-planning problem. This thesis investigates both discrete and continuous search …

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

  8. Path Planning Algorithms for Adverse Weather Conditions

    … was introduced to describe the problem of planning the path and measurements of a sensor installed on a ground robot, in order to classify multiple targets in an obstacle-populated environment. The use of conventional path-planners like probabilistic roadmaps (PRM) for this purpose requires …

    cornell Repository record for Path Planning Algorithms for Adverse Weather Conditions (opens in a new tab)

  9. Path Planning Algorithms for Autonomous Mobile Robots

    … and implementation of multiple different path planning algorithms for autonomous mobile robots, with a focus on differentially driven robots. Then, it continues to propose a real-time path planner that is capable of finding the optimal, collision-free path for a nonholonomic Unmanned Ground …

    concordia Download PDF for Path Planning Algorithms for Autonomous Mobile Robots (opens in a new tab)

  10. Collision free path planning algorithms for robot navigation problem

    Path planning problem, including maze navigation is a challenging topic in robotics. Indeed, a significant amount of research has been devoted to this problem in recent years. Genetic algorithm is a popular approach that searches for an optimal solution in given set of solutions. Considering via …

    missouri Repository record for Collision free path planning algorithms for robot navigation problem (opens in a new tab)

  11. Placement and motion planning algorithms for robotic sensing systems

    … it is crucial to complement it with efficient algorithms that plan for the sensing in these systems. In this dissertation, we develop new sensor planning algorithms and present prototype robotic sensing systems.In the first part of this dissertation, we study two problems on placing stationary …

    umn Repository record for Placement and motion planning algorithms for robotic sensing systems (opens in a new tab)

  12. Motion planning algorithms for a group of mobile agents

    … a lot of attention in recent times. Motion planning is a critical problem in deploying autonomous agents. In this research we have developed two novel global motion planning schemes for a group of mobile agents which eliminate some of the disadvantages of the current methods available. The …

    tamu Repository record for Motion planning algorithms for a group of mobile agents (opens in a new tab)

  13. 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)

  14. Distributed motion planning algorithms for a collection of vehicles

    Unmanned Vehicles (UVs) currently perform a variety of tasks critical to a military mission. In future, they are envisioned to have the ability to accomplish a mission co-operatively and effectively with limited fuel onboard. In particular, they must search for targets, classify the potential …

    tamu Repository record for Distributed motion planning algorithms for a collection of vehicles (opens in a new tab)

  15. 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)

  16. Motion planning algorithms and implementations for obstacle-cluttered environments

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms

    uiuc Repository record for Motion planning algorithms and implementations for obstacle-cluttered environments (opens in a new tab)

  17. Path planning algorithms for robots in a data muling system

    We study two path planning problems that arise in data muling systems where robots are charged to collect data from wireless devices dispersed across a large environment. In such applications, deploying a network of stationary wireless sensors may be infeasible when many relay nodes are deployed to …

    umn Repository record for Path planning algorithms for robots in a data muling system (opens in a new tab)

  18. 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)

  19. Accelerating path planning algorithms with high level synthesis tools and FPGAs.

    Accelerating path planning algorithms with field programmable gate arrays (FPGA) allows the designer to achieve significant performance increases over using a traditional central processing unit (CPU). Converting an algorithm to run on an FPGA is a complicated and time consuming process. This …

    baylor Repository record for Accelerating path planning algorithms with high level synthesis tools and FPGAs. (opens in a new tab)

  20. Path planning algorithms for atmospheric science applications of autonomous aircraft systems

    … To accomplish this we have developed a series of algorithms for path planning, driven by the dual objectives of uncertainty and<br/>information gain.<br/><br/>Algorithms for centralised, discrete path planning, a centralised, continuous planner and finally a decentralised, real-time, asynchronous …

    soton Download PDF for Path planning algorithms for atmospheric science applications of autonomous aircraft systems (opens in a new tab)

Page 1 of 17