Skip to content

Time-Optimal Trajectory Planning for Redundant Robots

  • Reiter A
N/ACitations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This master’s thesis presents a novel approach to finding trajectories with minimal end time for kinematically redundant manipulators. Emphasis is given to a general applicability of the developed method to industrial tasks such as gluing or welding. Minimum-time trajectories may yield economic advantages as a shorter trajectory duration results in a lower task cycle time. Whereas kinematically redundant manipulators possess increased dexterity, compared to conventional non-redundant manipulators, their inverse kinematics is not unique and requires further treatment. In this work a joint space decomposition approach is introduced that takes advantage of the closed form inverse kinematics solution of non-redundant robots. Kinematic redundancy can be fully exploited to achieve minimum-time trajectories for prescribed end-effector paths.

Cite

CITATION STYLE

APA

Reiter, A. (2016). Time-Optimal Trajectory Planning for Redundant Robots. Time-Optimal Trajectory Planning for Redundant Robots. Springer Fachmedien Wiesbaden. https://doi.org/10.1007/978-3-658-12701-5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free