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 28 for “"Probabilistic roadmap"”.
-
Adaptive probabilistic roadmap construction with multi-heuristic local planning
… often use heuristic or incomplete algorithms. Probabilistic roadmap is a probabilistically complete motion planning method that has been an object of intensive study over the past years. The method is known to be susceptible to the problem of "narrow passages": Finding a motion that passes a …
-
An Examination of the Fuzzy Inference System on Probabilistic Roadmap Path Planning
… search and rescue operations. Probability roadmap (PRM) is a typical path planning algorithm that can determine an optimal trajectory once the robot start and goal positions are specified. However, when the number of robots in the system increases, it converges slowly and may even fail to …
-
Analysis of probabilistic roadmap methods for motion planning and applications to polygon manipulation
Motion planning deals with the problem of finding trajectory between two configurations in some space under some constraints. The science of motion planning deals with solving this problem efficiently in different spaces and under varying sets of constraints. This thesis provides an extended …
-
Intelligent Motion Planning and Analysis with Probabilistic Roadmap Methods for the Study of Complex and High-Dimensional Motions
… can be applied. This method is derived from probabilistic roadmap methods (PRMs) originally developed for robotic motion planning. It builds a graph, or roadmap, where configurations are represented as vertices and transitions between configurations are edges. The contribution of this work is …
-
Rigidity Analysis for Modeling Protein Motion
… developed for robotic applications called the Probabilistic Roadmap Method. The Probabilistic Roadmap Method builds a graph, or roadmap, to model the connectivity of the movable object?s valid motion space. We previously applied this methodology to study protein folding and obtained promising …
-
Random Neighborhood Graph: A Framework for Planning Feedback Motion Strategies
… to the fast multiple queries permitted by the probabilistic roadmap approach to path planning. Our choice of neighborhoods is motivated in part by recent tools from computational geometry which compute point locations and arrangements efficiently without significant dependence on dimension. We …
-
A Constraint and Sampling-Based Approach to Integrated Task and Motion Planning
… the goal. The SMT solver utilizes an annotated Probabilistic Roadmap (PRM) to query for motion planning information. A sampling algorithm generates the PRM's vertices to permit a mobile manipulator to grasp numerous object configurations. Each iteration samples several base configurations and …
-
Visualization tools for moving objects
… for a class of randomized planners called probabilistic roadmap methods (PRMs). PRMs are roadmap-based methods that generate a graph or roadmap where the nodes represent collision-free configurations and the edges represent feasible paths between those configurations. PRMs typically consist …
-
Local Randomization in Neighbor Selection Improves PRM Roadmap Quality
Probabilistic Roadmap Methods (PRMs) are one of the most used classes of motion planning methods. These sampling-based methods generate robot configurations (nodes) and then connect them to form a graph (roadmap) containing representative feasible pathways. A key step in PRM roadmap construction …
-
Using trails to improve map generation for virtual agents in large scale, online environments
… to improve rapidly exploring randomised tree and probabilistic roadmap generation, as well as being used as a source of information for segmenting maps in very large scale environments.
-
Path planning for improved target visibility : maintaining line of sight in a cluttered environment
… applies these penalties to the edges in a probabilistic roadmap, providing weights in the roadmap graph for graph-search based planning algorithms. This thesis presents two variants on the planner. The static multi-query planner precomputes penalties for all roadmap edges and performs a …
-
Path Planning and Control of an Autonomous Quadrotor Testbed in a Cluttered Environment
… The Dynamic A* algorithm, or simply D*, and the Probabilistic Roadmap method (PRM) are used in a scenario designed to test their respective functionality and usefulness with the goal of determining the better algorithm for flight testing given a partially known or changing environment.;The …
-
Visibility-Constrained Path Planning for Unmanned Aerial Vehicles
… using key concepts of visibility theory. A probabilistic roadmap (PRM) is used to find a path on the prior map with sensor visibility regions. Panoptic segmentation is used to obtain a pixel-wise semantic mask to identify obstacles in the RGB frames captured online. The inverse projection …
-
Metrics for sampling-based motion planning
… represent the motions as a graph (e.g., the Probabilistic Roadmap Methods or PRMs), or as a tree (e.g., the Rapidly exploring Random Tree or RRT). Although many sampling-based planners have been proposed, we do not know how to select among them because their different sampling biases make …
-
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 …
-
Ευρετικοί αλγόριθμοι για το πρόβλημα δρομολόγησης πλοίων
… Motion Planning (RMP) problem, we introduced the Probabilistic Roadmap (PRM) approach (originally successful in Robotics) into the maritime domain to address SWR. Within this framework, we developed a novel, robust, real-time path planning algorithm capable of effectively solving SWR under dynamic …
-
Robot learning for autonomous navigation in a dynamic environment
… the statistical planning approach called probabilistic roadmap (PRM), Q-learning together with regime-switching Markov decision process (RSMDP) due to its beneficial characteristics, to form a robust Q-learning. Consequently, the initial path can be improved through robust Q-learning …
-
Distributed intelligent systems for a swarm of robots
… such as biologically inspired formations or Probabilistic RoadMap (PRM) tend to have a fixed shape, where robots are positioned in a fixed location point within the swarm, preventing the swarm from adjusting its formation to adapt to the unknown area, thus, are not suitable to explore unknown …
-
Trajectory Planning for Hyper-Redundant Manipulators in Constrained Workspaces
… motion planner is based on the multiple-query Probabilistic Roadmap method (PRM) that generates a graph of connected random nodes in configuration space while avoiding configuration obstacles in an off-line preprocessed phase. Afterwards, in the query phase, the graph searching method finds an …
-
Shortest Path Problems: Domain Restriction, Anytime Planning, and Multi-objective Optimization
… and accuracy of our algorithm is tested on Probabilistic Roadmap graphs to minimize the distance of travel subject to a constraint on the overall threat exposure to enemy observers.
Page 1 of 2