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 8 of 8 for “"Sampling-based path planning"”.
-
Leveraging multiple sources of information to search continuous spaces
<p>Path planning algorithms can solve the problem of finding paths through continuous spaces. This problem appears in a wide range of applications, from navigating autonomous robots to automating assessments of surgical tolerances. The performance requirements on these algorithms tend to become …
-
Investigation of Stochastic Deep Learning Motion Planning Methods for Autonomous Robots
Effective path planning is an essential part of motion planning for autonomous mobilerobots and vehicles. Classical sampling-based path planning methods, such as RRT* are nottime-efficient since they must first create an occupancy map before generating a path. Recently, neural network-based …
-
Model-free Multi-Agent Motion Planning with Non-Uniform Sensors
… done, create a plan for how to perform that task based on sensor input, and finally, execute that plan through its actuators. Often a stationary robotic system is not enough for the tasks we want robots to do for us, therefore we turn to mobile robotic systems to navigate through an environment to …
-
Scene flow for autonomous navigation
… there are various different paradigms for vision based autonomous navigation: mediated perception approaches that parse an entire scene to make driving decision, a direct perception approach that estimates the affordance of driving that maps an input image to small number of key perception …
-
Highly accurate laser based position estimation and planning in industrial robot applications
… on the sensor readings. We further present a sampling based path planning method using projections. It is designed for high dimensional search spaces such as the search space of a mobile manipulator. Our approach divides the search space, and actively searches a subspace in order to reduce …
-
Planejamento de caminhos suaves e seguros baseados em espuma probabilística para Sistemas Robóticos Autônomos
Planning a path for a robot to navigate between two points in a given environment and avoiding collision with obstacles is one of the main issues for autonomous robotics. The search for short paths and reduced search time are aspects of most planning methods, but in applications in which the robots …
-
Robust localization and navigation with linear programming
… of control, we study the problem of robust path planning. Path planning deals with the problem of finding a path from an initial state toward a goal state while considering collision avoidance. We propose a novel approach for navigating in polygonal environments by synthesizing controllers …
-
Learning and monitoring of spatio-temporal fields with sensing robots
… model for a dynamic spatio-temporal field, then based on the learned model trajectories are planned for sensing robots to best estimate the field. In this thesis we call these two parts learning and monitoring, respectively. For the learning, we first introduce a parametric model for the …