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 31 for “"Sampling-based algorithms"”.
-
Comparison of Sampling-Based Algorithms for Multisensor Distributed Target Tracking
… theory has been made in the area of the sampling-based methods, including both random (Monte Carlo) and deterministic (quasi-Monte Carlo) sampling, and their combination. This work considers the problem of tracking a maneuvering target in a multisensor environment. A novel scheme for …
-
Multi-Robot Path Planning Using Sampling-Based Algorithms and Reinforcement Learning
… and limitations of each. This study 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 …
-
Machine learning and dynamic programming algorithms for motion planning and control
… dissertation aims at developing a new class of sampling-based motion planning algorithms that are fast, efficient and asymptotically optimal by employing ideas from Machine Learning (ML) and Dynamic Programming (DP). First, we interpret the robot motion planning problem as a form of a machine …
-
Time-optimal sampling-based motion planning for manipulators with acceleration limits
… 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 complete and …
-
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 …
-
Multistage Stochastic Decomposition and its Applications
In this dissertation, we focus on developing sampling-based algorithms for solving stochastic linear programs. The work covers both two stage and multistage versions of stochastic linear programs. In particular, we first study the two stage stochastic decomposition (SD) algorithm and present some …
-
Reasoning with models of probabilistic knowledge over probabilistic knowledge
… is done within that model. Present model-based approaches of this kind are limited in that either their semantics is restricted to have all agents with a common prior on world states, or are resolving to reasoning algorithms that do not scale to large models. In this thesis we provide the …
-
Using Statistical Tools to Improve Sampling-based Motion Planning
… This work focuses on improving performance of sampling-based algorithms, a dominant family of algorithms proposed in late 1990's, which can deal with high-dimensional, highly-constrained problems. Sampling-based planners have been shown to be effective in quickly searching unexplored parts of a …
-
Workspace-Guided Fast Discovery of Important Motion Planning Regions
… through complex environments. Motion planning algorithms are applied in robotics navigation, manipulation, and other domains like virtual prototyping, computational geometry, and computational biology. Exact motion planning is computationally hard, which has prompted interest in sampling-based …
-
Generalized Sampling-Based Feedback Motion Planners
… robotics motion planning community, sampling based algorithms like probabilistic roadmaps (PRM) and rapidly exploring random trees (RRTs) have been successful in solving very high dimensional deterministic problem. However they are not robust to system with uncertainties in the system …
-
Combining Discrete and Continuous Reasoning for Robot Motion Planning in Complex Domains
… planning becomes critical since optimization-based techniques often fail to perform the kinds of deliberation required for complex systems. This thesis proposes new techniques for solving two instances of motion planning: path planning for high-dimensional manipulators and optimal task …
-
Path-planning algorithms in high-dimensional spaces
… 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 spaces. For discrete search spaces, the use of multi-scale data structure allows …
-
Motion Planning For Autonomous Vehicles In Non-Signalized Intersections
… its performance to the standard RRT and RRT* algorithms through Python simulations. The pRRT algorithm outperformed the RRT and RRT* algorithms in terms of success rate and time to find a safe trajectory. The algorithm was implemented experimentally on scaled cars for the validation of its …
-
Planning Practical Paths in High-Dimensional Space
… in the robot's DOF. As a consequence heuristic sampling-based approaches have been developed to solve high-dimensional real-world path planning problems. A shortcoming of the current sampling-based algorithms is that they can obtain highly non-optimal solutions since they rely upon randomization …
-
Algorithmic Developments in Monte Carlo Sampling-Based Methods for Stochastic Programming
Monte Carlo sampling-based methods are frequently used in stochastic programming when exact solution is not possible. In this dissertation, we develop two sets of Monte Carlo sampling-based algorithms to solve classes of two-stage stochastic programs. These algorithms follow a sequential framework …
-
Stochastic Tree Search for Highly Coordinated Planning
… coordinated fashion causes traditional search algorithms to perform poorly as it creates combinatorial search spaces that renders exploration versus exploitation dilemma challenging as well. Recently, there has been great improvement in stochastic planning in large search spaces with sampling …
-
NeuRA: Using Neural Networks to Improve WiFi Rate Adaptation
Although a variety of rate adaptation algorithms have been proposed for 802.11 devices, sampling-based algorithms are preferred and used in practice because they only require frame loss information which is available on all devices. Unfortunately, sampling can impose significant overheads because …
-
Sampling and Robustness in Multi-Robot Visibility-Based Pursuit-Evasion
… polygonal space, the multi-robot visibility-based pursuit-evasion problem tasks several pursuer robots with the goal of establishing visibility with an arbitrarily fast evader. The best-known complete algorithm for this problem takes time doubly exponential in the number of robots. However, …
Page 1 of 2