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 23 for “"Sampling-based planning"”.
-
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 …
-
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 …
-
Joint Exploration of Local Metrics and Geometry in Sampling-based Planning
… the connectivity of the graph produced by a sampling-based planner over a fixed number of configurations. This development is achieved through generalization of the concept of the local free space to inner products other than the Euclidean inner product. This new structure allows for …
-
A General Framework for a Sampling-Based Planning Approach to Disassembly Sequence Planning
We present a framework for disassembly sequence planning. This framework is versatile, allowing different types of search schemes (exhaustive vs. preemptive), various part separation techniques, and the ability to group parts into subassemblies to improve solution efficiency and parallelism. This …
-
Learning-Based Guidance Map Generation for Heuristically Biased RRT Path Planning
… with the optimality of 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 …
-
Informed Anytime Search for Continuous Planning Problems
… many different technical problems and path planning is a key component of most autonomous solutions. Path planning is the task of finding a path through the environment that allows a robot to reach its desired position. This path must avoid obstacles and be executable by the robot while …
-
MOTION AND TASK PLANNING FOR UNMANNED MULTICOPTER SYSTEMS
… to investigate techniques in motion and task planning that increase the autonomous capability of the unmanned multicopter aerial systems. For motion planning, we propose to parameterize the motions by their boundary conditions and introduce the boundary state constrained primitives (BSCPs). We …
-
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 …
-
Efficient Learning and Inference for High-dimensional Lagrangian Systems
… of these methods to high-dimensional motion planning. Algorithms are given to learn and exploit the struc- ture of holonomic motion planning problems effectively via spectral analysis and iterative dynamic programming, admitting solutions to problems of unprecedented dimension com- pared to …
-
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 …
-
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 …
-
Stability Analysis and Formally Guaranteed Tracking Control of Quadrotors
… of tracking errors during the trajectory planning phase. Our framework leverages the well-established geometric tracking controller, analyzing its stability to demonstrate the local exponential stability of tracking error dynamics with any positive control gains. Additionally, we derive …
-
Collaborative Robotic Arm and Humanoid Interaction for Kitting Tasks in Simulated Factory Environment: A Simulation-Based Evaluation of Motion Planning Methods for Automated Kitting in Dynamic Industrial Environments
… the development and evaluation of a simulation-based system for motion planning in a kitting task. The system was built around a gantry-mounted UR10e robot arm with a Robotiq gripper in a simulated factory environment containing a flow rack, crates, static and dynamic obstacles. The work …
-
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 …
-
A Framework for Offline Risk-aware Planning of Low-altitude Aerial Flights during Urban Disaster Response
… datasets, and tools for aerial system trajectory planning in urban disasters that optimizes mission performance and guarantee mission success. This work seeks to develop a framework and software environment to investigate the requirements for offline planning algorithms and flight risk models when …
-
Proving infeasibility in motion planning
Motion planning is a fundamental problem in robotics that has received a lot of attention. The motion planning problem is NP-complete, but previous works in motion planning have been very successful in efficiently finding a valid path in motion planning problems. One class of solutions for solving …
-
Information-theoretic path planning and navigation
… the first stage, referred to as the offline path planning stage, a reference path plan requiring moderate navigation perception is sought in uncertain configuration space (the product space of mean and covariance). In the second stage, the online path following stage, the sensor modalities and …
-
Kinodynamic Planning with μ-Calculus Specifications
Motion planning problems involve determining appropriate control inputs to guide a system towards a desired endpoint. Sampling-based motion planning was developed as a technique for discretizing the state space of systems with complex environments. This makes the sampling-based method especially …
-
Collaborative Motion Planning
Planning motion is an essential component for any autonomous robotic system. An intelligent agent must be able to efficiently plan collision-free paths in order to move through its world. Despite its importance, this problem is PSPACE-Hard which means that even planning motions for simple robots is …
Page 1 of 2