Essays about: "path planning algorithm"
Showing result 6 - 10 of 112 essays containing the words path planning algorithm.
-
6. A GPU Implementation of Kinodynamic Path Planning in Large Continuous Costmap Environments : Using Dijkstra's Algorithm and Simulated Annealing
University essay from Karlstads universitet/Institutionen för ingenjörsvetenskap och fysik (from 2013)Abstract : Path planning that takes kinodynamic constraints into account is a crucial part of critical missions where autonomous vehicles must function independently without communication from an operator as this ensures that the vehicle will be able to follow the planned path. In this thesis, an algorithm is presented that can plan kinodynamically feasible paths through large scale continuous costmap environments for different constraints on the maximum allowed acceleration and jerk along the path. READ MORE
-
7. Coverage Motion Planning for Search and Rescue Missions : A Costmap Based Approach for fixed wing UAVs using Simulated Annealing &Cubic Splines
University essay from Karlstads universitet/Institutionen för ingenjörsvetenskap och fysik (from 2013)Abstract : The present study proposes a novel approach to Coverage Path Planning for unmanned aerial vehicle (UAV) inspired by the Orienteering Problem. The main goal is to develop an algorithm suitable for Search and Rescue Missions, which can produce a search pattern with dynamical constrains, that is not limited to the traditional back-and-forth motion or spiral patterns. READ MORE
-
8. Comparative Analysis of the Inverse Kinematics of a 6-DOF Manipulator : A Comparative Study of Inverse Kinematics for the 6-DOF Saab Seaeye eM1-7 Manipulator with Non-Conventional Wrist Configuration
University essay from Linköpings universitet/ReglerteknikAbstract : This report presents various methods for solving the inverse kinematic problem for a non-conventional robotic manipulator with 6 degrees of freedom and discusses their respective advantages and disadvantages. Numerical methods, such as gradient descent, Gauss-Newton and Levenberg-Marquardt as well as heuristic methods such as Cyclic Coordinate Descent and Forward and Backward Reaching Inverse Kinematics are discussed and presented, while the numerical methods are implemented and tested in simulation. READ MORE
-
9. Optimization-Based Path Planning For Indoor UAVs in an Autonomous Exploration Framework
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Exploration is a fundamental problem in robotics that requires robots to navigate through unknown environments to autonomously gather information about their surroundings while executing collision-free paths. In this project, we propose a method for producing smooth paths during the exploration process in indoor environments using UAVs to improve battery efficiency and enhance the quality of pose estimation. READ MORE
-
10. A comparison between mapless and pre-mapped path planning : Towards open-source Autonomous Mobile Robots in a dynamic industrial setting
University essay from Högskolan i Skövde/Institutionen för informationsteknologiAbstract : Since their introduction in the 1950s, industrial Automated Guided Vehicles (AGV) have gone from automatic machinery limited by hardware to complex robots limited by software, called Autonomous Mobile Robots. Small and medium businesses need to be able to utilize cutting-edge technology. READ MORE
