Motion recovery of parallel manipulators using task-decomposition approach

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, the motion recovery of parallel manipulators is investigated. To achieve the desired performance, a failure recovery based on decomposing the task space of manipulator into the major and secondary subtasks is presented. The major subtasks are more important than the other subtasks and must be accomplished as precisely as possible. The secondary subtasks with less significance can be compromised to achieve secondary criteria such as optimizing measures of fault tolerance, singularity avoidance and obstacle avoidance. The task-decomposition approach minimizes the least square error of the vector of the major subtasks and at the same time optimizes the secondary criterion. © Springer-Verlag Berlin Heidelberg 2012.

Cite

CITATION STYLE

APA

Nazari, V., & Notash, L. (2012). Motion recovery of parallel manipulators using task-decomposition approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7508 LNAI, pp. 226–235). https://doi.org/10.1007/978-3-642-33503-7_23

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