Hostname: page-component-6898cfcb55-zkb6p Total loading time: 0 Render date: 2026-11-11T09:39:42.113Z Has data issue: false hasContentIssue false

Enumeration of parallel manipulators

Published online by Cambridge University Press:  01 July 2009

Roberto Simoni*
Affiliation:
Mechanical Engineering Department, Universidade Federal de Santa Catarina 88040-900, Florianópolis, SC, Brazil.
Andrea Piga Carboni
Affiliation:
Mechanical Engineering Department, Universidade Federal de Santa Catarina 88040-900, Florianópolis, SC, Brazil.
Daniel Martins
Affiliation:
Mechanical Engineering Department, Universidade Federal de Santa Catarina 88040-900, Florianópolis, SC, Brazil.
*
*Corresponding author. E-mail: roberto.emc@gmail.com
Rights & Permissions [Opens in a new window]

Summary

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper, we present a new method of enumeration of parallel manipulators with one end-effector. The method consists of enumerating all the manipulators possible with one end-effector that a single kinematic chain can originate. A very useful simplification for kinematic chain, mechanism and manipulator enumeration is their representation through graphs. The method is based on group theory where abstract structures are used to capture the internal symmetry of a structure in the form of automorphisms of a group. The concept used is orbits of the group of automorphisms of a colored vertex graph. The theory and some examples are presented to illustrate the method.

Information

Type
Article
Copyright
Copyright © Cambridge University Press 2008