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 514 for “"Sampling-based"”.
-
Sampling-based Program Execution Monitoring
… the above problems, in this work, we present a sampling-based approach to program execution monitoring which specifically helps developers trace the program execution in time-sensitive systems such as real-time applications. We build the system model and propose three theorems which determine …
-
Sampling-based Predictive Database Buffer Management
… with low CPU overhead, which is achieved with sampling: buffer eviction considers only a small random sample of buffers and access time estimates are used to select among the sample. This design is easily tuned by adjusting the sample size, and easily modified to improve the access time …
-
Metrics for sampling-based motion planning
… of this problem, a class of methods known as sampling-based planners build approximate representations of potential motions through random sampling. This selective random exploration of the space has produced many remarkable results, including solving many previously unsolved problems. …
-
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 …
-
Understanding Sampling-Based Adversarial Search Methods
… and Checkers. Thanks to a revolutionary new sampling-based planning approach named Upper Confidence bounds applied to Trees (UCT), today's best Go programs play at a master level on full-sized 19 x 19 boards. Intriguingly, UCT's spectacular success in Go has not been replicated in domains …
-
Sampling Based Motion Planning with Reachable Volumes
… and techniques to extend the state of the art sampling based motion planning algorithms to RV-space. We define a reachable volume sampler, a reachable volume local planner and a reachable volume distance metric. We showcase the effectiveness of RV-space by applying these tools to motion …
-
Sampling-Based Motion Planning With Differential Constraints
… of recent efforts have been devoted to various sampling-based MPD algorithms, which iteratively build search graphs using sampled states and controls. This thesis addresses several issues in analysis and design of these algorithms. Firstly, resolution completeness of path planning is extended to …
-
Learning Sampling-Based 6D Object Pose Estimation
… successful automatic pose estimation framework based on predicting pixel-wise correspondences between the camera coordinate system and the local coordinate system of the object. These dense correspondences are used to generate a pool of hypotheses, which in turn serve as a starting point in a …
-
Monte Carlo sampling-based methods in stochastic programming
… In this dissertation, we focus on Monte Carlo sampling-based methods for solving large-scale stochastic programs. Given a candidate solution, suggested as an approximate solution to the original problem, the first question we address is how to assess its quality. Determining whether a solution …
-
A Unifying Framework for Constrained Sampling-Based Planning
… priori, as they must compute motions on-the-fly. Sampling-based motion planning algorithms have been shown to be effective for finding motions for high-dimensional systems such as these. However, the problems these robots face typically take the form of tasks with constraints, which limit the …
-
Efficient Modeling of Random Sampling-Based LRU Cache
… the LRU replacement policy. Recently, the random sampling-based replacement mechanism, as opposed to replacement relying on the rigid LRU data structure, gains more popularity due to its lightweight and flexibility. To approximate LRU, at replacement times, the system randomly selects K objects …
-
Improved Sampling Based Motion Planning Through Local Learning
… Interestingly, a single class of planners, sampling-based planners have proven effective in all these domains. Probabilistic Roadmap Methods (PRMs) are one type of sampling-based planners that sample robot configurations (nodes) and connect them via viable local paths (edges) to form a …
-
Sampling-based Dynamic Optimization: Theory, Analysis and Applications
… such as optimal control theory and robotics. Sampling-based methods have gained much popularity in recent years for solving dynamic optimization problems due to their ability to handle discontinuities in the dynamics and cost function. While many sampling-based dynamic optimization algorithms …
-
Sampling-Based Exploration Strategies for Mobile Robot Autonomy
A novel, sampling-based exploration strategy is introduced for Unmanned Ground Vehicles (UGV) to efficiently map large GPS-deprived underground environments. It is compared to state-of-the-art approaches and performs on a similar level, while it is not designed for a specific robot or sensor …
-
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 …
-
Thompson sampling-based online decision making in network routing
… to decide the next hop for each packet. Thompson sampling (TS) is an efficient and effective algorithm for online decision making problems. Although TS has been proposed for a long time, it was not until recent years that the theoretical guarantees for TS in the standard MAB were given. In this …
-
Sampling based progressive hedging algorithms for stochastic programming problems
… methods and decomposition methods. Most common sampling-based approximation (SAA) SP technique is the Monte Carlo sampling-based method. The Progressive Hedging Algorithm (PHA) on the other hand can optimally solve large problems through the decomposition into smaller problem instances. The SAA, …
-
Learning Probabilistic Generative Models For Fast Sampling-Based Planning
… and efficiency in high dimensional space, sampling-based motion planners have been gaining interest for robotic manipulation in recent years. We present several new learning approaches using probabilistic generative models for fast sampling-based planning. First, we propose fast collision …
-
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 …
Page 1 of 26