尖点和非尖点机器人操作器

A review of cuspidal serial and parallel manipulators

Cuspidal robots can move from one inverse or direct kinematic solution to another without ever passing through a singularity. These robots have remained unknown because almost all industrial robots do not have this feature. However, in fact, industrial robots are the exceptions. Some robots appeared recently in the industrial market can be shown to be cuspidal but, surprisingly, almost nobody knows it and robot users meet difficulties in planning trajectories with these robots. This paper proposes a review on the fundamental and application aspects of cuspidal robots. It addresses the importan…

Necessary and sufficient condition for a generic 3R serial manipulator to be cuspidal

Cuspidal robots can travel from one inverse kinematic solution to another without meeting a singularity. The name cuspidal was coined based on the existence of a cusp point in the workspace of 3R serial robots. The existence of a cusp point was proved to be a necessary and sufficient condition for orthogonal robots to be cuspidal, but it was not possible to extend this condition to non-orthogonal robots. The goal of this paper is to prove that this condition stands for any generic 3R robot. This result would give the designer more flexibility. In the presented work, the geometrical interpretat…

尖点6R机械臂的路径规划与优化

Path Planning and Optimization for Cuspidal 6R Manipulators

本文提出针对尖点6R机械臂的路径规划与优化方法，通过构建IK解图寻找最优路径，并首次识别出ABB GoFa等尖点机器人，解决了其连续关节运动难题。

Deciding Cuspidality of Manipulators through Computer Algebra and Algorithms in Real Algebraic Geometry

Cuspidal robots are robots with at least two inverse kinematic solutions that can be connected by a singularity-free path. Deciding the cuspidality of generic 3R robots has been studied in the past, but extending the study to six-degree-of-freedom robots can be a challenging problem. Many robots can be modeled as a polynomial map together with a real algebraic set so that the notion of cuspidality can be extended to these data. In this paper we design an algorithm that, on input a polynomial map in $n$ indeterminates, and $s$ polynomials in the same indeterminates describing a real algebraic s…