An Optimization-Based Algorithm for Determination of Inclusive and Constant Orientation Workspace of Parallel Mechanisms
Workspace of a mechanism is generally defined as the region of space which end-effector of that mechanism can reach. Determination of workspace is an important task in the design of a mechanism. However, for parallel mechanisms, due to the complexity of solving the forward kinematic equations, determination of workspace is much more complicated than for serial mechanisms. In the literature, time-consuming numerical methods, such as point-by-point searching, are usually employed for this purpose. In this paper, an optimization-based algorithm is introduced for the boundary determination of inclusive and constant orientation workspaces of parallel mechanisms. In the proposed algorithm, thanks to applying the optimization approach along with point-by-point searching, the dimension of the point-by-point searched space (and hence, the consumed time) are significantly reduced. While different optimization methods can be used in the proposed algorithm, Particle Swarm Optimization is utilized as the optimization technique in this paper. The proposed algorithm is illustrated through its application to a planar and a spatial parallel mechanism.