TY  - THES
AB  - The ability to plan and execute of movements to accomplish tasks is a fundamental requirement for all types of robot, whether in industrial or in research applications.  This Master Thesis addresses path planning for redundant robot platforms. The research targets two major goals. The first is to bypass the need for an explicit representation of a robot's environment, which is strained with sophisticated computations as well as required expert knowledge. This bypass allows for a considerably more flexible use of a robot, being able to adapt its path planning data to an arbitrary new environment within minutes. The second goal is to provide a real-time capable path planning method, that utilizes the advantages of redundant robot platforms and handles the increased complexity of such systems. These goals are achieved by introducing kinesthetic teaching into path planning, which has already proven to be a successful improvement for single task methods dealing with redundancy resolution.

The thesis proposes an approach utilizing a topological neural network algorithm to construct an internal representation of a robot's workspace based on input
data obtained from physical guidance of the robot by a user. In order to create feasible and safe movements, information from both configuration space of the robot and task space are employed. The algorithm is extended by
heuristics to improve its results for the intended scenario.  This modified network construction algorithm constructs a navigation graph similar to classical approaches with explicit modeling. It can be processed by means of conventional search algorithms from graph theory to generate paths between two arbitrary points in the workspace.
DA  - 2014
LA  - eng
PY  - 2014
TI  - Path planning for a redundant robot manipulator using sparse demonstration data
UR  - https://nbn-resolving.org/urn:nbn:de:hbz:361-26531041
Y2  - 2024-11-22T03:22:19
ER  -