Published April 1, 2004
| Version v1
Conference paper
Algebraic Elimination for Parallel Robot Calibration
Creators
Contributors
Others:
- Constraints solving, optimization and robust interval analysis (COPRIN) ; Centre Inria d'Université Côte d'Azur (CRISAM) ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-École nationale des ponts et chaussées (ENPC)
- Laboratory of Algebraic and Geometric Algorithms [Kapodistrian Univ] (ERGA) ; Department of Informatics and Telecomunications [Kapodistrian Univ] (DI NKUA) ; National and Kapodistrian University of Athens (NKUA)-National and Kapodistrian University of Athens (NKUA)
Description
This paper implements algebraic elimination methods for an accurate and general calibration of parallel robots, applied to Gough (or Stewart) platforms. It focuses on two approaches, namely algebraic variable elimination and monomial lineariza- tion, which are compared to a classical numerical optimization technique. We detail the former, since it is not often used for the problems at hand, and specify its application by means of the sparse resultant, combined with numerical linear algebra. We per- form several experiments that allow us to compare the three meth- ods in the presence of measurement errors. Our main conclusion is that elimination methods offer an interesting alternative to more well-established methods for parallel robot calibration by satisfy- ing the goals of accuracy and robustness. Moreover, out methods require no initial estimate and no hypothesis on the noise distribu- tion in order to derive a quality index per solution.
Abstract
International audienceAdditional details
Identifiers
- URL
- https://inria.hal.science/hal-00990064
- URN
- urn:oai:HAL:hal-00990064v1
Origin repository
- Origin repository
- UNICA