A branch-and-prune method to solve closure equations in dual quaternions
Using dual quaternions, the closure equations of a kinematic loop can be expressed as a system of multiaffine equations. In this paper, this property is leveraged to introduce a branch-and-prune method specially tailored for solving such systems of equations. The new method is objectively simpler (i...
| Autores: | , , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2021 |
| País: | España |
| Recursos: | Consejo Superior de Investigaciones Científicas (CSIC) |
| Repositorio: | DIGITAL.CSIC. Repositorio Institucional del CSIC |
| OAI Identifier: | oai:digital.csic.es:10261/261084 |
| Acesso em linha: | http://hdl.handle.net/10261/261084 |
| Access Level: | acceso abierto |
| Palavra-chave: | Position analysis Dual quaternions Multiaffine polynomials Branch-and-prune methods |
| Resumo: | Using dual quaternions, the closure equations of a kinematic loop can be expressed as a system of multiaffine equations. In this paper, this property is leveraged to introduce a branch-and-prune method specially tailored for solving such systems of equations. The new method is objectively simpler (in the sense that it is easier to understand and to implement) than previous approaches relying on general techniques such as interval Newton methods or methods based on Bernstein polynomials or linear relaxations. Moreover, it relies on two basic operations — linear interpolation and projection onto coordinate planes— that can be efficiently computed. The generality of the proposed method is evaluated on position analysis problems with 0-, 1-, and 2-dimensional solution sets, including the inverse kinematics of serial robots and the forward kinematics of parallel ones. The results obtained on these problems show that the efficiency of the method compares favorably to state-of-the-art alternatives. |
|---|