Least-Square Optimization of Four-Bar Constraints

5
Zheng Liu J. Angeles IVem, ASME Mccill Research Centre for lntellig€nt Machines, Department of Mechanical Engineering, Mccill Universily, Montreal, ouebec, Canada H3A2K6 1 Introduction The sylthesis of fou-bar function-g€nerating linkages is a classicaltopic in kinematics. The problem consistsof finding all the relevant paramete$ of a four-bar liikage that can pro- duce a presc bed set of ,n input-output pairs { r,lr, Ci} fl, where l, and 6 denote the input and output variables, respectively, as shown in Figs. I and 2. Let z be the numberof indep€ndent parameters required to define the four-bar linkage. For planat linkagcs we have z = 3, while for spherical linkages rt = 4. The synthesisproblem can be termed exsct or spproximate, depending on th€ relationship between tn and n. This paper focuseson the approximate-synthesis problem, the exact syn- thesis being regardedas a particular case of the forme!. Thus, the approximate enor needs to be established first. In this context, two t'?es of error are usually defined, namely desigz error and structural error (Tinubu and Gupta, 1984).The for- mer is based on the error residual in the i[put-output equation, which was first proposed for planar linkages by Freudenstein (1955) ard waslater extended to the spherical alld spatial cases by Hartenberg and Denavait (1964). The latter is defined as the difference between the actual and the desiredoutput angles coresponding to an itrput angle. The two tj?es of error are related to each other as shown by Tinubu ad Gupta (1984) and Angeles (1989). As far as the approximate synthesis of four-bar function generators is conc€med,intensiveresearch work hasbeendone in the past. Freudenstein (1955)first proposedan algebraic formulatiou for the approximate synthesis equation, which was later used and exteqded by other researchers (Suh and Rad- Conlributd by the Mechanisms committ€e ald presented ai the Desip Tech- nical Confcrence, Chicago, IL, Sept. 16-19, 1990, of TrE AirEr.rcAN SocEry oF MEcarxrcd ENdNErr.s. Manuscdpt receiv€dMarch 1990.Associate Te€h- nical Editor: J. M. Mccarthy. Joumal of Mechanical Design Flg.2 Sphsiical RFFFlour.bar linkage Least-Square Optimization of Planar and Spherical Four-Bar Function Generator Under Mobility Constraints An optimizstion scheme for lour-bar Junction generators under mobility constraints, which can be applied to both planor and spherical four bar linkqges, b prcsented in thb poper. The desigj'l. efior, deJined as the rcsidual in the input-output equation, is minimized ouer the uector of linkage parqmeters. The mobility constraints, given as a set of inequslities, arc conerted into equalities by introducing slsck oa sbles- The problem b thus lormulated as an equality-constrained minimization problem, uthich b then solued using the orthogonal-decomposition algorithm, an iteratiw numerical method intrcduced ebewhere- To reduce the dimensional unbalance, which often occars in soluing a synthesis problem, a penalty function is combined with the ortginal objectiue function, whose minimization leads to dimensionslly bslonced linkoges. A numericsl example is included. Fig. 1 Planar FnBB lour.bar linkege \oJl\ \- / "'I}.. ry'\ DECEMBER 1992, Vol. 114 , 569

Transcript of Least-Square Optimization of Four-Bar Constraints

Page 1: Least-Square Optimization of Four-Bar Constraints

Zheng Liu

J. Angeles

IVem, ASMEMccill Research Centre for

lntellig€nt Machines,Department of Mechanical Engineering,

Mccill Universily,Montreal, ouebec, Canada H3A2K6

1 IntroductionThe sylthesis of fou-bar function-g€nerating linkages is a

