Improved dialytic elimination algorithm for the forward kinematics of the general Stewart-Gough platform

Tae Young Lee, Jae Kyung Shim

Research output: Contribution to journalArticle

36 Citations (Scopus)

Abstract

This paper presents the forward kinematics of the general Stewart-Gough platform using dialytic elimination. The proposed algorithm, when implemented in a computer language, provides all the solutions in fairly less computation time compared to the existing ones, mainly due to the fact that it directly leads to a 40th-degree univariate equation from a constructed 15 × 15 Sylvester's matrix which is relatively small in size. In addition, the ways to avoid ill-conditioned linear systems in the solution procedure are dealt with for the purpose of enhancing the accuracy of the computed poses. Numerical examples are given to demonstrate the developed algorithm.

Original languageEnglish
Pages (from-to)563-577
Number of pages15
JournalMechanism and Machine Theory
Volume38
Issue number6
DOIs
Publication statusPublished - 2003 Jun 1

Fingerprint

Kinematics
Computer programming languages
Linear systems

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering
  • Mechanical Engineering

Cite this

Improved dialytic elimination algorithm for the forward kinematics of the general Stewart-Gough platform. / Lee, Tae Young; Shim, Jae Kyung.

In: Mechanism and Machine Theory, Vol. 38, No. 6, 01.06.2003, p. 563-577.

Research output: Contribution to journalArticle

@article{9ce2fcf92d3a46aaa3b509c23511f15f,
title = "Improved dialytic elimination algorithm for the forward kinematics of the general Stewart-Gough platform",
abstract = "This paper presents the forward kinematics of the general Stewart-Gough platform using dialytic elimination. The proposed algorithm, when implemented in a computer language, provides all the solutions in fairly less computation time compared to the existing ones, mainly due to the fact that it directly leads to a 40th-degree univariate equation from a constructed 15 × 15 Sylvester's matrix which is relatively small in size. In addition, the ways to avoid ill-conditioned linear systems in the solution procedure are dealt with for the purpose of enhancing the accuracy of the computed poses. Numerical examples are given to demonstrate the developed algorithm.",
author = "Lee, {Tae Young} and Shim, {Jae Kyung}",
year = "2003",
month = "6",
day = "1",
doi = "10.1016/S0094-114X(03)00009-0",
language = "English",
volume = "38",
pages = "563--577",
journal = "Mechanism and Machine Theory",
issn = "0094-114X",
publisher = "Elsevier Limited",
number = "6",

}

TY - JOUR

T1 - Improved dialytic elimination algorithm for the forward kinematics of the general Stewart-Gough platform

AU - Lee, Tae Young

AU - Shim, Jae Kyung

PY - 2003/6/1

Y1 - 2003/6/1

N2 - This paper presents the forward kinematics of the general Stewart-Gough platform using dialytic elimination. The proposed algorithm, when implemented in a computer language, provides all the solutions in fairly less computation time compared to the existing ones, mainly due to the fact that it directly leads to a 40th-degree univariate equation from a constructed 15 × 15 Sylvester's matrix which is relatively small in size. In addition, the ways to avoid ill-conditioned linear systems in the solution procedure are dealt with for the purpose of enhancing the accuracy of the computed poses. Numerical examples are given to demonstrate the developed algorithm.

AB - This paper presents the forward kinematics of the general Stewart-Gough platform using dialytic elimination. The proposed algorithm, when implemented in a computer language, provides all the solutions in fairly less computation time compared to the existing ones, mainly due to the fact that it directly leads to a 40th-degree univariate equation from a constructed 15 × 15 Sylvester's matrix which is relatively small in size. In addition, the ways to avoid ill-conditioned linear systems in the solution procedure are dealt with for the purpose of enhancing the accuracy of the computed poses. Numerical examples are given to demonstrate the developed algorithm.

UR - http://www.scopus.com/inward/record.url?scp=0037409303&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0037409303&partnerID=8YFLogxK

U2 - 10.1016/S0094-114X(03)00009-0

DO - 10.1016/S0094-114X(03)00009-0

M3 - Article

AN - SCOPUS:0037409303

VL - 38

SP - 563

EP - 577

JO - Mechanism and Machine Theory

JF - Mechanism and Machine Theory

SN - 0094-114X

IS - 6

ER -