Sökning: "Rapidly-exploring Random Trees"

Hittade 3 avhandlingar innehållade orden Rapidly-exploring Random Trees.

1. 1. Sampling-based Path Planning for an Autonomous Helicopter

   Författare :Per Olof Pettersson; Patrick Doherty; Lars Karlsson; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Path Planning; Motion Planning; Helicopters; Probabilistic Roadmaps; Rapidly-exploring Random Trees; Computer science; Datalogi;

   Sammanfattning : Many of the applications that have been proposed for future small unmanned aerial vehicles (UAVs) are at low altitude in areas with many obstacles. A vital component for successful navigation in such environments is a path planner that can find collision free paths for the UAV. LÄS MER

3. 2. Robot path planning : an object-oriented approach

   Författare :Morten Strandberg; Bo Wahlberg; Steven La Valle; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Signalbehandling; mathematics; computer science; Signalbehandling; Signal processing; Signalbehandling;

   Sammanfattning : Path planning has important applications in many areas, for example industrial robotics, autonomous systems, virtual prototyping, and computer-aided drug design. This thesis presents a new framework for developing and evaluating path planning algorithms. The framework is named CoPP (Components for Path Planning). LÄS MER

4. 3. Path planning using probabilistic cell decomposition

   Författare :Frank Lingelbach; Bo Wahlberg; Henrik I. Christensen; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Signalbehandling; Signalbehandling; Signal processing; Signalbehandling;

   Sammanfattning : The problem of path planning occurs in many areas, such as computational biology, computer animations and computer-aided design. It is of particular importance in the field of robotics. Here, the task is to find a feasible path/trajectory that the robot can follow from a start to a goal configuration. LÄS MER