2013
DOI: 10.1109/tro.2013.2242376
|View full text |Cite
|
Sign up to set email alerts
|

The Univariate Closure Conditions of All Fully Parallel Planar Robots Derived From a Single Polynomial

Abstract: Abstract-The real roots of the univariate polynomial closure condition of a planar parallel robot determine the solutions of its forward kinematics. This paper shows how the univariate polynomials of all fullyparallel planar robots can be derived directly from that of the widely known 3-RPR robot by simply formulating these polynomials in terms of distances and oriented areas. This is a relevant result because it avoids the case-by-case treatment that requires different sets of variable eliminations to obtain … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
6
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 11 publications
0
6
0
Order By: Relevance
“…Proposed. Recently many mathematical techniques are proposed for the purpose of monitoring the changing environment [17], multirobot navigation [18], motion tracking [19], self-collision avoidance [20], blind juggler control [21], precise positioning [22], distant control [23], and motion grammar description [24]. In most proposals, the algorithm is complex [17][18][19][20], and/or the time derivatives are applied to the parameter analysis [20,21].…”
Section: Advantage Of the Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Proposed. Recently many mathematical techniques are proposed for the purpose of monitoring the changing environment [17], multirobot navigation [18], motion tracking [19], self-collision avoidance [20], blind juggler control [21], precise positioning [22], distant control [23], and motion grammar description [24]. In most proposals, the algorithm is complex [17][18][19][20], and/or the time derivatives are applied to the parameter analysis [20,21].…”
Section: Advantage Of the Methodsmentioning
confidence: 99%
“…On the other hand, the use of many controllable degrees of freedom (DOF) [19,20,22] leads us to a large RMS of errors. Polynomial formalism for the position control [23] requests many topological definitions to realize reliable forward kinematics. Application of motion grammar to robots [24] also requests many possible logical patterns to avoid undesirable actions.…”
Section: Advantage Of the Methodsmentioning
confidence: 99%
“…Distance constraints provide intuitive geometric insights on aspects of the motion analysis problem which are difficult to discern otherwise. Moreover, these geometric insights allow deriving solutions common to problems that otherwise have to be treated case-by-case [33,47,46].…”
Section: Introductionmentioning
confidence: 99%
“…It provides a formulation invariant to the reference frame and, therefore, it gives geometric insights on different problems that remain concealed when using Cartesian geometry. These insights allow deriving solutions common to problems that otherwise have to be treated on a case-by-case basis [ 6 ]. Due to its generality, Distance Geometry finds application in many fields, including biochemistry [ 7 ], nano-technology [ 8 ], inverse/direct kinematics of serial/parallel robots [ 9 ], singularity analysis [ 10 ], or fusion of sensor data [ 11 ].…”
Section: Introductionmentioning
confidence: 99%