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 14 of 14 for “"Probabilistic roadmaps"”.
-
Probabilistic roadmaps in uncertain environments
… is a common requirement of robot navigation. Probabilistic roadmaps are an efficient method for generating motion graphs through the robot's configuration space, but do not inherently represent any uncertainty in the environment. In this thesis, the physical domain is abstracted into a graph …
-
Surveying Underwater Shipwrecks with Probabilistic Roadmaps
… is needed to do so. Paths are generated 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 …
-
Probabilistic Roadmaps for Virtual Camera Pathing with Cinematographic Principles
… motion planning algorithm, specifically the probabilistic roadmap. This algorithm uses a rapidly-exploring random tree to quickly cover a space and generate small maps with good coverage. For this work, the camera pitch and height along a specified path were automatically generated using …
-
Path planning with medial axis hints
… version of the path planning problem, including Probabilistic Roadmaps. PRM planners, despite general success, do not fare well in the presence of narrow passages. We enhance the sampling step of PRM planners to find more configurations in narrow passages by incorporating the robot and workspace …
-
Enhanced Path Planning Method for Improving Safety and Productivity of Excavation Operations
… 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 to improve the path planning of …
-
Path Planning Algorithms for Adverse Weather Conditions
… The use of conventional path-planners like probabilistic roadmaps (PRM) for this purpose requires prior knowledge of the workspace while other online path-planning algorithms rely on the sensor’s ability to form a global map and localize itself in it. However, in unknown workspaces, under …
-
Constraint-aware visual servoing for teaching practical robot motion
… offline plan-then-servo approach that integrates probabilistic roadmaps with visual servoing. A method to construct paths between two robot configurations that keep the target object within the camera's field of view is demonstrated, allowing feasible transitions from planned motion to visual …
-
Generalized Sampling-Based Feedback Motion Planners
… the robot motion and environments can be modeled probabilistically. The complexity of solving these MDPs grow exponentially as the dimension of the problem increases and hence, it is nearly impossible to solve the problem even without constraints. Using hierarchical methods, these MDPs can be …
-
Bounded Uncertainty Roadmaps
… while avoiding collisions with obstacles. Probabilistic Roadmaps (PRMs) are state-of-art motion planners solving many hard problems. PRMs make a graph (roadmap) in the free-space of the robot, and then search for the shortest path in the roadmap from source to goal. However classical PRMs …
-
A smart autoflight control system infrastructure
… and planners of the Classical Grid Search, Probabilistic Roadmaps, and Rapidly-Exploring Random Trees families into its core component. Furthermore, we evaluated the viability of a simple heuristic and a more sophisticated Sequential Model-Based Algorithm Configuration Autonomic Manager to …
-
Development of a mobile robotic phenotyping system for growth chamber-based studies of genotype x environment interactions
… from the Kinect sensor and is based on the Probabilistic Roadmaps (PRM) technique, which involves creating a graph of collision-free nodes and edges, and then searching for an acceptable path. The variant presented uses a dilated, down-sampled, KinectFusion as input for rapid collision …
-
Multi-robot Caravanning
We study multi-robot caravanning, which is loosely defined as the problem of a heterogeneous team of robots visiting specific areas of an environment (waypoints) as a group. After formally defining this problem, we propose a novel solution that requires minimal communication and scales with the …
-
Collaborative Motion Planning
… if one exists or report none exists) for probabilistic completeness (probabilistically guaranteed to find a solution if one exists but cannot report if none exists) and improved efficiency. These methods use sampling-based techniques to design a sequence of motions for the robot. However, …