Singular configurations of parallel manipulators (PMs) are special poses in which the manipulators cannot maintain their inherent infinite rigidity. These configurations are very important because they prevent the manipulator from being controlled properly, or the manipulator could be damaged. A geometric approach is introduced to identify singular conditions of planar parallel manipulators (PPMs) in this paper. The approach is based on screw theory, Grassmann–Cayley Algebra (GCA), and the static Jacobian matrix. The static Jacobian can be obtained more easily than the kinematic ones in PPMs. The Jacobian is expressed and analyzed by the join and meet operations of GCA. The singular configurations can be divided into three classes. This approach is applied to ten types of common PPMs consisting of three identical legs with one actuated joint and two passive joints.

This paper extends a recently proposed singularity analysis method to lower-mobility parallel manipulators having an articulated nacelle. Using screw theory, a twist graph is introduced in order to simplify the constraint analysis of such manipulators. Then, a wrench graph is obtained in order to represent some points at infinity on the Plücker lines of the Jacobian matrix. Using Grassmann–Cayley algebra, the rank deficiency of the Jacobian matrix amounts to the vanishing condition of the superbracket. Accordingly, the parallel singularities are expressed in three different forms involving superbrackets, meet and join operators, and vector cross and dot products, respectively. The approach is explained through the singularity analysis of the H4 robot. All the parallel singularity conditions of this robot are enumerated and the motions associated with these singularities are characterized.

Polyhedral scene analysis studies whether a 2D line drawing of a 3D polyhedron is realizable in space, and if so, it gives the results of parameterizing the space of all possible realizations. For generic 2D data, symbolic computation with Grassmann–Cayley algebra is needed in the analysis. In this paper, we propose a method called parametric calotte propagation to solve the realization and parameterization problems for general polyhedral scenes at the same time. In algebraic manipulation, parametric propagation is more efficient than elimination. In applications, it can lead to linear construction sequences for nonspherical polyhedra whose resolvable sequences do not exist.