classical topic in kinematics. The problem consists of findingall the relevant paramete$ of a four-bar liikage that can pro-duce a presc bed set of ,n input-output pairs { r,lr, Ci } fl, wherel, and 6 denote the input and output variables, respectively,as shown in Figs. I and 2. Let z be the number of indep€ndentparameters required to define the four-bar linkage. For planatlinkagcs we have z = 3, while for spherical linkages rt = 4.The synthesis problem can be termed exsct or spproximate,depending on th€ relationship between tn and n. This paperfocuses on the approximate-synthesis problem, the exact syn-thesis being regarded as a particular case of the forme!. Thus,the approximate enor needs to be established first. In thiscontext, two t'?es of error are usually defined, namely desigzerror and structural error (Tinubu and Gupta, 1984). The for-mer is based on the error residual in the i[put-output equation,which was first proposed for planar linkages by Freudenstein(1955) ard was later extended to the spherical alld spatial casesby Hartenberg and Denavait (1964). The latter is defined asthe difference between the actual and the desired output anglescoresponding to an itrput angle. The two tj?es of error arerelated to each other as shown by Tinubu ad Gupta (1984)and Angeles (1989).

As far as the approximate synthesis of four-bar functiongenerators is conc€med, intensive research work has been donein the past. Freudenstein (1955) first proposed an algebraicformulatiou for the approximate synthesis equation, which waslater used and exteqded by other researchers (Suh and Rad-

Conlributd by the Mechanisms committ€e ald presented ai the Desip Tech-nical Confcrence, Chicago, IL, Sept. 16-19, 1990, of TrE AirEr.rcAN SocEryoF MEcarxrcd ENdNErr.s. Manuscdpt receiv€d March 1990. Associate Te€h-nical Editor: J. M. Mccarthy.

Joumal of Mechanical Design

Flg. 2 Sphsiical RFFF lour.bar linkage

Least-Square Optimization ofPlanar and SphericalFour-BarFunction Generator Under MobilityConstraintsAn optimizstion scheme for lour-bar Junction generators under mobility constraints,which can be applied to both planor and spherical four bar linkqges, b prcsentedin thb poper. The desigj'l. efior, deJined as the rcsidual in the input-output equation,is minimized ouer the uector of linkage parqmeters. The mobility constraints, givenas a set of inequslities, arc conerted into equalities by introducing slsck oa sbles-The problem b thus lormulated as an equality-constrained minimization problem,uthich b then solued using the orthogonal-decomposition algorithm, an iteratiwnumerical method intrcduced ebewhere- To reduce the dimensional unbalance,which often occars in soluing a synthesis problem, a penalty function is combinedwith the ortginal objectiue function, whose minimization leads to dimensionsllybslonced linkoges. A numericsl example is included.

Fig. 1 Planar FnBB lour.bar linkege

\ o J l \\ - /"'I}..r y ' \

DECEMBER 1992, Vol. 114 , 569

Page 2: Least-Square Optimization of Four-Bar Constraints

,i,'o,={T:!, "oro'=k,

r,=4:H!,":?,o:Zwhere aj, for i = 1,2,3,4, denotes the length of the ,th l ink(Fig. l). For spherical RRRR four-bar linkages, k is a 4di- Tablet trtobitity conditions ot ptanar and sphedc.l BBRn four.bar link'mensional vector, whose components are glven as ages

k2cosoa=--

! r+ t6 -4

where all the angles are assumed to lie within the range flom0 to r', and k: < l.

Given the set of the input-output pairs {ry'i' dili, we enobtain a system of m equations from Eq. (l), namely,

. f ( { i , d r , k ) = 0 , i = r , 2 ' . . . , m ( 6 )

which is linear in k, and hence, Eq. (6) can be written in theform of

A k = b

For planar linkages, A and b are given as

Linbt t p.Cofldiddrs to. F,[-Mo$olht

'Input lial Ostpot lint

Pl.n.r RRRn ( t r+ t r l l< ( r+r r l r

( r r - r ! ) t<0- t r ) r

( r t+ r2) r<(1+r . )2

1tr - r,12 31r -rt;t

Sph.r-El RRPR

toor-b.. linbs€

(ar +t!)r S (b - r.)r

(h -r!)r S {r! + r.)r

( r r - r .12<( r2+h l I

(rt + &)r < (i, -,t!)r

cliffe, 1967; Suh, 1968; Mohan Rao et al., 1973; Luck, 1976).wilde (1982, 1983) applied elror lineadzation techniques forthe synthesis problern, while Tinubu and Gupta (1984) solvedthe problem with elimination of branch defect. However, veryfew papers have dealt with the mobility condition dilectly inthe synthesis procedule, Although many qiteria for mobilityanalysis of different t]?es of linkages have been developed,including them in the optimization procedure remains a prob-lem. The main difficulty here is the inequalities involved, whichincrease the complexity of the synthesis procedure. In rnanypractical problems concerning the design of four-bar functiongellerators, mobility requirements are present, and in most ofthe cases, using a set of inequalities to define the full-mobilityregion ofthe input or output link of a four-bar linkage becomesinevitable. The significance for devising a general method fortackling these constraints is hence apparent.

The optimization scheme preseuted in this paper aims atmidmizing the design €Iror in solving the problem of synthesisof a four-bar function gen€rator under mobility conditions.The objective functioD is wdtten in a quadratic form aIId thewhole problem is formulated as a constrained nollinear least-square minimization problem. By introducing slack variables,the inequalitics representing the mobility conditions are readilytnnsformed into equalities, which allows us to solve the prob-lem in the context of equality-constraitred nonlinear least-squares, for whose solution very effective procedues are avail-able. Thus, the adsing problem is solved using the orthogonal-decomposition algorithm, as iutroduced in Angeles, Ande$on,and Gosselin (1987). Additionally, penalty terms are added tothe objective function in order to eliminate the problems ofdimensional unbalance. The optimization procedure is illus-trared with a numerical example.

The method presented here can be used for the synthesis ofplanar and spherical four-bar function generators. Spatial four-bar linkages, howeve!, do not lead to simple equality mobilityconstraints. and hence. are not considered in this paper. Dis-cussed next is the input-output equation of these two types of[nkages, which play an important role in the synthesis pro-cedure.

2 Input-Output Analysis of Planar and Spherical Four-

Bar LinkagesLet ly' alld d represent theinput and output angl€s ofa planar

or spherical RRRR four-bar linkage, as shown in Figs. I and2. An equation, called the input-output equation, exists thatdefines the relation between the input and output angles' lt iswritten as

fd,,o,k)=o (r)where k is known as the vector of linkage parameters. For theplanar RRRR li*age, k is a 3-dimensional vector whose com-ponents are defined as

where er, for i = 1,2, 3,4, is the angle between each twoadjacent joint axes, as shown in Fig. 2. From the klown valueof k, the link lengths in terms of its components are obtainedby simply inverting the above equations, ln the planar case,the inversion yields

. la t = I ' g 2 = ; '

^2

,,1 t4+t4+ 4t4- ztc'*,*'or=____ltE7 ({,

I

^3

while in the spherical case, we have the following:

k4cos.r2=---:,

" , l r+A-H

(5)

v

ft cosdr -cos'r'r'l

I I cos42 - cosry', I^=1, : : l'I t cos4- -cos'y',1

(7)

(8a)

(2)

. COSoICOSd2COSa4 - COS@3^ j -

---------_--:------

- Slna2slnd4

, sindlcosd4Kt =-"---

S lnda f1 l

k3 = cosol

, sincrrcosc2K4=- ' ' -

Slnc2

570, Vol . 114, DECEMBER 1992

Ik2hk4- h( - tar'r| _ ---:-----:.---..:-:.-:ij-.'

\t - 14+ ]d't (r + t4- I4\'

Transaclions ot the ASME

v

Page 3: Least-Square Optimization of Four-Bar Constraints

f "o(/' - d')'l

r= | "ot '* ' -o ' t ;l : lLcow- - d')l

can be minimized directly with the value of k given as (Goluband Van Loan, 1983):

(80) p- 6rA;-rArb 02)However, this direct scheme will not guarantee the optimallinkage to meet any mobility conditions. Here, we propose aleast-square optimization scheme subject to equality con-straints that will satisfy the mobility conditions. We will usex as the design vector alrd express the design elror as

(13)

(14)

where W is a positive-definite constant weight mafix whichaccounts for the necessary normalization and scaling.

Now that the inequality constraints have been properlytreated and conveted into equality form as show! in Eqs. (l0aand r), we can use them directly in the formulation. To thisend, they are glouped in a vector function in the form of

8(x)=0 (15)

whsre 0 is the zero vector, whose dimension, identical to thatof g, depends on the number of scalar equations imposed bythe mobility conditions. The design vector x is defined as:

x = l k r . . . , k , . k , ' r , . . . . k , _ l r ( 1 6 )where & for i = 1,.,., r are the l inkage parametets as definedin Sec t ion 2 , wh i le k ; fo r i : n + 1 , . . . , ' r + /a re the s lackvariables, which are constraint-condition dependent; for ex-ample, if the full mobility condition is imposed only on theinput or output link, then / : 2; ifthese conditious are imposedon both the input and output links, rhen / = 4. Due to theextra variables, matrix A in Eq. (13) will have extra zsro col-umlls comparing with those given in Eqs. (8a and 9a). There-fore, the problem is formulated as minimizing the Euclideannorm of e subject to the equality constraint g(x) = 0, i.e.,

and, in the spherical case, we have

f t cos'y'r cos{rcosdr -cosOll

A=l l .o : / t cosv2cosd2 -cosoz

l ,

l; -*- cos,p.coso. -coso,l

[ ']"Yol"t'I' I Srnt rsrnOr I'=l'l

Lsrnvuslnozl

(9a)

(eb)

e = b - A xThe objective fulction is w'ittelt as follows:

z1x; = j e?we

Clearly, A and b are functions of the given input-output pairsand the ith row of A and the ith component of b are functionsof ry'i and dt only. Equation (7) is the basic equation in formingthe objective function in the optimization procedure.

3 Treatmetrt of Mobility ConditionsIn this section, the constnint relations suitable for our prob-

lern are derived. The mobility conditions of four-bar planarand spherical linkages have been extensively studied in the past(Grashof, 1883; Blicajd, 1927; Duditza and Ditt ch, 1969;cupta and Radcliffe, 1971; Angeles and Bernier, 1987). Forourproblem, the mobility criterion for planar four-bar linkagespresented in Gosselin and Angeles (1988) and the one for spher-ical four-bar linkages given in Liu (1988) are employed. Theyare stated in Table 1.

The colditions of Table I are the basic inequalities for de-riving our consffaint equations. Notice that these consfaintsare given in terms of quadratic positive functions on both sidesof the inequalities listed in Table l. We can make both sidesequal by simply adding a third positive term oll the smallerside, thereby replacing the inequalities by equality constraints.This additional termii chosen as tbe square of ar additionalvariable, which will be taken into account in the optimizationprocedure. For example, to obtain the expression for the full-mobility condition of the input link of a spherical four-barlinkage, we introduce two slack variables, k5 and k6, whichleads to the followine:

gr= (k2+ k)z - (k-r- ko])2 + ti=Ogr= (k2- k)2 - (h+ ka\2 + ti=O

(l0a)

(l0D)

subject to

It is now an easy task to verify that both e(x) and g(x) arecontinuous and differentiable functions of x, ther€by meetingthe basic requirements for using a gradient method of solution,such as the orthogonal-decomposition algorithm. As intro-duced by Angeles, Andercon, and Cosselin (1987), the saidalgodthm is an iterative scheme aDd has attractive convergenceproperties. lt has been used by Ltu (1988) to solve the problemof synthesis of sphe cal four-bar path generators and provedto be efficient for equality-consfiained least-square optimi-zation problems. Additionally, the continuity of both the ob-jective and constraint functions allow us to apply continuationtechniques (Wasserstrom, 1973; Richte! and Decarlo, 1983)in the optimization procedure, in case au initial gu€ss reason-ably close to the solution is difficult to locate. In using thisalgorithm, the Jacobian matrices of both the error functione(x) and the constraint function g(x) are needed. These arecomputed as explai!€d below.

From Eq. (13), the Jacobian matdx of the error functioncan be readily obtained as

d e d- ;= ; O-Ax)= -A (18)Itx dx

while the Jacobian matrix of the constraint futrction does nothave a general form and is dealt with on a case-by-case basis.

One problem that may arise in the optimization procedureis dimensional unbalance, which sometimes leads to very largelink length ratios. A means to cope with this reiies on the

min e(x)

9(x) = o

(t7a)

( t7 b )

and kr and t6 will be included as additional design parametersin the optimization procedure. This also applies to other in-equalities in Table l. This will ease the problem formulation,and, eventually, its solution-

4 Optimization SchemeNow the method for the optimum synthesis of four-bar

fulction gelerators with mobility considerations on the inputor output lillk is outlined. As mentioned before, the optimi-zation scheme focuses on minimizing the design elror, whichis defined as the error residuals in the iaput-output equation.If \re use e to represent this eIIo!, we have

e = b - A kwhere e and b are rn-dimensional vectors, tn being the numberof prescribed input-output pairs: A is an m x n matrix andk is au z-dimensional vecto!, where'r = 3 for planar linkagesalrd ? : 4 for sphedcal ones. If n1 > n, F,q. ('7) is an over-determined system of equations and the Euclidean norm of e

Journal ol Mechanical Design

( l t )

DECEMBER 1992, Vol. 114 / 571

Page 4: Least-Square Optimization of Four-Bar Constraints

Fig. 3 The optimum tinkage

introduction of penalty terms in the objective function, whichare defined in such a way that their value increases with di-mensional unbalance and deqeases when the link lengths be-come proportionate. To suit thc formulation adopted at theoutset, based on least-squares, we write the penalty term in aquadratic form. For example, if we introduce ap'dimensionalpenalty function p(x), w€ can write it in the following form

Table 2 Input-ouiput .elations

{ (deg.)

C (dee.)

we have an overdetermined linear system of equations, whichwill be solved together with the constraint conditions by usingour optimization method.

For comparison purposes, the problem is fint solved byusing Eq. (12). To this end, rve minimize the design elrordirectly, without considering any constraints on the mobilityconditions. This leads to the following results:

kr = 1.3311, kz= -0-1730, kt= - 0.4421

and it is easy to verify, using Table l, that the input link is arocker, which does not meet the mobility condition imposed,although the Euclidean norm of the design error is very small.Now, our optimization scheme is applied to include the mo-bility consuaint. From Table 1 we can readily obtain the con-straint equatious, uamely,

_ . f 1k , + t r ; ' - ( t - k ) ' z+ t?o1g ( x ) = | . . " , l = o-

| ( , t r - r t ) ' - ( t -k2) '+ l4 l

where 0 is the 2-dimensional zero vector and ka and k5 are theslack va ables. We then have the design vector w tten as

x= [kr. k2, kr, k4, kr{

The Jacobiau matrix of the constraint function is readily com-puted as

dg]Jxl ̂ f k1+kt -l-kz kt+ki ka of- = z l I

dx Lkr- k, | - kz kt- kt 0 k5l

Since x has included two extra components, namely, ka andft5, matrix A, given in Eq. (8c), has to be modified; that is,two additional zero vectors will appear as its 4th and 5thcolumns. The ith row of maffix A then becomes

,4;= [, cos{i, - cos/i, 0, 01, i= 1, 2, . . . , n

Now we can use the optimization method presented in thispapg!. From the initid guess x' = 10.28, 0.74,0-12, 1.69,0.21', we end up with the following solution:

kt=O.3248, kz=O.5815, k= -0.009725,

ka=1.556, ks=0.?Al5

the Euclidean norm of the error function being 5 x l0-?,which is larger than the one obtained for the unconstrainedleast-square problem. The coresponding link lengths are

at=1, a2=1.702, q=1O3.4, aa= 102-g

Although the mobility conditions are satisfied now, this is,unfortunately, still not a good result since the dimensionalunbalanc€ is very serious. As we can see, a3 and aa are morethan 100 times larger than 4r. To solve this problem, we resortto the penalty-function method to penalize this unbalance.From Eq. (2), i! is apparent that, when all the link lengths areidentical, we have kt = kz = kt = ka = l: when vadationsin the link lengths occur, the values of k's tum to be eithergreater or smaller than 1. This gives us the basic idea to formthe penalty function. Indeed, we define the following

I l l l l 'p(x)= | kr -;, k2-;, K3-; I

Clearly, when all the link lengths are identical, p(x) vanishes;otherwise, its norm becomes large as the dimensional unbal-ance grows. Computitrg now the penalty function f(x) defined

70 80 90 100 1r0 B0 140

tO 45 50 58 64 74 80 \J

(le)

where R is a diagonal matrix containing penalty factors, i.e.,

R=d iag( r r , 12 , - . - , rp ) (2O)

whil€ p is suitably defined as explained in the example. More-over, the penalty factors fr, for i = l, . . . , p, will be adjustedin the optimization procedure. Now a new objective functionZ(x) can be writteD as

Z(x) = z(x) + f(x)

t - l=i erwe+i prRp

=i rrsr (zt)where

f e l f w o - . . 1r= l

' l - s= l " ^ "o l e2 \

LPI Loe,^ R I0p*- a]ad o^'p being the p x m ar,d m x p zero matdces,respectively. The Jacobian maftix of the new funciion f(x) iscomputed as

df f de dplr== | .:-, -:- | \zr)ax Ldx dx)

where de,/rh has already computed in Eq. (18) arjd dp/dx isproblem dependent.

5 Exampl€A design problem is solved hele to show the application of

the optimization method presented in this paper.It is required to design a planar RRRR four-bar linkage to

meet the input-output relations shown in Table 2. Moreoyer,the input link should be a crank.

The problem consists of seveu given pairs of input-outputangles, i.e., n = 7. For a planar linkage, z = 3, and hence

572 I Vo!.114. DECEMBER 1992

fr*l=lp'np

Transaclions of lhe ASME

v'

Page 5: Least-Square Optimization of Four-Bar Constraints

in Eq. (19) arld adding it to the objective function, the problemof dimensional unba.lance can be controlled. Therefore, wenow can write the objective functiou in the form of Eq. (21)and compute the subjacobian matdx dp(x),/rk as follows

+ r/t4 0O l+l / t?,00

Now we repeat the optimization procedure with the newobjective function and a value of rr = 0.N2, for i = l, 2, 3.The following results are obtained

h=0.215, kz=0.1533, kt=0.2015,

h= 1.103r, ks=0.2463

with the linkage dimensions calculated as:

a t=1 , 02=1.327, a3=4.955, a4= 4 .962

The Euclidean norm in the elror function for this solution is9 x l0-2. As we can see, with the penalty fuoction formed,the link lengths of a3 and ca deqease about 20 times. Theproblen of dimensional unbalance is therefore eliminated. Ob-viously, this solutioD has a larger design elro! than the onewithout the penalty terms, as expected. The optimum linkageis shown in Fig. 3.

6 Conclusions

A method for the optimization of four-bar function gen-entors under mobility consfiaints was plesented, which is ap-plicable to both planar and spherical four-bar linkages. Themethod aims at solving approdmate synthesis problems inwhich the residual in the input-output equation, termed thedesign error, is minimized over the linkage parameters. Themobility conditioo, origiually expressed iB inequality form,was properly treated and converted into equality form by in-troducing slack variables. HeDce, the synthesis problem is for-mulated as an equality-constmined nonlinear least-squareoptimization problem. The orthogonal-decomposition algo-rithm, an iterative numerical scheme, is employed in solvingour problem. The dimensional unbalance that often occurs insolving the synthesis problem is discussed and a penalty-func-tion-based method is proposod in dealing with this problem.While the optimization schem€ works fine for planar andspherical linkages, as discussed in this paper, it can possiblybe extended to other types of linkages, as long as all input-output equation, along with a set of inequalities defining itsmobility region, can be found, that bears a form similar tothat in the Dlanar or soherical cases.

7 AcknowledgmentsThe research work reported here was possible under Que-

bec's IRSST (lnstitut de lecherche en salt€ et en s€curit€ dutravail) Grant No. IRSST-87-06 and NSERC (Natural Sciencesand Engineering Research Council ofCanada) Research GrantNo. A4532.

8 ReferencesAngeles, J., 1989, lRatioral Kinematics, Sqing-Verlag, New York.Angeles, J., and Bernicr, A., 1987, "A General Methoal of Four-Bar Linkage

Mobility Anaiysis," ASME JolaxAt or MEcrr.rMsMs, Tn^NsmslroNs. r D Au-rox noN rN DEsrcN, Vol. 109, No. 2, pp. 197-203.

Angeles, J., Anderson, K., and Cosselin, C., 1987, "An O hogonal-Decom-posilion Algorithm foi Constrained Least-SquaJe Optimi?3tlon," Prcceedingsof the l3th ASME Detign and Automation ConJerence, Boston, Ma. Sepr. 1987,pp.215-220.

Bricard, R., 192?, L€goas de Cininatique, Gafihier-Villars, Paris.Freudenstein, F., 1955, "Approximare Synrhesis of Four-Bar Linkages,',

Tmnsactions of the ASME, vol. 7?, Aug. 1955, pp. 853-861.Colub, G. H., and Van Loan, C. F., 1983, Matrix Computations,The lohns

Hopkins University Press, Balrimore.Gosselin, C., and Antcles, J., 1988, "Mobiliry Analysis of Planar and Sph€r-

ical Linkages At A Clance," Joumal of Compute6 in Mechanical Eneinee ng,July,/Ausust 1988, pp. 5G60.

Grashof, F., 1883, Theorcthische Maschinenl€rre, Bcrlin.Cupta, V. (., and Radcliffe, C. W., 1971, "Mobiliry Analysis of Planar and

Spadal Mechanisms," ASME Joumal of Entinee ng of Industry, Vol. 93, pp.125-130-

Dualidza, Fl., and Dirtrich, C., 1969, "Die BedinsunS€n Fiir die Umlauffe-higkcit SpHrischer Vi€rglied.iger Kurbclgetriebe, " 1n dusttieAn ei*r, V ol. 9t ,pp. 1687-1690.

Han€nb€rg, R. S., and Dcn^\it, J., 1964, Kinematic Synthesis of Linkages,Mccraw-Hill, New York.

Liu,2., 1988, "Optimizarion of Spherical Folr-Bar Path C€nerarors," Mas-ler\ Thesis, Depatmenl of Mechanical Engineering, Mccill University, Mon-

Luck, K., 19?6, "Computersynihese d.s Viergliedrisen riiun ichcn Koppel-g€triebcs vom T)" RSSR," Mechanbm ond Machine Theorr, yol. 11, pp.2l3-225.

Mohan Rao, A. V., Sandor, C. N.,Kohli, D., and Soni, A. H., l9?3, "ClosedForft Synthesis of Spatial Funclion Ceneraaing Mechanhms for ihe MaximumNumber of Precision Points," ASME Jounal of Ensineerins lor Industt!, Vol.95, pp.725-736.

Richter, S. L., and Decarlo, R. A., 1983, "Conrinuarion Methods: Thcoryand Applications," lEtE Trunsactions of Automatic ConLol, Vol. AC-28, No.6, pp. 660-665.

Suh, C. H., 1968, "Design of Space Mechanisms for Rigid-Body Cuidance,"ASME Journal of Engineeiry Jo. Industry, yol. 90, pp. 49-506.

Suh, C. H., and Radcliffe, C. W., 1967, "Synrhcsis of Planar Li*age wirhUse of the Dhplacemenr Mallix," ASME Jounal of Engineetine fot Industtr,vol. 89, pp. 206-214.

Tinubu, S. O., and Cupta, K. C., 1984, "Optimal Synthesis of FuncrionGeDerators without the Branch Defecr," ASME JouRN^! or MEcrra}'rsMs,TRANsMIstroNs, ^xD AuroM^TroN rN DlsrcN, Vol. 106, pp. 348-354.

Walterstron, E., t973, "Numerical Solurions By rhe Continuation Method,"SIAM Reoieta,Yol.15, No. l, pp. 89-119.

Wilde, D. J., 1982, "Error Lincatization in the Least-Squares D€sign ofFunclion Cen€rating Mechanisms," ASME Jo!,'r.Nil. or MEcHrNrc^! DEsroN,Vol . 104, pp.881-884.

Wilde, D. J., 1983, "Degeneracy, Singlrlerity, and Multiplicity in Leasl-SquaresDesiSn of a Funcaion-Cencrating M€chanism, " ASME JonRt{Ar or MEcsrNsMs,TMxsrdssroNs, ̂ xD Aurou noN rN DrsrcN, Vol. 105, pp, 104-107,

dp(*) fl,h, =Lo ool0 0 0 l

t+ t /E o o )

J

Journal of itechanical Design DECEMBER 1992, Vol. 114 I 573