SUMMARYThis paper presents the computation of the safe working zone (SWZ) of a parallel manipulator having three degrees of freedom. The SWZ is defined as a continuous subset of the workspace, wherein the manipulator does not suffer any singularity, and is also free from the issues of link interference and physical limits on its joints. The proposed theory is illustrated via application to two parallel manipulators: a planar 3-R̲RR manipulator and a spatial manipulator, namely, MaPaMan-I. It is also shown how the analyses can be applied to any parallel manipulator having three degrees of freedom, planar or spatial.
It is natural to employ an optimization algorithm for the approximate kinematic synthesis of linkages. The hope is to find some superior points in the design space that indicate dimensions that are practically useful. One way to achieve this is to find all minima of an objective, then to filter them so the best remain. However, the prospect of finding all minima is bleak unless the optimization problem at hand is particularly small. In this work, we show how to find nearly all minima for a large optimization problem using polynomial homotopy continuation in the approximate synthesis of a four-bar path generator. The system at hand has a Bézout bound of 543,848,665 and a Schnabel estimate to the maximum number of stationary points of 6 · (303,249 ± 713), within a 95% confidence interval. At least with regards to mechanism synthesis, this work represents the largest scale deployment to date of homotopy continuation to solve an unconstrained optimization problem. The challenges of scaling and suggestions for design are given. Example usage for the design of a leg mechanism is given. On the mechanism design front, this is the first presentation of a nearly complete (within the limitations of numerical discernment) solution of the general four-bar optimal path synthesis problem.
The kinematic synthesis equations of fairly simple planar linkage topologies are vastly nonlinear. This indicates that a large number of solutions exist, and hence a large number of design candidates might be present. Recent algorithms based in polynomial homotopy continuation have enabled the computation of entire solution sets that were previously not possible. These algorithms are based on a technique that stochastically accumulates finite roots and guarantees the exclusion of infinite roots. Here we apply the Cyclic Coefficient Parameter Continuation (CCPC) method to obtain for the first time the complete solution of a Stephenson III six-bar that traces a path and coordinates the angle of its input link along that path. Linkages of this type, called timed curve generators, are particularly useful for controlling the motion of an end effector point and influencing its transmission properties from a rotary input. For a numerically general version of the synthesis equations, we computed an approximately complete set of 1,017,708 solutions that divides into subsets of four according to the Stephenson III cognate structure. This numerically generic solution set essentially represents a design tool. It can be used in conjunction with a parameter homotopy to efficiently obtain all isolated roots of other systems of this same structure that correspond to a specific synthesis task. This is demonstrated with two example synthesis tasks.
A subset D of a vertex set V of a graph G is a chromatic strong dominating set if D is a strong dominating set and χ(< D >) = χ(G). The minimum cardinality of chromatic strong dominating set is called chromatic strong domination number of G and is denoted by γ c s (G). In this paper we study relationship between strong domination and chromatic strong domination of a graph.
Following recent work on Stephenson-type mechanisms, the synthesis equations of Watt six-bar mechanisms that act as timed curve generators are formulated and systematically solved. Four variations of the problem arise by assigning the actuator and end effector onto different links. The approach produces exact synthesis of mechanisms up to eight precision points. Polynomial systems are formulated and their maximum number of solutions is estimated using the algorithm of random monodromy loops. Certain variations of Watt timed curve generators possess free parameters that do not affect the output motion, indicating a continuous space of cognate mechanisms. Packaging compactness, clearance, and dimensional sensitivity are characterized across the cognate space to illustrate trade-offs and aid in selection of a final mechanism.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.