2013
DOI: 10.1007/978-94-007-7214-4_17
|View full text |Cite
|
Sign up to set email alerts
|

An Open-Source Toolbox for Motion Analysis of Closed-Chain Mechanisms

Abstract: Many situations in Robotics require an effective analysis of the motions of a closed-chain mechanism. Despite appearing very often in practice (e.g. in parallel manipulators, reconfigurable robots, or molecular compounds), there is a lack of general tools to effectively analyze the complex configuration spaces of such systems. This paper describes the CUIK suite, an open-source toolbox for motion analysis of general closed-chain mechanisms. The package can determine the motion range of the whole mechanism or o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2016
2016

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 21 publications
(21 reference statements)
0
1
0
Order By: Relevance
“…These algorithms have decreasing efficiency as the subclass of systems gets bigger, with highest efficiency for underlying partial 2-tree graphs (alternately called tree-width 2, series-parallel, and K 4 minor avoiding), moderate efficiency for 1 degree-offreedom (dof) graphs with low Cayley complexity (which include common linkages such as the Strandbeest, Limacon, and Cardioid), and decreased efficiency for general 1-dof tree-decomposable graphs. While software suites exist [51,52,53,54], no such formal algorithms and guarantees are known for non-tree-decomposable systems.…”
Section: Configuration Spaces Of Underconstrained Systemsmentioning
confidence: 99%
“…These algorithms have decreasing efficiency as the subclass of systems gets bigger, with highest efficiency for underlying partial 2-tree graphs (alternately called tree-width 2, series-parallel, and K 4 minor avoiding), moderate efficiency for 1 degree-offreedom (dof) graphs with low Cayley complexity (which include common linkages such as the Strandbeest, Limacon, and Cardioid), and decreased efficiency for general 1-dof tree-decomposable graphs. While software suites exist [51,52,53,54], no such formal algorithms and guarantees are known for non-tree-decomposable systems.…”
Section: Configuration Spaces Of Underconstrained Systemsmentioning
confidence: 99%