Efficiency Improvement of Measurement Pose Selection Techniques in Robot Calibration

Size: px
Start display at page:

Download "Efficiency Improvement of Measurement Pose Selection Techniques in Robot Calibration"

Transcription

1 Effcency Iproveent of Measureent Pose Selecton echnques n Robot Calbraton Y.Wu,2, A. Klchk,2, A. Pashkevch,2, S.Caro 2, B.Furet 3 Ecole des Mnes de Nantes,44307, Nantes, France 2 Insttut de Recherche en Councatons et Cybernétque de Nantes (IRCCyN), 4432, Nantes, France 3 Unversté de Nantes, 44322, Nantes, France (e-al:{ yer.wu, alexandr,klchk, stephane.caro@rccyn.ec-nantes.fr, benot.furet@unv-nantes.fr) Abstract: he paper deals wth the desgn of experents for anpulator geoetrc and elastostatc calbraton based on the test-pose approach. he an attenton s pad to the effcency proveent of nuercal technques eployed n the selecton of optal easureent poses for calbraton experents. he advantages of the developed technque are llustrated by sulaton exaples that deal wth the geoetrc calbraton of the ndustral robot of seral archtecture. Keywords: robot calbraton, easureent pose selecton, test-pose approach. INRODUCION In the usual engneerng practce, the accuracy of a anpulator depends on a nuber of factors. Usually n robotcs, the geoetrc and elastostatc errors are the ost sgnfcant ones. her nfluence on the robot postonng accuracy hghly depends on the anpulator confguraton and essentally dffers throughout the workspace. o acheve good accuracy n all workng ponts, adequate geoetrc and stffness odels are requred. Whle the odel structure s usually well known, the dentfcaton of the odel paraeters (calbraton) s rather te consug and requres essental experental work. For ths reason, optal selecton of easureent poses for robot calbraton s an portant proble, whch s stll n the focus of nuerous research papers (Daney 2002, Sun 2008). At present, the an actvty n ths area s concentrated around the geoetrc calbraton (Khall 2002). On the other hand, the elastostatc calbraton whch s also very portant for any applcatons (such as precse achnng) has attracted less attenton of the researchers (Meggolaro 2005). However, for both of these calbraton procedures, the proble of easureent pose selecton s one of the key ssues allowng to reduce essentally the easureent error pact (Klchk 20). At frst sght, ths proble can be solved usng well known results fro the classcal desgn of experents theory. However, because of the specfcty and nonlnearty of the anpulator geoetrc and elastostatc odels, the proble soluton s not so obvous. he an dffcultes here are n the area of defnton of a reasonable optalty crteron (whch has clear engneerng sense) and also n effcent soluton of the relevant optzaton proble, whch has rather hgh denson. Aong related works, t s worth entonng several papers. he ajorty of the easureent pose selecton technques reles on the optzaton of soe functons dependng on the sngular values of the dentfcaton Jacoban. For exaple, Zhuang used genetc algorth for zaton of the condton nuber of ths atrx (Zhuang 996). In other work (Daney 2005), to decrease the senstvty to local a, Daney developed the local convergence ethod and abu search technque based on the observablty ndex. However, the perforance easures used n these works are rather abstract and are not drectly related to the robot accuracy. Besdes, the related objectve functons are very dffcult for the optzaton due to exstence of a nuber of local a. o fnd the global one, heurstc search s usually used as the nuercal algorths, whch often requre tedous coputatons. All these otvate the research drecton of ths work. In ths paper, the proble of optal desgn of calbraton experents s studed for the case of robot anpulator of seral archtecture. In contrast to other works, the optzaton proble related to easureent pose selecton s forulated usng the proposed perforance easure (test-pose approach), whch has clear physcal eanng and s drectly related to robot accuracy. he an attenton s pad to the effcency proveent of the related nuercal routnes. 2. PROBLEM SAEMEN 2. Geoetrc and Elastostatc Models of Manpulator In ndustral robot controllers, the end-effector poston of the anpulator s usually coputed usng the geoetrc odel. For soe specfc applcatons, such as hgh-speed achnng that generate essental external loadng, the elastostatc odel should be also used. However, n practce, the robot geoetrc paraeters essentally dffer fro the noal values declared n techncal specfcatons and vary fro one robot to another. In addton, elastostatc paraeters of the anpulator are not provded by the robot anufacturers and can be dentfed fro the experents only. So, the anpulator

2 odel paraeter dentfcaton s an portant step n practcal applcaton of ndustral robots. he anpulator geoetrc odel provdes the poston/orentaton of robot end-effector as a functon of the jont varables and ts nherent paraeters. hs odel s usually presented as a product of hoogeneous transforaton atrces, whch after soe transforatons can be presented as the vector functon p g q, П () where vector p denotes the end-effector poston, vector q aggregates all jont angles and П are the vector of unknown paraeters to be dentfed. hese unknowns dffer wth the appled paraeterzaton ethods n robot geoetrc odellng, such as the classcal Denavt and Hartenberg approach and ts odfed verson (Khall 986). In ths paper, there are consdered the ost essental coponents of the vector П, whch are the devatons of the robot lnk lengths l and the offsets q n the actuated jonts. Snce the devatons of geoetrcal paraeters П are usually relatvely sall, calbraton usually reles on the lnearzed odel p g q, П J q, П П (2) 0 g 0 whch ncludes the conventonal geoetrc Jacoban J g q, П0gq, П0/ Π coputed for the noal geoetrc paraeters. П 0 he elastostatc propertes of a seral robotc anpulator represent ts resstance to deforatons caused by external forces/torques and are usually descrbed by the Cartesan stffness atrx, whch s coputed as K C C θ θ θ K J K J (3) where Kθ s a dagonal atrx that aggregates the jont stffness values (that are the unknowns to be dentfed) and Jθ s the correspondng elastostatc Jacoban. hs odel can be derved usng the vrtual jont ethod, whch descrbes all elastostatc propertes of coplant eleents by localzed vrtual sprngs located n the actuated jonts (Salsbury 980). Usng the Cartesan stffness atrx, the elastostatc odel (or force-deflecton relaton) can be expressed as θ θ θ w J K J p (4) where p s the poston deflecton at the robot end-effector caused by the external wrench w, whch ntegrates both the external force and torque. hs lnear relaton can be further used for the calbraton where the desred paraeters to be dentfed are the coponents of atrx. In the frae of ths work, several assuptons concernng calbraton of these odels are accepted: A: For the geoetrc calbraton, each calbraton experent produces two vectors p, q, whch defne the robot end-effector dsplaceents and correspondng jont angles. he lnear relaton between the errors n geoetrc paraeters and the end-effector poston devatons can be wrtten as p = J ( q ) Π (5) g K θ where Jg ( q ) s the Jacoban atrx that depends on anpulator confguraton q and vector Π collects the unknown paraeters to be dentfed. A2: For the elastostatc calbraton, each calbraton experent produces three vectors p, q, w, where w defnes the appled forces and torques. In accordance wth (Pashkevch 20), the correspondng appng fro the external wrench space to the end-effector deflecton space can be expressed as p = θ( ) J q kθjθ( q) w (6) where k θ s a atrx that aggregates the unknown coplance paraeters k,...,k n to be dentfed. Hence, the calbraton experents provde the set of vectors p, q and p, q, w that allow us to estate the devatons n geoetrc paraeters П (copared to the noal values) and absolute values of the elastostatc paraeters ncluded n the dagonal atrx k θ. 2.2 Identfcaton of the Model Paraeters he proble of paraeter dentfcaton of the robot anpulator can be treated as the best fttng of the experental data by correspondng odels. hese data are easured under several assuptons concernng the easureent equpent: A3: he calbraton reles on the easureents of the endeffector poston only (Cartesan coordnates px, py, p z). A4: he easureents errors ε accoodated n each easureent of end-effector poston are treated as ndependent dentcally dstrbuted rando values wth zero expectaton and standard devaton. For coputatonal convenence and takng nto account the nfluence of easureent errors, the geoetrc and elastostatc odels descrbed by separate lnear equatons (5) and (6) can be expressed n the followng ntegrated for p B( q ) Xε (7), where X Π k collects all unknown paraeters (both geoetrc and elastostatc ones), and the atrx B vares dependng on dfferent calbraton cases J 0 B 0 A 33n J A 32n 3n 32n 3n 32n 3n, for geoetrc paraeters, for elastostatc paraeters, for both paraeters where J s the Jacoban atrx that can be obtaned by dfferentatng the anpulator geoetrc odel wth respect to the desred paraeters; and atrx A can be coputed as Aq (, w) ( ) ( ),..., n( ) n ( ) J q J q w J q J q w (9) where Jn ( q ) s the n-th colun vector of the Jacoban atrx for the -th experent. n s the nuber of jonts. Usng usual approach adopted n the dentfcaton theory, the estated unknown paraeters Xˆ Πˆ, kˆ θ can be obtaned usng the least square ethod, whch yelds (8)

3 BB ˆ X B p (0) Usng ths expresson, t can be proved that the covarance atrx for the dentfcaton errors n the paraeters X can be coputed as ˆ 2 cov( X) B B () where s the standard devaton (s.t.d.) of the easureent errors. Hence, the pact of the easureent errors on the paraeter dentfcaton accuracy s defned by the atrx su BB that s also called the nforaton atrx. It s obvous that, fro practcal pont of vew, the covarance atrx should be as sall as possble. However, strct atheatcal defnton of ths noton s not trval and a nuber of dfferent approaches are proposed n lterature. In ost of the related works, the optal easureent poses are obtaned based on zaton of the covarance atrx nor (Atknson 992). hs approach ay provde a soluton, whch does not guarantee the best poston accuracy for typcal anpulator confguratons defned by the anufacturng process. hus, here t s proposed the ndustry-orented perforance easure, 2 0, whch s defned as the ean square error n the end-effector poston after copensaton. o develop ths approach, let us ntroduce several defntons: D: Plan of experents s a set of robot confguratons Q and correspondng external loadngs W that are used for the easureents of the end-effector dsplaceents and further dentfcaton of the desred paraeters. D2. he accuracy of the error copensaton 0 s the dstance between the desred end-effector poston and ts real poston acheved after applcaton of error copensaton technque. D3. he anpulator test-pose s one or set of robot confguratons Q and correspondng external loadngs 0 W 0 for whch t s requred to acheve the best error copensaton 2 (.e. 0 ). In the frae of the adopted notatons, the dstance defnng the error copensaton accuracy can be coputed as p B ˆ 0( XX) (2) where the vectors X and Xˆ are the true paraeters values and ther estates, respectvely. Matrx B 0 corresponds to the test pose (see expressons (8)). Further, takng nto account that p s a functon of the unbased rando varables ε,..., ε, t can be easly proved that the expectaton E( p ) 0. Besdes, the varance can be expressed as 0 0 Var( p) E X B B X (3) where XXˆ X s the dfference between the estated and true values of the paraeters. Expresson. (3) can be rewrtten as trace( B0E( XX ) B0) and after relevant transforatons n accordance wth (0), (), yelds the desred expresson for the copensaton accuracy trace B0 ( ) ( ) 0 B q B q B (4) As follows fro ths expresson, the proposed perforance easure can be treated as the weghted trace of the covarance atrx (), where the weghtng coeffcents are coputed usng the test pose. Hence, the dentfcaton qualty (evaluated va the error copensaton accuracy) s copletely defned by the set of atrces B,..., B that depend on the anpulator confguratons q,..., q. Optal selecton of these confguratons wll be n the focus of next Subsecton. 2.3 Proble of the Measureent Poses Selecton Based on the perforance easure presented n the prevous Subsecton, the correspondng optzaton proble of the easureent pose selecton can be defned as trace B0 ( ) ( ) B q B q B 0, q w (5) subject to C( q, w) 0,, r Here, the atrces C( q, w ) descrbe soe constrants, whch should be taken nto account whle solvng optzaton proble. hese constrants are posed by the work-cell desgn partculartes and usually nclude the anpulator jont lts, the work-cell space lts, easureent equpent ltatons, etc. It should be also entoned that soe constrants are posed to avod collsons between the workcell coponents and the anpulator. Besdes, soe drectons of the appled loadng are preferable for the reason of practcal pleentaton. It should be entoned that the coponent of the atrces C vary wth dfferent calbraton cases and ay nclude soe very specfc constrants. For nstance, for the case of elastostatc calbraton, they can be expressed as q q pz p C z q q p p, C3 r r, C4 C2 F p p F (6) where q and q are the jont lts, F s the robot u payload, p z s the u heght between the end-pont of the calbraton tool and the work-cell floor, r s the u radus to avod collsons between the appled loadng and robot body, s the u angle between the drecton of calbraton tool and z-axs of robot base frae to ensure that the vertcal loadng can be appled, p and p are the boundares of work-cell space. For the case of geoetrc calbraton, the proble of applyng external loadng does not exst. So, C 2, C3 are zero atrces, whle C, C rean the sae as n elastostatc calbraton. 4 he procedure of solvng such an optzaton proble could be very tedous for the case when nuerous easureent confguratons are requred for the calbraton experent. For ths reason, the proble of nterest s to fnd reasonable

4 nuber of dfferent easureent confguratons and to prove the effcency of optzaton routnes eployed n the easureent pose selecton. 3. MEASUREMEN POSE SELECION ECHNIQUES o solve the above defne proble, several technques can be appled. hs secton presents the analyss and propose soe approaches allowng to obtan acceptable soluton n reasonable te. he an dffcultes here are related wth a large nuber of varables and coplex behavour of the objectve functon that has any local a. 3. Usng Conventonal Optzaton echnques he splest way to solve ths proble s to apply conventonal optzaton technques ncorporated n coercal atheatcal software. It s clear that straghtforward search wth regular grd s non-acceptable here because of hgh coplexty and enorous nuber of solutons to be copared. For ths reason, three other algorths have been exaed: () rando search, () gradent search, and () genetc algorth. her coparson study s presented below and suarzed n ables and 2, where two crtera have been used: coputatonal te and the ablty to fnd optal soluton (evaluated va 0, the anpulator accuracy after calbraton). For all coputatonal experents, t was assued that the s.t.d. of the easureent errors s he benchark exaple deals wth the calbraton experents desgn for 6-dof ndustral anpulator KUKA KR270, whose noal paraeters can be found on the anufacturer webste ( he robot has a seral archtecture wth sx actuated revolute jonts, so 24 ndependent geoetrc paraeters should be dentfed n general case. But for ths exaple, to reduce coputatonal efforts and evaluate the algorth capablty before applyng to the proble of real denson, only nne of the ost essental paraeters were dentfed (whch have ajor pact on the postonng accuracy). hs allowed us to obtan realstc assessents of the conventonal optzaton technques capabltes wth respect to the consdered proble where the nuber of desgn varables s hgh enough (72 for 2 confguratons). he frst of the exaed algorth () s based on the straghtforward selecton of the best soluton fro the set of ones generated n a rando way. For ths study, 0,000 solutons were generated for dfferent nubers of easureent confguratons 3, 4, 6,2. As follows fro the obtaned results (see ables and 2), ths algorth s very fast and requres less than 2 utes to fnd the best soluton. However, ths soluton s essentally worse than the optal one (by 5-30%). he second algorth () eploys the gradent search wth bult-n nuercal evaluaton of the dervatves that s avalable n Matlab. he startng ponts were generated randoly and, to avod convergence to the local a, the optzaton search has been repeated 5000 tes (startng fro dfferent ponts). In ths case, t has been obtaned the best result n ters of the desred objectve 0, but coputatonal cost was very hgh (t can overcoe a hundred of hours). So, ths technque s hardly acceptable n practce. It s worth entonng that reducton of the teraton nuber s rather dangerous here, because there are a nuber of local a that the algorth can converge to (see able that ncludes the u, u and average values of 0 obtaned for rando startng ponts). Moreover, as follows fro our experence, 5000 teratons are also not enough here. able. Effcency of conventonal optzaton technques Rando Search Gradent Search Genetc Algorth Algorth Nuber of poses [] ean 0 [] [] [] ean 0 [] [] [] ean 0 [] [] he thrd of the exaed technques () apples genetc algorth (GA) that s based on adaptve heurstc search. he optzaton has been carred out for 00 tes wth populaton sze 50 and 20 generatons (ntal populatons were randoly generated). For llustratve purposes, Fg. presents the effcency of ths algorth for selecton of three optal easureent confguratons. It shows the algorth convergence as well as dvergence of the optal solutons wth respect to coputng te. As follows fro ths fgure, the optzaton results are hghly senstve to the selecton of ntal populaton. In partcular, the dversty of the optal solutons got fro sequental GA runs s about 25%. So, to acheve the global u, the GA should be repeated any tes, whch leads to essental ncrease of the coputatonal efforts (ore than 6 hours of coputatons for the consdered exaple). However, copared to gradent search, GA provdes acceptable accuracy (only 2% worse) whle the coputatonal te s 4 tes less. able 2. Coputatonal te of exaed algorths Algorth Nuber of poses Rando Search 4s 47s.7 Gradent Search 24.2h 37.5h 56.3h 03.6h G enetc Algorth 6.5h 8.3h 0.5h 5.4h As follows fro the ed re the obtan sults, rando search s rather fast but neffcent here, snce t ay produce nonacceptable solutons. In contrast, the gradent search s able to fnd the global u provded that t s repeated any tes wth dfferent startng ponts. As a coprose, the GA

5 provdes nteredate results n ters of accuracy and coputatonal te. However, for probles of the real ndustral sze, the perforances of the GA are also not suffcent. For ths reason, the followng Subsectons are devoted to the proveent of the nuercal optzaton technques eployed n selecton of optal easureent poses. te, [h] 3.2 Applyng Parallel Coputng Fgure. Effcency of GA for selecton of three easure- ent poses (populaton sze 50, 20 generatons) Snce the consdered proble requres nuerous repettons of the optzaton wth dfferent ntal values, applyng parallel coputng looks attractve to speed up the desgn process and to take advantage of ult-core archtecture avalable n odern coputers. o evaluate benefts of the parallel coputng, the sae benchark exaple has been consdered and two algorths have been exaed: ()' parallel gradent search, and ()' parallel GA wth the sae paraeter settngs. he coputatons were carred out on the workstaton wth 2 cores. he obtaned results are presented n able 3, whch gves the coputatonal te for dfferent nuber of easureent poses (the attaned value of the objectve functon 0 s very close to those presented n able ). he obtaned results are qute expected and confr essental reducton of coputatonal efforts. For both optzaton ethods, the consued te has been decreased by the factor of 0-2 (copared to the results n able 2). However, t s not enough yet to solve the proble of real ndustral sze, where several dozen of paraeters should be dentfed (nstead of nne n the benchark exaple). able 3. Coputatonal te of exaed algorths usng parallel coputng Algorth Parallel Gradent Search Parallel Genetc Algorth Nuber of poses h 3.2h 4.9h 8.9h h 3.3 Usng Hybrd Approach o take the advantages of both exaed algorths and effcency of the parallel pleentaton, a hybrd technque has been developed. It should be entoned that soe software packages (Matlab, etc.) already pleent ths dea and use the fnal soluton fro GA as the ntal pont of gradent search. However, snce the randoly generated ntal populatons n GA ay cause hgh dversty of the optal solutons, the selecton of these ntal values s also an portant ssue. For ths reason, the ebedded hybrd opton n GA cannot be drectly used and requres addtonal odfcatons. o prove the effcency of the exstng technque, the startng pont selecton strategy for the gradent search has been odfed. o ensure better convergence to the global u, t has been proposed to use the best half of fnal ponts obtaned fro GA as the startng ponts for the gradent search. Fro our pont of vew, t ensures better dversty of the startng ponts and allows to avod convergence to the local a. Fgure 2. Effcency of the hybrd approach for selecton of three easureent poses he proposed odfcaton has been evaluated usng the sae benchark exaple. For coparson purposes, Fg 2. presents the convergence of the hybrd ethod for the proble of optal selecton of three easureent confguratons studed n the prevous Subsecton (see Fg. ). It shows the ntal ponts (obtaned fro GA), optal solutons as well as the soluton proveent wth respect to te. As follows fro the fgure, the hybrd algorth can converge uch faster, but f the nuber of easureent poses s ncreased up to 2, the coputatonal te s over.6 hour that s stll unacceptable for ndustry. 3.4 New Approach: Reducton of Proble Denson Generally, as follows fro the dentfcaton theory, the only way to prove calbraton accuracy s to ncrease the nuber of easureents (provded that the reducton of the easureent errors s not possble). However, for the anpulator calbraton proble, each easureent s assocated wth a certan robot confguraton that also has nfluence on the fnal accuracy. It s clear that the best result s acheved f all easureent poses are dfferent and have been optzed durng the calbraton experent plannng.

6 On the other hand, as follows fro our experences, the dversty of the easureent poses does not contrbute sgnfcantly to the accuracy proveent f s hgh enough. hs allows us to propose an alternatve whch uses the sae easureent confguratons several tes (allowng to splfy and speed up the easureents). hs approach wll be further referred as "reducton of proble denson". o explan the proposed approach n ore detals, let us assue that the proble of the optal pose selecton has been solved for the nuber of confguratons that s equal to, and the obtaned calbraton plan ensures the postonng accuracy 0. Usng these notatons, let us evaluate the calbra- ton accuracy for two alternatve strateges that eploy larger nuber of experents k : Strategy #2 (proposed): the easureent poses are obtaned by sple repetton the confguratons got fro the low- densonal optzaton proble of sze. Strategy # (conventonal): the easureent poses are found fro the full-scale optzaton of sze k. k It s clear that the calbraton accuracy 0 for strategy # s better than the accuracy correspondng to the strategy #2 that can be expressed as 0 k. However, a s follows fro our study, ths dfference s not hgh f s larger than 3. hs allows us to essentally reduce the sze of optzaton proble eployed n the optal selecto n of easureent poses wthout sgnfcant pact on the postonng accuracy. o deonstrate the valdty of the proposed approach, the benchark exaple has been solved usng strateges # and #2 assug that the total nuber of easureents s equal to 2 (.e. usng dfferent factorzatons such as 2, 6 2, 4 3, 3 4). Relevant results are presented n able 4 (see the last lne). As follows fro the, the factorzato n 2 where all easureent poses are dfferent s only 6% better copared to the factorzaton 3 4 where easureen ts are repeated 4 tes n 3 dfferent confguratons. At the sae te the factorzatons 6 2 and 4 3 gve alost the sae results as the optal factorzatons 2. On the other hand, the coputatonal te of the optal pose generaton for 3 s uch lower than for 2. hs deonstrates the effcency of the proposed approach and justfy ts valdty. able 4. Calbraton accuracy 0 for dfferent factorzatons of the experent nuber k0 Nuber of easureents Nuber of dfferent poses (3 ) (4 ) (3 2) (6) (3 4) (4 3) (6 2) (2 ) Coputng te h Hence, t can be concluded that repeatng experent s wth optal plans obtaned for the lower nu ber of confgura- tons provdes alost the sae perforance as "fulldensonal" optal plan. Obvously, ths reducton of the easureent pose nuber s very attractve for the engneerng practce. 4. CONCLUSIONS he paper presents a new technque for optal selecton of easureent poses n robot calbraton. In contrast to other works, t s proposed to evaluate the qualty of calbraton plans va the anpulator postonng accuracy for a gven test pose, and to reduce nuber of desgn varables n the related optzaton proble by eans of repeatng easureents wth lower nuber of confguratons. hs technque allows us to essentally reduce the coputatonal te for solvng the proble of real ndustral sze. he advantages of the developed technque were confred by a sulaton exaple, where the proposed approach pertted to decrease the coputng te by ore than 0 tes whle losng only 6% of anpulator postonng accuracy. Future work n ths drecton wll deal wth the effcency proveent of the anpulator elastostatc calbraton. ACKNOWLEGMEN he authors would lke to acknowledge the fnancal support of the French Agence Natonale de la Recherche (Project ANR-200-SEGI COROUSSO), France. REFERENCES Atknson, A.C., Donev, A.N., (992). Optal Experent Desgns. Oxford Unversty Press, Oxford. Daney, D., (2002). Optal easureent confguratons for Gough platfor calbraton. ICRA, pp Daney, D., Papegay, Y., Madelne, B., (2005). choosng easureent poses for robot calbraton wth the local convergence ethod and tabu search. Internatonal Journal of Robotcs Research, 24(6), pp Khall W., Klenfnger J.F., (986). A new geoetrc notaton for open and closed-loop robots. Proceedngs of ICRA Conference, pp Khall, W., Besnard, S., (2002). Geoetrc calbraton of robots wth flexble jonts and lnks. Journal of Intellgent and Robotc Systes, 34, pp Klchk, A., Wu,Y., Caro, S., Pashkevch, A., (20). Desgn of experents for calbraton of planar anthropoorphc anpulators. AIM Conference, pp Meggolaro, M.A., Dubowsky, S., Mavrods, C., (2005). Geoetrc and elastc error calbraton of a hgh accu- racy patent postonng syste. Mechans and Machne heory, 40, pp Pashkevch A., Klchk A., Chablat D. (20). Enhanced stffness odelng of anpulators wth assve jonts. Mechans and Machne heory, vol. 46, pp Salsbury, J., (980). Actve stffness control of a anpulator n Cartesan coordnates. Proceedngs of 9th IEEE Conference on Decson and Control, pp Sun, Y., Hollerbach M., (2008). Observablty ndex selecton for robot calbraton. Robotcs&Autoaton, pp Zhuang, H., Wu, J., Huang, W., (996). Optal plannng of robot calbraton experents by genetc algorths. Robotcs and Autoaton, 2, pp

System in Weibull Distribution

System in Weibull Distribution Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co

More information

Least Squares Fitting of Data

Least Squares Fitting of Data Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2014. All Rghts Reserved. Created: July 15, 1999 Last Modfed: February 9, 2008 Contents 1 Lnear Fttng

More information

Least Squares Fitting of Data

Least Squares Fitting of Data Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2015. All Rghts Reserved. Created: July 15, 1999 Last Modfed: January 5, 2015 Contents 1 Lnear Fttng

More information

Excess Error, Approximation Error, and Estimation Error

Excess Error, Approximation Error, and Estimation Error E0 370 Statstcal Learnng Theory Lecture 10 Sep 15, 011 Excess Error, Approxaton Error, and Estaton Error Lecturer: Shvan Agarwal Scrbe: Shvan Agarwal 1 Introducton So far, we have consdered the fnte saple

More information

BAYESIAN CURVE FITTING USING PIECEWISE POLYNOMIALS. Dariusz Biskup

BAYESIAN CURVE FITTING USING PIECEWISE POLYNOMIALS. Dariusz Biskup BAYESIAN CURVE FITTING USING PIECEWISE POLYNOMIALS Darusz Bskup 1. Introducton The paper presents a nonparaetrc procedure for estaton of an unknown functon f n the regresson odel y = f x + ε = N. (1) (

More information

Solutions for Homework #9

Solutions for Homework #9 Solutons for Hoewor #9 PROBEM. (P. 3 on page 379 n the note) Consder a sprng ounted rgd bar of total ass and length, to whch an addtonal ass s luped at the rghtost end. he syste has no dapng. Fnd the natural

More information

y new = M x old Feature Selection: Linear Transformations Constraint Optimization (insertion)

y new = M x old Feature Selection: Linear Transformations Constraint Optimization (insertion) Feature Selecton: Lnear ransforatons new = M x old Constrant Optzaton (nserton) 3 Proble: Gven an objectve functon f(x) to be optzed and let constrants be gven b h k (x)=c k, ovng constants to the left,

More information

Applied Mathematics Letters

Applied Mathematics Letters Appled Matheatcs Letters 2 (2) 46 5 Contents lsts avalable at ScenceDrect Appled Matheatcs Letters journal hoepage: wwwelseverco/locate/al Calculaton of coeffcents of a cardnal B-splne Gradr V Mlovanovć

More information

LECTURE :FACTOR ANALYSIS

LECTURE :FACTOR ANALYSIS LCUR :FACOR ANALYSIS Rta Osadchy Based on Lecture Notes by A. Ng Motvaton Dstrbuton coes fro MoG Have suffcent aount of data: >>n denson Use M to ft Mture of Gaussans nu. of tranng ponts If

More information

4 Column generation (CG) 4.1 Basics of column generation. 4.2 Applying CG to the Cutting-Stock Problem. Basic Idea of column generation

4 Column generation (CG) 4.1 Basics of column generation. 4.2 Applying CG to the Cutting-Stock Problem. Basic Idea of column generation 4 Colun generaton (CG) here are a lot of probles n nteger prograng where even the proble defnton cannot be effcently bounded Specfcally, the nuber of coluns becoes very large herefore, these probles are

More information

Chapter 12 Lyes KADEM [Thermodynamics II] 2007

Chapter 12 Lyes KADEM [Thermodynamics II] 2007 Chapter 2 Lyes KDEM [Therodynacs II] 2007 Gas Mxtures In ths chapter we wll develop ethods for deternng therodynac propertes of a xture n order to apply the frst law to systes nvolvng xtures. Ths wll be

More information

VERIFICATION OF FE MODELS FOR MODEL UPDATING

VERIFICATION OF FE MODELS FOR MODEL UPDATING VERIFICATION OF FE MODELS FOR MODEL UPDATING G. Chen and D. J. Ewns Dynacs Secton, Mechancal Engneerng Departent Iperal College of Scence, Technology and Medcne London SW7 AZ, Unted Kngdo Eal: g.chen@c.ac.uk

More information

Three Algorithms for Flexible Flow-shop Scheduling

Three Algorithms for Flexible Flow-shop Scheduling Aercan Journal of Appled Scences 4 (): 887-895 2007 ISSN 546-9239 2007 Scence Publcatons Three Algorths for Flexble Flow-shop Schedulng Tzung-Pe Hong, 2 Pe-Yng Huang, 3 Gwoboa Horng and 3 Chan-Lon Wang

More information

Elastic Collisions. Definition: two point masses on which no external forces act collide without losing any energy.

Elastic Collisions. Definition: two point masses on which no external forces act collide without losing any energy. Elastc Collsons Defnton: to pont asses on hch no external forces act collde thout losng any energy v Prerequstes: θ θ collsons n one denson conservaton of oentu and energy occurs frequently n everyday

More information

Computational and Statistical Learning theory Assignment 4

Computational and Statistical Learning theory Assignment 4 Coputatonal and Statstcal Learnng theory Assgnent 4 Due: March 2nd Eal solutons to : karthk at ttc dot edu Notatons/Defntons Recall the defnton of saple based Radeacher coplexty : [ ] R S F) := E ɛ {±}

More information

XII.3 The EM (Expectation-Maximization) Algorithm

XII.3 The EM (Expectation-Maximization) Algorithm XII.3 The EM (Expectaton-Maxzaton) Algorth Toshnor Munaata 3/7/06 The EM algorth s a technque to deal wth varous types of ncoplete data or hdden varables. It can be appled to a wde range of learnng probles

More information

1 Definition of Rademacher Complexity

1 Definition of Rademacher Complexity COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #9 Scrbe: Josh Chen March 5, 2013 We ve spent the past few classes provng bounds on the generalzaton error of PAClearnng algorths for the

More information

PROBABILITY AND STATISTICS Vol. III - Analysis of Variance and Analysis of Covariance - V. Nollau ANALYSIS OF VARIANCE AND ANALYSIS OF COVARIANCE

PROBABILITY AND STATISTICS Vol. III - Analysis of Variance and Analysis of Covariance - V. Nollau ANALYSIS OF VARIANCE AND ANALYSIS OF COVARIANCE ANALYSIS OF VARIANCE AND ANALYSIS OF COVARIANCE V. Nollau Insttute of Matheatcal Stochastcs, Techncal Unversty of Dresden, Gerany Keywords: Analyss of varance, least squares ethod, odels wth fxed effects,

More information

Our focus will be on linear systems. A system is linear if it obeys the principle of superposition and homogenity, i.e.

Our focus will be on linear systems. A system is linear if it obeys the principle of superposition and homogenity, i.e. SSTEM MODELLIN In order to solve a control syste proble, the descrptons of the syste and ts coponents ust be put nto a for sutable for analyss and evaluaton. The followng ethods can be used to odel physcal

More information

Slobodan Lakić. Communicated by R. Van Keer

Slobodan Lakić. Communicated by R. Van Keer Serdca Math. J. 21 (1995), 335-344 AN ITERATIVE METHOD FOR THE MATRIX PRINCIPAL n-th ROOT Slobodan Lakć Councated by R. Van Keer In ths paper we gve an teratve ethod to copute the prncpal n-th root and

More information

What is LP? LP is an optimization technique that allocates limited resources among competing activities in the best possible manner.

What is LP? LP is an optimization technique that allocates limited resources among competing activities in the best possible manner. (C) 998 Gerald B Sheblé, all rghts reserved Lnear Prograng Introducton Contents I. What s LP? II. LP Theor III. The Splex Method IV. Refneents to the Splex Method What s LP? LP s an optzaton technque that

More information

An Algorithm to Solve the Inverse Kinematics Problem of a Robotic Manipulator Based on Rotation Vectors

An Algorithm to Solve the Inverse Kinematics Problem of a Robotic Manipulator Based on Rotation Vectors An Algorthm to Solve the Inverse Knematcs Problem of a Robotc Manpulator Based on Rotaton Vectors Mohamad Z. Al-az*, Mazn Z. Othman**, and Baker B. Al-Bahr* *AL-Nahran Unversty, Computer Eng. Dep., Baghdad,

More information

Lecture 12: Discrete Laplacian

Lecture 12: Discrete Laplacian Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

More information

An Optimal Bound for Sum of Square Roots of Special Type of Integers

An Optimal Bound for Sum of Square Roots of Special Type of Integers The Sxth Internatonal Syposu on Operatons Research and Its Applcatons ISORA 06 Xnang, Chna, August 8 12, 2006 Copyrght 2006 ORSC & APORC pp. 206 211 An Optal Bound for Su of Square Roots of Specal Type

More information

Several generation methods of multinomial distributed random number Tian Lei 1, a,linxihe 1,b,Zhigang Zhang 1,c

Several generation methods of multinomial distributed random number Tian Lei 1, a,linxihe 1,b,Zhigang Zhang 1,c Internatonal Conference on Appled Scence and Engneerng Innovaton (ASEI 205) Several generaton ethods of ultnoal dstrbuted rando nuber Tan Le, a,lnhe,b,zhgang Zhang,c School of Matheatcs and Physcs, USTB,

More information

Finite Vector Space Representations Ross Bannister Data Assimilation Research Centre, Reading, UK Last updated: 2nd August 2003

Finite Vector Space Representations Ross Bannister Data Assimilation Research Centre, Reading, UK Last updated: 2nd August 2003 Fnte Vector Space epresentatons oss Bannster Data Asslaton esearch Centre, eadng, UK ast updated: 2nd August 2003 Contents What s a lnear vector space?......... 1 About ths docuent............ 2 1. Orthogonal

More information

Description of the Force Method Procedure. Indeterminate Analysis Force Method 1. Force Method con t. Force Method con t

Description of the Force Method Procedure. Indeterminate Analysis Force Method 1. Force Method con t. Force Method con t Indeternate Analyss Force Method The force (flexblty) ethod expresses the relatonshps between dsplaceents and forces that exst n a structure. Prary objectve of the force ethod s to deterne the chosen set

More information

Lecture 3. Camera Models 2 & Camera Calibration. Professor Silvio Savarese Computational Vision and Geometry Lab. 13- Jan- 15.

Lecture 3. Camera Models 2 & Camera Calibration. Professor Silvio Savarese Computational Vision and Geometry Lab. 13- Jan- 15. Lecture Caera Models Caera Calbraton rofessor Slvo Savarese Coputatonal Vson and Geoetry Lab Slvo Savarese Lecture - - Jan- 5 Lecture Caera Models Caera Calbraton Recap of caera odels Caera calbraton proble

More information

1.3 Hence, calculate a formula for the force required to break the bond (i.e. the maximum value of F)

1.3 Hence, calculate a formula for the force required to break the bond (i.e. the maximum value of F) EN40: Dynacs and Vbratons Hoework 4: Work, Energy and Lnear Moentu Due Frday March 6 th School of Engneerng Brown Unversty 1. The Rydberg potental s a sple odel of atoc nteractons. It specfes the potental

More information

COS 511: Theoretical Machine Learning

COS 511: Theoretical Machine Learning COS 5: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #0 Scrbe: José Sões Ferrera March 06, 203 In the last lecture the concept of Radeacher coplexty was ntroduced, wth the goal of showng that

More information

Xiangwen Li. March 8th and March 13th, 2001

Xiangwen Li. March 8th and March 13th, 2001 CS49I Approxaton Algorths The Vertex-Cover Proble Lecture Notes Xangwen L March 8th and March 3th, 00 Absolute Approxaton Gven an optzaton proble P, an algorth A s an approxaton algorth for P f, for an

More information

Collaborative Filtering Recommendation Algorithm

Collaborative Filtering Recommendation Algorithm Vol.141 (GST 2016), pp.199-203 http://dx.do.org/10.14257/astl.2016.141.43 Collaboratve Flterng Recoendaton Algorth Dong Lang Qongta Teachers College, Haou 570100, Chna, 18689851015@163.co Abstract. Ths

More information

On Pfaff s solution of the Pfaff problem

On Pfaff s solution of the Pfaff problem Zur Pfaff scen Lösung des Pfaff scen Probles Mat. Ann. 7 (880) 53-530. On Pfaff s soluton of te Pfaff proble By A. MAYER n Lepzg Translated by D. H. Delpenc Te way tat Pfaff adopted for te ntegraton of

More information

Advanced robot calibration using partial pose measurements

Advanced robot calibration using partial pose measurements Advanced robot calbraton usng artal ose easureents Alexandr Klchk Control Syste and Industral Engneerng Deartent Ecole des Mnes de Nantes alexandr.klchk@nes-nantes.fr Yer Wu Control Syste and Industral

More information

The Parity of the Number of Irreducible Factors for Some Pentanomials

The Parity of the Number of Irreducible Factors for Some Pentanomials The Party of the Nuber of Irreducble Factors for Soe Pentanoals Wolfra Koepf 1, Ryul K 1 Departent of Matheatcs Unversty of Kassel, Kassel, F. R. Gerany Faculty of Matheatcs and Mechancs K Il Sung Unversty,

More information

A Differential Evaluation Markov Chain Monte Carlo algorithm for Bayesian Model Updating M. Sherri a, I. Boulkaibet b, T. Marwala b, M. I.

A Differential Evaluation Markov Chain Monte Carlo algorithm for Bayesian Model Updating M. Sherri a, I. Boulkaibet b, T. Marwala b, M. I. A Dfferental Evaluaton Markov Chan Monte Carlo algorth for Bayesan Model Updatng M. Sherr a, I. Boulkabet b, T. Marwala b, M. I. Frswell c, a Departent of Mechancal Engneerng Scence, Unversty of Johannesburg,

More information

Primer on High-Order Moment Estimators

Primer on High-Order Moment Estimators Prmer on Hgh-Order Moment Estmators Ton M. Whted July 2007 The Errors-n-Varables Model We wll start wth the classcal EIV for one msmeasured regressor. The general case s n Erckson and Whted Econometrc

More information

COMP th April, 2007 Clement Pang

COMP th April, 2007 Clement Pang COMP 540 12 th Aprl, 2007 Cleent Pang Boostng Cobnng weak classers Fts an Addtve Model Is essentally Forward Stagewse Addtve Modelng wth Exponental Loss Loss Functons Classcaton: Msclasscaton, Exponental,

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

Psychology 282 Lecture #24 Outline Regression Diagnostics: Outliers

Psychology 282 Lecture #24 Outline Regression Diagnostics: Outliers Psychology 282 Lecture #24 Outlne Regresson Dagnostcs: Outlers In an earler lecture we studed the statstcal assumptons underlyng the regresson model, ncludng the followng ponts: Formal statement of assumptons.

More information

CHAPTER 6 CONSTRAINED OPTIMIZATION 1: K-T CONDITIONS

CHAPTER 6 CONSTRAINED OPTIMIZATION 1: K-T CONDITIONS Chapter 6: Constraned Optzaton CHAPER 6 CONSRAINED OPIMIZAION : K- CONDIIONS Introducton We now begn our dscusson of gradent-based constraned optzaton. Recall that n Chapter 3 we looked at gradent-based

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

Gadjah Mada University, Indonesia. Yogyakarta State University, Indonesia Karangmalang Yogyakarta 55281

Gadjah Mada University, Indonesia. Yogyakarta State University, Indonesia Karangmalang Yogyakarta 55281 Reducng Fuzzy Relatons of Fuzzy Te Seres odel Usng QR Factorzaton ethod and Its Applcaton to Forecastng Interest Rate of Bank Indonesa Certfcate Agus aan Abad Subanar Wdodo 3 Sasubar Saleh 4 Ph.D Student

More information

Linear Approximation with Regularization and Moving Least Squares

Linear Approximation with Regularization and Moving Least Squares Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...

More information

Difference Equations

Difference Equations Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1

More information

CHAPTER 7 CONSTRAINED OPTIMIZATION 1: THE KARUSH-KUHN-TUCKER CONDITIONS

CHAPTER 7 CONSTRAINED OPTIMIZATION 1: THE KARUSH-KUHN-TUCKER CONDITIONS CHAPER 7 CONSRAINED OPIMIZAION : HE KARUSH-KUHN-UCKER CONDIIONS 7. Introducton We now begn our dscusson of gradent-based constraned optzaton. Recall that n Chapter 3 we looked at gradent-based unconstraned

More information

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur Analyss of Varance and Desgn of Experment-I MODULE VII LECTURE - 3 ANALYSIS OF COVARIANCE Dr Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur Any scentfc experment s performed

More information

ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM

ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM An elastc wave s a deformaton of the body that travels throughout the body n all drectons. We can examne the deformaton over a perod of tme by fxng our look

More information

Markov Chain Monte Carlo Lecture 6

Markov Chain Monte Carlo Lecture 6 where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways

More information

The Non-equidistant New Information Optimizing MGM(1,n) Based on a Step by Step Optimum Constructing Background Value

The Non-equidistant New Information Optimizing MGM(1,n) Based on a Step by Step Optimum Constructing Background Value Appl. Math. Inf. Sc. 6 No. 3 745-750 (0) 745 Appled Matheatcs & Inforaton Scences An Internatonal Journal The Non-equdstant New Inforaton Optzng MGM(n) Based on a Step by Step Optu Constructng Background

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also

More information

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 31 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 6. Rdge regresson The OLSE s the best lnear unbased

More information

Fermi-Dirac statistics

Fermi-Dirac statistics UCC/Physcs/MK/EM/October 8, 205 Fer-Drac statstcs Fer-Drac dstrbuton Matter partcles that are eleentary ostly have a type of angular oentu called spn. hese partcles are known to have a agnetc oent whch

More information

halftoning Journal of Electronic Imaging, vol. 11, no. 4, Oct Je-Ho Lee and Jan P. Allebach

halftoning Journal of Electronic Imaging, vol. 11, no. 4, Oct Je-Ho Lee and Jan P. Allebach olorant-based drect bnary search» halftonng Journal of Electronc Iagng, vol., no. 4, Oct. 22 Je-Ho Lee and Jan P. Allebach School of Electrcal Engneerng & oputer Scence Kyungpook Natonal Unversty Abstract

More information

Towards strong security in embedded and pervasive systems: energy and area optimized serial polynomial multipliers in GF(2 k )

Towards strong security in embedded and pervasive systems: energy and area optimized serial polynomial multipliers in GF(2 k ) Towards strong securty n ebedded and pervasve systes: energy and area optzed seral polynoal ultplers n GF( k ) Zoya Dyka, Peter Langendoerfer, Frank Vater and Steffen Peter IHP, I Technologepark 5, D-53

More information

Designing Fuzzy Time Series Model Using Generalized Wang s Method and Its application to Forecasting Interest Rate of Bank Indonesia Certificate

Designing Fuzzy Time Series Model Using Generalized Wang s Method and Its application to Forecasting Interest Rate of Bank Indonesia Certificate The Frst Internatonal Senar on Scence and Technology, Islac Unversty of Indonesa, 4-5 January 009. Desgnng Fuzzy Te Seres odel Usng Generalzed Wang s ethod and Its applcaton to Forecastng Interest Rate

More information

Quantum Particle Motion in Physical Space

Quantum Particle Motion in Physical Space Adv. Studes Theor. Phys., Vol. 8, 014, no. 1, 7-34 HIKARI Ltd, www.-hkar.co http://dx.do.org/10.1988/astp.014.311136 Quantu Partcle Moton n Physcal Space A. Yu. Saarn Dept. of Physcs, Saara State Techncal

More information

FUZZY MODEL FOR FORECASTING INTEREST RATE OF BANK INDONESIA CERTIFICATE

FUZZY MODEL FOR FORECASTING INTEREST RATE OF BANK INDONESIA CERTIFICATE he 3 rd Internatonal Conference on Quanttatve ethods ISBN 979-989 Used n Econoc and Busness. June 6-8, 00 FUZZY ODEL FOR FORECASING INERES RAE OF BANK INDONESIA CERIFICAE Agus aan Abad, Subanar, Wdodo

More information

Geometric and elastostatic calibration of robotic manipulator using partial pose measurements

Geometric and elastostatic calibration of robotic manipulator using partial pose measurements Geometrc and elastostatc calbraton of robotc manpulator usng partal pose measurements Alexandr Klmchk, Yer Wu, Stéphane Caro, Benot Furet, Anatol Pashkevch To cte ths verson: Alexandr Klmchk, Yer Wu, Stéphane

More information

Estimating the Odometry Error of a Mobile Robot during Navigation

Estimating the Odometry Error of a Mobile Robot during Navigation Estatng the Odoetry Error of a Moble Robot durng Navgaton Agostno Martnell and Roland Segwart Autonoous Systes Lab Swss Federal Insttute of Technology Lausanne (EPFL) CH-5 Lausanne, Swtzerland e-al: agostno.artnell,

More information

Approximate method for cutting pattern optimization of membrane structures

Approximate method for cutting pattern optimization of membrane structures Proceedngs of the IASS Annual Syposu 217 Interfaces: archtecture.engneerng.scence 25-28th Septeber, 217, aburg, Gerany Annette Bögle, Manfred Grohann (eds.) Approxate ethod for cuttng pattern optzaton

More information

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng

More information

Denote the function derivatives f(x) in given points. x a b. Using relationships (1.2), polynomials (1.1) are written in the form

Denote the function derivatives f(x) in given points. x a b. Using relationships (1.2), polynomials (1.1) are written in the form SET OF METHODS FO SOUTION THE AUHY POBEM FO STIFF SYSTEMS OF ODINAY DIFFEENTIA EUATIONS AF atypov and YuV Nulchev Insttute of Theoretcal and Appled Mechancs SB AS 639 Novosbrs ussa Introducton A constructon

More information

EEE 241: Linear Systems

EEE 241: Linear Systems EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they

More information

AN ANALYSIS OF A FRACTAL KINETICS CURVE OF SAVAGEAU

AN ANALYSIS OF A FRACTAL KINETICS CURVE OF SAVAGEAU AN ANALYI OF A FRACTAL KINETIC CURE OF AAGEAU by John Maloney and Jack Hedel Departent of Matheatcs Unversty of Nebraska at Oaha Oaha, Nebraska 688 Eal addresses: aloney@unoaha.edu, jhedel@unoaha.edu Runnng

More information

Advanced robot calibration using partial pose measurements

Advanced robot calibration using partial pose measurements Advanced robot calbraton usng artal ose easureents Alexandr Klchk, Yer Wu, Stéhane Caro, Benoît Furet, Anatol Pashkevch o cte ths verson: Alexandr Klchk, Yer Wu, Stéhane Caro, Benoît Furet, Anatol Pashkevch.

More information

Assortment Optimization under MNL

Assortment Optimization under MNL Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.

More information

Fall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede

Fall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede Fall 0 Analyss of Expermental easurements B. Esensten/rev. S. Errede We now reformulate the lnear Least Squares ethod n more general terms, sutable for (eventually extendng to the non-lnear case, and also

More information

APPLICATION OF SPACE TETHERED SYSTEMS FOR SPACE DEBRIS REMOVAL

APPLICATION OF SPACE TETHERED SYSTEMS FOR SPACE DEBRIS REMOVAL APPICATION OF SPACE TETHERED SYSTEMS FOR SPACE DEBRIS REMOVA Dakov P.A, Malashn A.A., Srnov N.N oonosov Moscow State Unversty (MSU Faculty of Mechancs and Matheatcs, 999, Man Buldng, GSP-, ennskye Gory,

More information

Introducing Entropy Distributions

Introducing Entropy Distributions Graubner, Schdt & Proske: Proceedngs of the 6 th Internatonal Probablstc Workshop, Darstadt 8 Introducng Entropy Dstrbutons Noel van Erp & Peter van Gelder Structural Hydraulc Engneerng and Probablstc

More information

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4) I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes

More information

Chapter 8 Indicator Variables

Chapter 8 Indicator Variables Chapter 8 Indcator Varables In general, e explanatory varables n any regresson analyss are assumed to be quanttatve n nature. For example, e varables lke temperature, dstance, age etc. are quanttatve n

More information

Lecture Notes on Linear Regression

Lecture Notes on Linear Regression Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume

More information

Inductance Calculation for Conductors of Arbitrary Shape

Inductance Calculation for Conductors of Arbitrary Shape CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors

More information

,..., k N. , k 2. ,..., k i. The derivative with respect to temperature T is calculated by using the chain rule: & ( (5) dj j dt = "J j. k i.

,..., k N. , k 2. ,..., k i. The derivative with respect to temperature T is calculated by using the chain rule: & ( (5) dj j dt = J j. k i. Suppleentary Materal Dervaton of Eq. 1a. Assue j s a functon of the rate constants for the N coponent reactons: j j (k 1,,..., k,..., k N ( The dervatve wth respect to teperature T s calculated by usng

More information

Analysis and Research on Mismatch in Tailored Blank Laser Welding

Analysis and Research on Mismatch in Tailored Blank Laser Welding Analyss and Research on Msatch n Talored Blank Laser Weldng Lng Xn Shenyang Insttute of Autoaton, Chnese Acadey of Scence Graduate School of the Chnese Acadey of Scences Shenyang, Laonng Provnce, Chna

More information

Integral Transforms and Dual Integral Equations to Solve Heat Equation with Mixed Conditions

Integral Transforms and Dual Integral Equations to Solve Heat Equation with Mixed Conditions Int J Open Probles Copt Math, Vol 7, No 4, Deceber 214 ISSN 1998-6262; Copyrght ICSS Publcaton, 214 www-csrsorg Integral Transfors and Dual Integral Equatons to Solve Heat Equaton wth Mxed Condtons Naser

More information

General Averaged Divergence Analysis

General Averaged Divergence Analysis General Averaged Dvergence Analyss Dacheng ao, Xuelong 2, Xndong u 3,, and Stephen J Maybank 2 Departent of Coputng, Hong Kong Polytechnc Unversty, Hong Kong 2 Sch Coputer Scence & Inforaton Systes, Brkbeck,

More information

MMA and GCMMA two methods for nonlinear optimization

MMA and GCMMA two methods for nonlinear optimization MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons

More information

The Impact of the Earth s Movement through the Space on Measuring the Velocity of Light

The Impact of the Earth s Movement through the Space on Measuring the Velocity of Light Journal of Appled Matheatcs and Physcs, 6, 4, 68-78 Publshed Onlne June 6 n ScRes http://wwwscrporg/journal/jap http://dxdoorg/436/jap646 The Ipact of the Earth s Moeent through the Space on Measurng the

More information

Convexity preserving interpolation by splines of arbitrary degree

Convexity preserving interpolation by splines of arbitrary degree Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete

More information

Multipoint Analysis for Sibling Pairs. Biostatistics 666 Lecture 18

Multipoint Analysis for Sibling Pairs. Biostatistics 666 Lecture 18 Multpont Analyss for Sblng ars Bostatstcs 666 Lecture 8 revously Lnkage analyss wth pars of ndvduals Non-paraetrc BS Methods Maxu Lkelhood BD Based Method ossble Trangle Constrant AS Methods Covered So

More information

An Accurate Measure for Multilayer Perceptron Tolerance to Weight Deviations

An Accurate Measure for Multilayer Perceptron Tolerance to Weight Deviations Neural Processng Letters 10: 121 130, 1999. 1999 Kluwer Acadec Publshers. Prnted n the Netherlands. 121 An Accurate Measure for Multlayer Perceptron Tolerance to Weght Devatons JOSE L. BERNIER, J. ORTEGA,

More information

Linear Regression Analysis: Terminology and Notation

Linear Regression Analysis: Terminology and Notation ECON 35* -- Secton : Basc Concepts of Regresson Analyss (Page ) Lnear Regresson Analyss: Termnology and Notaton Consder the generc verson of the smple (two-varable) lnear regresson model. It s represented

More information

Finite Element Modelling of truss/cable structures

Finite Element Modelling of truss/cable structures Pet Schreurs Endhoven Unversty of echnology Department of Mechancal Engneerng Materals echnology November 3, 214 Fnte Element Modellng of truss/cable structures 1 Fnte Element Analyss of prestressed structures

More information

Second Order Analysis

Second Order Analysis Second Order Analyss In the prevous classes we looked at a method that determnes the load correspondng to a state of bfurcaton equlbrum of a perfect frame by egenvalye analyss The system was assumed to

More information

A particle swarm optimization for solving NLP/MINLP process synthesis problems

A particle swarm optimization for solving NLP/MINLP process synthesis problems 20 th European Syposu on Coputer Aded Process Engneerng ESCAPE20 S. Perucc and G. Buzz Ferrars (Edtors) 2010 Elsever B.V. All rghts reserved. A partcle swar optzaton for solvng NLP/MINLP process synthess

More information

Gradient Descent Learning and Backpropagation

Gradient Descent Learning and Backpropagation Artfcal Neural Networks (art 2) Chrstan Jacob Gradent Descent Learnng and Backpropagaton CSC 533 Wnter 200 Learnng by Gradent Descent Defnton of the Learnng roble Let us start wth the sple case of lnear

More information

Scattering by a perfectly conducting infinite cylinder

Scattering by a perfectly conducting infinite cylinder Scatterng by a perfectly conductng nfnte cylnder Reeber that ths s the full soluton everywhere. We are actually nterested n the scatterng n the far feld lt. We agan use the asyptotc relatonshp exp exp

More information

The Geometry of Logit and Probit

The Geometry of Logit and Probit The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.

More information

Signal-noise Ratio Recognition Algorithm Based on Singular Value Decomposition

Signal-noise Ratio Recognition Algorithm Based on Singular Value Decomposition 4th Internatonal Conference on Machnery, Materals and Coputng Technology (ICMMCT 06) Sgnal-nose Rato Recognton Algorth Based on Sngular Value Decoposton Qao Y, a, Cu Qan, b, Zhang We, c and Lu Yan, d Bejng

More information

MEV442 Introduction to Robotics Module 2. Dr. Santhakumar Mohan Assistant Professor Mechanical Engineering National Institute of Technology Calicut

MEV442 Introduction to Robotics Module 2. Dr. Santhakumar Mohan Assistant Professor Mechanical Engineering National Institute of Technology Calicut MEV442 Introducton to Robotcs Module 2 Dr. Santhakumar Mohan Assstant Professor Mechancal Engneerng Natonal Insttute of Technology Calcut Jacobans: Veloctes and statc forces Introducton Notaton for tme-varyng

More information

Physics 3A: Linear Momentum. Physics 3A: Linear Momentum. Physics 3A: Linear Momentum. Physics 3A: Linear Momentum

Physics 3A: Linear Momentum. Physics 3A: Linear Momentum. Physics 3A: Linear Momentum. Physics 3A: Linear Momentum Recall that there was ore to oton than just spee A ore coplete escrpton of oton s the concept of lnear oentu: p v (8.) Beng a prouct of a scalar () an a vector (v), oentu s a vector: p v p y v y p z v

More information

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have

More information

Notes on Frequency Estimation in Data Streams

Notes on Frequency Estimation in Data Streams Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to

More information

On the Construction of Polar Codes

On the Construction of Polar Codes On the Constructon of Polar Codes Ratn Pedarsan School of Coputer and Councaton Systes, Lausanne, Swtzerland. ratn.pedarsan@epfl.ch S. Haed Hassan School of Coputer and Councaton Systes, Lausanne, Swtzerland.

More information

total If no external forces act, the total linear momentum of the system is conserved. This occurs in collisions and explosions.

total If no external forces act, the total linear momentum of the system is conserved. This occurs in collisions and explosions. Lesson 0: Collsons, Rotatonal netc Energy, Torque, Center o Graty (Sectons 7.8 Last te we used ewton s second law to deelop the pulse-oentu theore. In words, the theore states that the change n lnear oentu

More information

DUE: WEDS FEB 21ST 2018

DUE: WEDS FEB 21ST 2018 HOMEWORK # 1: FINITE DIFFERENCES IN ONE DIMENSION DUE: WEDS FEB 21ST 2018 1. Theory Beam bendng s a classcal engneerng analyss. The tradtonal soluton technque makes smplfyng assumptons such as a constant

More information

THE PRACTICE OF AUTOMATIC SATELLITE IMAGE REGISTRATION

THE PRACTICE OF AUTOMATIC SATELLITE IMAGE REGISTRATION THE PRACTICE OF AUTOMATIC SATELLITE IMAGE REGISTRATION Yao Janchao and Cha Ten Chern Sgnal Processng Laboratory, DSO Natonal Laboratores Scence Park Drve, Sngapore 1183 Tel: 65)777179 Fax : 65)775911 {yjancha,ctenche}@dso.org.sg

More information