On-Line Trajectory Generation: Nonconstant Motion Constraints
|
|
|
- Leon Nichols
- 10 years ago
- Views:
Transcription
1 2012 IEEE Internatona Conference on Robotcs and Automaton RverCentre, Sant Pau, Mnnesota, USA May 14-18, 2012 On-Lne Trajectory Generaton: Nonconstant Moton Constrants Torsten Kröger Abstract A concept of on-ne trajectory generaton for robot moton contro systems enabng nstantaneous reactons to unforeseen sensor events was ntroduced n a former pubcaton. Ths prevousy proposed cass of agorthms requres constant knematc moton constrants, and ths paper extends the approach by the usage of tme-varant moton constrants, such that ow-eve trajectory parameters can now abrupty be changed, and the system can react nstantaneousy wthn the same contro cyce typcay one msecond or ess). Ths feature s mportant for nstantaneous swtchngs between state spaces and reference frames at sensor-dependent nstants of tme, and for the usage of the agorthm as a contro submodue n a hybrd swtched robot moton contro system. Rea-word expermenta resuts of two sampe use-cases hghght the practca reevance of ths extenson. I. INTRODUCTION Sensor ntegraton n the feedback oops of ow-eve moton controers beongs to key technooges for the future advancement of robot arm controers. It s mportant to enabe robot moton controers to nstantaneousy swtch from sensor-guded moton contro e.g., force/torque contro [1] or vsua servo contro [2]) to trajectory-foowng moton contro and vce versa) at unforeseen nstants. Ths way, new event-based robot programmng methodooges can be reazed as robots become enabed to react nstantaneousy n the moment the event s detected. In recent works [3], [4], a concept of on-ne trajectory generaton OTG) was proposed. The resutng agorthms run n parae to oweve moton controers and are abe to compute a trajectory from arbtrary states of moton wthn the same contro cyce that the unforeseen swtchng occurs. The major mtaton of the agorthms descrbed n [3] s that ony constant knematc moton constrants can be apped to them, that s, B = V, A, J, D ) = const Z, 1) where the coumns of the matrx B contan the mum veocty vector V at a dscrete nstant T, the mum acceeraton vector A, the mum jerk vector J, and/or even a vector for the mum dervatves of jerk D. Ths paper extends the agorthms of [3], such that tme-varant vaues for a eements of B can be apped. Ths way, the agorthm can generate a trajectory even f one or more eements of the current state of moton M = P, V, A, J ) = 1M ) T,..., km,..., KM 2) T. Kröger s wth the Artfca Integence Laboratory at Stanford Unversty, Stanford, CA , USA, [email protected]. exceed the vaues of B. In eqn. 2), K represents the number of degrees of freedom DOF) of the robotc system; P contans the poston, V the veocty, A the acceeraton, and J the jerk at the dscrete nstant T. The major benefts of ths extenson w be: The vaues of the knematc moton constrants can be abrupty ncreased or decreased, such that moton trajectory parameters can be adapted on-ne and the system reacts to the change mmedatey wthn one contro cyce commony, one msecond or ess). The agorthm can be used as a contro submodue n a hybrd swtched robot moton contro system, whch s avaabe even f sensors fa. Instantaneous swtchngs between state spaces and reference frames at unforeseen nstants become possbe. One of the prerequstes for the embeddng of robot dynamcs to the OTG concept s set up future work). The next secton ntroduces reated works, Sec. III descrbes the extenson of the OTG agorthm, and Sec. IV dscusses rea-word expermenta resuts of ths extended cass of OTG agorthms. II. RELATED WORK The works most reated to ths paper are [5] [11], a of whch beong to the feds of robot moton contro [12] and trajectory generaton [13], [14] n robotc systems. Macfarane et a. [5] present a jerk-bounded, near-tme-optma trajectory panner that uses quntc spnes, whch are aso computed on-ne but ony for one-dof systems. In [6], Cao et a. use rectanguar jerk puses to compute trajectores, but nta acceeratons dfferent from zero cannot be apped. Compared to the mut-dof approach presented here, the atter method has been deveoped for one-dmensona probems ony. Broquère et a. [7] pubshed a work that uses an on-ne trajectory generator for an arbtrary number of ndependenty actng DOFs. The approach s very smar to the one of Lu [8] and s based on the cassc sevensegment acceeraton profe [15]. Wth regard to [4], t s a Type V on-ne trajectory generaton approach desgned for handng severa DOFs ndvduay. Another very recent concept was proposed by Haddadn et a. [11]; Instead of generatng moton trajectores, vrtua sprngs and dampng eements are setup up used as nput vaues for a Cartesan mpedance controer of the robot. A dsadvantage of [5], [6], [8] s that they cannot cope wth nta acceeraton vaues unequa to zero. A further, recent work of Haschke et a. [9] presents an on-ne trajectory panner n the very same sense as [3] does. The /12/$ IEEE 2048
2 proposed agorthm generates jerk-mted trajectores from arbtrary states of moton, but t suffers from numerca stabty probems, that s, t may happen, that no jerk-mted trajectory can be cacuated. In such a case, a second-order trajectory wth nfnte jerks s cacuated. Furthermore, the agorthm ony aows target veoctes of zero. Ahn et a. [10] proposed a work for the on-ne cacuaton of onedmensona moton trajectores for any gven state of moton and wth arbtrary target states of moton, that s, wth target veoctes and target acceeratons unequa to zero. Sxthorder poynomas are used to represent the trajectory, whch s caed arbtrary states poynoma-ke trajectory ASPOT). The major drawback of ths work s that no knematc moton constrants, such as mum veocty, acceeraton, and jerk vaues, can be specfed. On-ne trajectory generaton agorthm Set-ponts for owereve contro III. THE EXTENDED ALGORITHM Let us frst descrbe the extenson of the OTG agorthm n a generc manner and afterwards concretey by means of the extenson of the OTG Types III V. 1 Fg. 1. Input and output vaues of the Type IX OTG agorthm cf. [3]). A. Forma Descrpton Ths nomencature used here s nherted from [3], [4]. Let us defne a trajectory M t), whch s cacuated at a dscrete tme nstant T, as { 1 ) M t) = m t), 1 V,..., ) m t), V,..., L ) } 3) m t), L V, where the eements m t) are matrces of moton poynomas ) m t) = p t), v t), a t), j t) = 1 m t),..., k m t),..., K m t) ) T. 4) Tme-dscrete vaues are represented by capta etters, tmecontnuous vaues by ower case etters. A trajectory segment of a snge DOF k s descrbed by the moton poynomas k m t) = k p t), kv t), ka t), kj t) ), 5) where k p t) represents the poston progresson, k v t) the veocty progresson, k a t) the acceeraton progresson, and k j t) the jerk progresson. Accordng to eqn. 3), a compete trajectory s descrbed by L segments, and each segment s accompaned by a set of tme ntervas V = { 1 ϑ,..., k ϑ,..., K ϑ }, where k ϑ = [ 1 k t, k t ], 6) such that a snge set of moton poynomas k m t) s ony vad wthn the nterva k ϑ. Fg. 1 shows the nput and output vaues of the OTG agorthm n a generc manner cf. [3]). It s the task of 1 For the OTG Types I II, J and D are rreevant; for the Types III V, the vaues of D are not reevant, because they are not consdered by these types of OTG agorthms cf. [3]) the agorthm to tme-optmay transfer an arbtrary current state of moton M nto the desred target state of moton M trgt = P trgt, V trgt, A trgt, J ) trgt 7) under consderaton of the knematc moton constrants B. The agorthm works memoryess and cacuates ony the state of moton of the next contro cyce, M +1 because an unforeseen sensor event may occur unt T +1 ). The cyce tme commony s n the range of one msecond or ess to be abe to react nstantaneousy, that s, n the same contro cyce an unforeseen swtchng event occurs. The agorthms descrbed n [3] requre constant vaues of B cf. eqn. 1)) and are extended now, such that the eements of B can be tme-varant. The extenson works n the same way as the basc agorthms of [3] do, but here an addtona decson tree s connected upstream of each basc decson tree. The case n whch one or more eements of the nta moton state vaues km exceed ther correspondng constrants of kb has to be consdered n ths extenson, and t may happen at any dscrete tme nstant T wth Z and k {1,..., K}, n whch k V > k V and/or k A > k A and/or k J > k J and/or k D > k D 8) s true. Furthermore, moton states km may occur, whch are wthn ther respectve bounds kb at nstant T, but whch w ead to an unavodabe future exceedng of kb at a tme nstant T +u : k V +u > k V and/or k A +u > k A k J +u > k J and/or k D +u > k D and/or wth u N\{0}. 9)
3 Fg. 2. Ths decson tree s apped pror to the decson trees of the Type III V OTG agorthms descrbed n [3]. Its task s to brng a moton state vaues M nto ther mts B and to guarantee that the eements of M can reman wthn n these bounds. For ths purpose, one or more of the ntermedate acceeraton profes, whch are shown on the eft, are connected upstream of the acceeraton profes seected by the man agorthm cf. [3], [4]). If one or more of the cases n eqns. 8) and 9) are true, the extended agorthm has to seect and parameterze Λ ntermedate trajectory segments k m wth {1,..., Λ} wth correspondng tme ntervas k ϑ wth {1,..., Λ} cf. eqns. 5) and 6)) n order to gude these vaues back nto ther bounds, and furthermore to brng the DOF k of the system nto a state of moton after whch the moton varabes can be kept wthn the constrant vaues of k B. Therefore, ths set of ntermedate trajectory segments s determned and executed pror to the segments that are generated by the basc agorthm: k m wth {Λ + 1,..., L} and k ϑ wth {Λ + 1,..., L}. Correspondng to the type of OTG, veocty profes Type I, II), acceeraton profes Type III V), or jerk profes Type VI IX) are apped, respectvey. As for the basc agorthms [3], [4], t s absoutey essenta that the addtona decson tree and the respectve ntermedate moton profes cover the compete nput space of the agorthm; otherwse there woud be nput vaues W cf. Fg. 1) to whch no trajectory, that s, no output sgna M +1, can be generated. B. Extenson by Means of Type III V OTG Agorthms Based on the OTG Types III V, we w derve the requred extenson n ths subsecton; these types generate jerk-mted trajectores cf. [3]). Fg. 2 shows the respectve decson tree n a mnmzed verson. The executon of the ntermedate trajectory segments shown on the eft of Fg. 2 s fnshed at Λ+1) k t cf. eqns. 6) and 3)), and we have to assure, that ) k V Λ+1) k v k t + k V ) k A Λ+1) k a k t + k A 10) hod for a DOFs k {1,..., K}. Furthermore, we have ) Λ+1) to ensure for each DOF k that f we brng k a k t to zero by appyng the mum possbe jerk ± k J, the mum veocty vaue of k V s not exceeded agan nether postvey nor negatvey). Therefore, the pan condton )) 2 ) Λ+1) Λ+1) ka kv k t k t ± kj k V 11) has to be fufed for a DOFs k {1,..., K}. In the foowng, the extenson s derved n order to et eqns. 10) and 11) be true and to subsequenty appy the basc part of a Type III, IV, or V OTG agorthm cf. [3]). The mnmzed decson tree of Fg. 2 takes advantage of sgn swtchngs. Snce ths tree s executed pror to a basc decson trees of OTG Types III V and aso pror to the further decson tree for the synchronzaton of mutpe DOFs, the etter X has been chosen to repace the actua tree dentfer e.g., 1A, 1B, or 2). Decson X.001 eads to a swtchng of sgns for the nta and for the target state of moton f the current acceeraton vaue k A s negatve. Hence, k A s postve for decson X.002. Ths decson checks whether k A s currenty exceeded. If t s exceeded, we set up a frst ntermedate acceeraton profe segment NegLn), whch brngs A down to k A 2050
4 by appyng k J. The decsons X.003 and X.004 check whether k V s postvey or negatvey exceeded. Snce our current acceeraton vaue s postve, decson X.003 cacuates the veocty vaue that we woud obtan f we were to brng the acceeraton vaue to zero whch ncreases the veocty vaue). If the resutng veocty s then greater than + k V, we decrease the acceeraton to zero by appyng k J agan NegLn), perform a swtchng of sgns, and et the decsons X.005 to X.008 brng the veocty vaue nto ts bounds. Decson X.004 ony checks whether k V s exceeded. If ths s the case, we contnue at decson X.005. For ths decson, we know that the veocty s ess than k V, and the acceeraton s postve no matter f the branch of decson X.003 or X.004 has been taken). If we woud now ncrease the acceeraton to + k A, decson X.005 checks whether the resutng veocty vaue s greater or ess than k V. If t s ess, we know that a smpe acceeraton ncrease brngs the veocty vaue back nto ts mts, but we have to make sure, that t can reman wthn these. For ths purpose, decson X.006 checks whether + k V woud be exceeded f we subsequenty decreased the acceeraton vaue to zero. If ths s not the case eft branch), a smpe PosLn profe segment, whch appes + k J, compes wth the requrements of eqns. 10) and 11). Otherwse rght branch), we woud ncrease the acceeraton vaue to a certan peak vaue, and subsequenty decrease t agan, such that we woud reach + k V exacty after the fu decrease to zero profe segment PosLn- NegLn). The decsons X.007 and X.008 work anaogousy. In the ast step, we have to re-swtch the sgns agan f they have been swtched before decson X.009). Fnay, we can assure that the condtons of eqns. 10) and 11) are fufed and w not be breached agan, and we can contnue wth the basc decson trees of the Type III, IV, or V OTG agorthm as presented n [3]. Dependng on the nput vaues W cf. Fg. 1) and n correspondence to the ntermedate acceeraton profes of the decson tree shown n Fg. 2, Λ {0,..., 5} 12) hods for the Types III V. Once the Λ ntermedate trajectory segments are determned, they have to be parameterzed. Ths s aso done n the same way as for the acceeraton profes as descrbed n [3], [4]. The resutng systems of equatons are of trva nature and can be soved n a straghtforward way wthout any numerca probems. IV. RESULTS Ths secton dscusses expermenta resuts and the benefts acheved wth the extended varant of the Type IV OTG agorthm. For comprehensveness, we start wth a smpe one-dof exampe, and subsequenty we appy the proposed concept to a sx-dof robot manpuator. A. Basc Exampe wth a One-DOF System For a better understandng, we ustrate the functonaty of the extended Type IV OTG agorthm by means of a Fg. 3. Resutng Type IV trajectory at T 0 for one DOF k generated wth the extended OTG agorthm presented n Sec. III for the gven nput vaues of eqn. 13). The vertca dashed nes ndcate the bounds of the snge trajectory segments, and the horzonta dotted nes ndcate the knematc moton constrants kb. concrete exampe wth one DOF k ony. Let us assume some gven nput vaues k W0 at nstant T 0 = 0 ms: kp 0 = 100 mm kp trgt 0 = 300 mm kv 0 = 270 mm/s kv trgt 0 = 100 mm/s ka 0 = 450 mm/s 2 kv0 = 300 mm/s ka0 = 300 mm/s 2 kj0 = 900 mm/s 3. 13) After the cacuaton at the contro cyce of T 0, the trajectory of Fg. 3 resuts from the nput vaues kw0 of eqn. 13). In the frst step, we seect ntermedate trajectory segments by appyng the decson tree of Fg. 2. Here, we woud take the foowng path: X.001 Change of sgns X.002 N egln X.003 N egln Change of sgns X.005 X.007 P oslnhd X.009 Basc decson tree of Type IV. Ths exampe resuts n Λ = 4 ntermedate trajectory 2051
5 segments cf. Fg. 2): N egln = P osln N egln = P osln P oslnhd One segment One segment Two segments 1k m 0 t), 1 k V 0) 2k m 0 t), 2 k V 0) 3k m 0 t), 3 k V ) 0, 4k m 0 t), 4 k V ) 0. At T 0, both condtons, eqns. 10) and 11), are not fufed. These Λ = 4 trajectory segments ead to a new state of moton Λ k m 0 Λ+1) k t 0), whch satsfes eqns. 10) and 11), and we can execute the basc Type IV decson tree of [3]. The resut of ths tree s that P ost rapzeronegt rap acceeraton profe s requred for the tme optma souton; the correspondng nonnear system of equatons can be set up and soved to get a trajectory parameters k M t). Fnay, we obtan L = = 11 trajectory segments, whereas the ffth segment s actuay not exstent, because 5 k a 0 5k t 0 ) = k A, and, thus, 5 k t 0 6 k t 0 hods cf. Fg. 3). B. Rea-Word Expermenta Resuts To hghght the practca reevance of the method proposed n ths paper, we now dscuss rea-word expermenta resuts and show, how the extended OTG agorthm can be apped n a hybrd swtched-system for robot moton contro. For the experments, the same hardware setup as descrbed n [3] has been used: The orgna controer of a sxjont Stäub RX60 ndustra manpuator [16] was repaced, and the frequency nverters were drecty nterfaced. Three PCs runnng wth QNX [17] as rea-tme operatng system perform a contro rate of 10 KHz for the jont controers; a hybrd swtched-system controer s used for Cartesan space contro and runs at a frequency of 1 KHz. If we consder the actuator space contro scheme as Lyapunov stabe [18], we can focus on the task space contro scheme, whch contans the hybrd swtched-system, and the on-ne trajectory generaton submodue. Especay, the works of Brancky [19], [20] and Lberzon [21], [22] provde eementary concepts to deveop and anayze hybrd swtchedsystem contro technques. In partcuar, the stabty anayss s of fundamenta nterest here, because the stabty of a swtched-system cannot be assured by the stabty of each snge sub-controer. Provng the stabty of hybrd swtchng systems can be extremey dffcut and many researchers are workng on anayzng such stabty questons. Brockett [23] expans ths subject for moton contro systems. Žefran and Burdck [24], [25] suggest an approach, n whch a system wth changng dynamcs s consdered, and a hybrd controer s desgned for handng the system n dfferent regmes of dynamcs. One essenta beneft of the OTG submodue s that t can take over contro at any tme and n any state of moton to stabze the system, f the underyng trajectory-trackng controer s stabe. Here, we consder a hybrd swtched robot moton contro system wth sx DOFs { x, y, z, x, y, z } [26]; the resuts are shown n Fgs. 4 and 5. Startng wth a sensorguded moton of a smpe PID zero-force controer [1], the Fg. 4. Poston, veocty, and acceeraton progressons. The swtchng from sensor-guded robot moton contro to trajectory-foowng contro happened at t = 662 ms as the some acceeraton vaues exceeded ther mum vaues cf. eqn. 14)). A sx trajectores constantaneousy reach ther desred target state of moton at T N = 2816 ms. Fg. 5 depcts these trajectores n the veocty-acceeraton-pane of the state space cf. [26]). system detects that the acceeraton amptudes exceed ka = 500 mm/s 2 k, ) { x, y, z} Z ka = 500 /s 2 k, ) { x, y, z } Z { } 14) for z, x, z at t = 662 ms. It s essenta that approprate nput parameters M trgt and M trgt are setup n the moment of swtchng from sensor-guded moton contro to trajectory-foowng contro. A the oca forward dynamcs [27], V may be cacuated from commony s gven may be through mechanca system propertes, and J 2052
6 Fg. 5. Correspondng to Fg. 4, ths dagram ustrates the sx trajectores from the moment of swtchng on.e., n the nterva 662 ms t 2816 ms). A trajectores termnate n an equbrum pont of the underyng contro oops cf. [26]). setup wth regard to the current task agan. The smpest way to setup M trgt woud be to choose V trgt = 0 and A trgt = 0 Z 15) agan. The desred pose P trgt shoud be set to a safe pose n workspace, such that no cosons and no snguartes occur durng the moton. Dependng on the task, t can aso be reasonabe to specfy a desred target veocty vector V trgt 0 n space e.g., n order to synchronze the system wth cooperatng one or to acheve a defned state of moton from whch a safe moton can be contnued). Fg. 4 depcts the poston, veocty, and acceeraton progressons for a sx DOFs { x, y, z, x, y, z }, and Fg. 5 dspays the correspondng trajectores the veoctyacceeraton-pane of the state space from the moment of swtchng on. As one can ceary see n Fg. 4, the trajectores of a sx DOFs are contnuous, and they reach ther desred target state of moton M trgt constantaneousy at T N = 2816 ms. Furthermore, Fg. 5 shows that a sx trajectores termnate n an equbrum pont of the nner contro oops as eqn. 15) was apped n ths experment.e., t s a Type III trajectory, cf. [3], [4]). Furthermore, t woud aso be possbe to swtch ony a seecton of DOFs nstead of a DOFs. The reason, why ony resuts wth decreasng moton constrants are shown, s that ths case s more demandng, and ncreasng vaues can aready be handed by the former agorthm of [3], [4]. For the reason of carty, ony these smpe exampes have been chosen for the smuaton and rea-word expermenta resuts. Due to the concept proposed n ths paper, we are now abe to nstantaneousy swtch to state feedback contro, that s, contro performed by the extended OTG agorthm, n order to stabze the system and contnuousy gude t to a safe pose. As proposed n [26], ths concept may be used to stabze hybrd swtched-systems n a very genera way, as the OTG agorthms can take over contro from arbtrary states of moton at unforeseen nstants. V. CONCLUSION The cass of on-ne trajectory generaton agorthms descrbed n [3] was extended, such that tme-varant knematc moton constrants can be apped to the agorthms. An addtona decson tree s requred to be apped upstream of the basc decson trees; f necessary, ths tree seects ntermedate moton profes to be executed pror to the ones of the basc agorthm. As an exampe, ths tree was derved for agorthm Types III V, whch generate jerkmted moton trajectores. Such an extended OTG agorthm enabes users to onne ncrease or decrease the vaues of knematc moton constrants; moton trajectory parameters can be adapted onne, and the system reacts to the change wthn one contro cyce commony a msecond or ess). If used as a contro submodue n a hybrd swtched-system, the extended OTG agorthm can be used as a state feedback controer, whch s avaabe even f sensors fa. Rea-word expermenta resuts have shown how the extended agorthm can be used n a hybrd swtched-system. Furthermore, nstantaneous swtchngs between state spaces and reference frames at unforeseen nstants become possbe, and t s aso a prerequste for the embeddng of robot dynamcs, whch s part of the future work to be done n ths research drecton. APPENDIX Ths extenson of the OTG Framework has become part of the Refexxes Moton Lbrares [28], whch can be downoaded from [29]. ACKNOWLEDGMENT The research descrbed n ths paper was conducted at the Insttut für Robotk und Prozessnformatk at the Technsche Unverstaet Caroo-Whemna zu Braunschweg, Braunschweg, Germany, headed by Professor Fredrch M. Wah, to whom I woud ke to express my sncere grattude. Furthermore, I woud ke to express my apprecaton to Professor Oussama Khatb, who s currenty hostng me at the Stanford Artfca Integence Laboratory at Stanford Unversty, Stanford, USA. The works of my former dpoma students, Mchaea Hansch, Chrstan Hurnaus, and Adam Tomczek, who worked hard on the frst deas and mpementatons of ths concept, are hghy apprecated. I am ndebted to the Deutsche Forschungsgemenschaft DFG, German Research Foundaton). REFERENCES [1] L. Van,, and J. De Schutter. Force contro. In B. Scano and O. Khatb, edtors, Sprnger Handbook of Robotcs, chapter 7, pages Sprnger, Bern, Hedeberg, Germany, frst edton, [2] F. Chaumette and S. A. Hutchnson. Vsua servong and vsua trackng. In B. Scano and O. Khatb, edtors, Sprnger Handbook of Robotcs, chapter 24, pages Sprnger, Bern, Hedeberg, Germany, frst edton, [3] T. Kröger and F. M. Wah. On-ne trajectory generaton: Basc concepts for nstantaneous reactons to unforeseen events. IEEE Trans. on Robotcs, 261):94 111, February [4] T. Kröger. On-Lne Trajectory Generaton n Robotc Systems, voume 58 of Sprnger Tracts n Advanced Robotcs. Sprnger, Bern, Hedeberg, Germany, frst edton, January
7 [5] S. Macfarane and E. A. Croft. Jerk-bounded manpuator trajectory pannng: Desgn for rea-tme appcatons. IEEE Trans. on Robotcs and Automaton, 191):42 52, February [6] B. Cao, G. I. Dodds, and G. W. Irwn. A practca approach to near tme-optma nspecton-task-sequence pannng for two cooperatve ndustra robot arms. The Internatona Journa of Robotcs Research, 178): , August [7] X. Broquère, D. Sdobre, and I. Herrera-Aguar. Soft moton trajectory panner for servce manpuator robot. In Proc. of the IEEE/RSJ Internatona Conference on Integent Robots and Systems, pages , Nce, France, September [8] S. Lu. An on-ne reference-trajectory generator for smooth moton of mpuse-controed ndustra manpuators. In Proc. of the seventh Internatona Workshop on Advanced Moton Contro, pages , Marbor, Sovena, Juy [9] R. Haschke, E. Wetnauer, and H. Rtter. On-ne pannng of tme-optma, jerk-mted trajectores. In Proc. of the IEEE/RSJ Internatona Conference on Integent Robots and Systems, pages , Nce, France, September [10] K. Ahn, W. K. Chung, and Y. Yourn. Arbtrary states poynomake trajectory ASPOT) generaton. In Proc. of the 30th Annua Conference of IEEE Industra Eectroncs Socety, voume 1, pages , Busan, South Korea, November [11] S. Haddadn, H. Urbanek, S. Paruse, D. Burschka, J. Roßmann, A. Abu-Schäffer, and G. Hrznger. Rea-tme reactve moton generaton based on varabe attractor dynamcs and shaped veoctes. In Proc. of the IEEE/RSJ Internatona Conference on Integent Robots and Systems, pages , Tape, Tawan, October [12] W. Chung, L.-C. Fu, and S.-H. Hsu. Moton contro. In B. Scano and O. Khatb, edtors, Sprnger Handbook of Robotcs, chapter 6, pages Sprnger, Bern, Hedeberg, Germany, frst edton, [13] L. Bagott and C. Mechorr. Trajectory Pannng for Automatc Machnes and Robots, chapter 3, Composton of Eementary Trajectores, pages Sprnger, Bern, Hedeberg, Germany, frst edton, [14] L. E. Kavrak and S. M. LaVae. Moton pannng. In B. Scano and O. Khatb, edtors, Sprnger Handbook of Robotcs, chapter 5, pages Sprnger, Bern, Hedeberg, Germany, frst edton, [15] R. H. Castan and R. P. Pau. An on-ne dynamc trajectory generator. The Internatona Journa of Robotcs Research, 31):68 72, March [16] Stäub Faverges SCA, Pace Robert Stäub BP 70, Faverges Annecy), France. Homepage. robotcs accessed: Jan. 26, 2012). Internet, [17] QNX Software Systems, 175 Terence Matthews Crescent, Ottawa, Ontaro, Canada, K2M 1W8. Homepage. accessed: Mar. 10, 2011). Internet, [18] S. Sastry. Nonnear Systems: Anayss, Stabty, and Contro. Sprnger, New York, NY, USA, [19] M. S. Brancky. Studes n Hybrd Systems: Modeng, Anayss, and Contro. PhD thess, Eectrca Engneerng and Computer Scence Dept., Massachusetts Insttute of Technoogy, cwru.edu/msb/pubs.htm accessed: Mar. 10, 2011), [20] M. S. Brancky. Mutpe Lyapunov functons and other anayss toos for swtched and hybrd systems. IEEE Trans. on Automatc Contro, 434): , Apr [21] D. Lberzon. Swtchng n Systems and Contro. Systems and Contro: Foundatons and Appcatons. Brkhäuser, Boston, MA, USA, [22] D. Lberzon and A. S. Morse. Basc probems n stabty and desgn of swtched systems. IEEE Contro Systems Magazne, 195):59 70, October [23] R. W. Brockett. In H. L. Trenteman and J. C. Wems, edtors, Essays on Contro: Perspectves n the Theory and ts Appcatons, chapter 2, pages Brkhäuser, Boston, MA, USA, frst edton, March [24] M. Žefran and J. W. Burdck. Stabzaton of systems wth changng dynamcs by means of swtchng. In Proc. of the IEEE Internatona Conference on Robotcs and Automaton, voume 2, pages , Leuven, Begum, May [25] M. Žefran and J. W. Burdck. Desgn of swtchng controers for systems wth changng dynamcs. In Proc. of the IEEE Conference on Decson and Contro, voume 2, pages , Tampa, FL, USA, December [26] T. Kröger and F. M. Wah. Stabzng hybrd swtched moton contro systems wth an on-ne trajectory generator. In Proc. of the IEEE Internatona Conference on Robotcs and Automaton, pages , Anchorage, AK, USA, May [27] R. Featherstone. Rgd Body Dynamcs Agorthms. Sprnger, New York, NY, USA, frst edton, [28] T. Kröger. Openng the door to new sensor-based robot appcatons The Refexxes Moton Lbrares. In Proc. of the IEEE Internatona Conference on Robotcs and Automaton, Shangha, Chna, May [29] Refexxes GmbH, Sandknö 7, D Hamdorf, Germany. Hompepage. accessed: Feb. 6, 2012). Internet,
Predictive Control of a Smart Grid: A Distributed Optimization Algorithm with Centralized Performance Properties*
Predctve Contro of a Smart Grd: A Dstrbuted Optmzaton Agorthm wth Centrazed Performance Propertes* Phpp Braun, Lars Grüne, Chrstopher M. Keett 2, Steven R. Weer 2, and Kar Worthmann 3 Abstract The authors
Branch-and-Price and Heuristic Column Generation for the Generalized Truck-and-Trailer Routing Problem
REVISTA DE MÉTODOS CUANTITATIVOS PARA LA ECONOMÍA Y LA EMPRESA (12) Págnas 5 38 Dcembre de 2011 ISSN: 1886-516X DL: SE-2927-06 URL: http://wwwupoes/revmetcuant/artphp?d=51 Branch-and-Prce and Heurstc Coumn
Swing-Free Transporting of Two-Dimensional Overhead Crane Using Sliding Mode Fuzzy Control
Swng-Free Transportng of Two-Dmensona Overhead Crane Usng Sdng Mode Fuzzy Contro Dantong Lu, Janqang, Dongn Zhao, and We Wang Astract An adaptve sdng mode fuzzy contro approach s proposed for a two-dmensona
Approximation Algorithms for Data Distribution with Load Balancing of Web Servers
Approxmaton Agorthms for Data Dstrbuton wth Load Baancng of Web Servers L-Chuan Chen Networkng and Communcatons Department The MITRE Corporaton McLean, VA 22102 chen@mtreorg Hyeong-Ah Cho Department of
SIMPLIFYING NDA PROGRAMMING WITH PROt SQL
SIMPLIFYING NDA PROGRAMMING WITH PROt SQL Aeen L. Yam, Besseaar Assocates, Prnceton, NJ ABSRACf The programmng of New Drug Appcaton (NDA) Integrated Summary of Safety (ISS) usuay nvoves obtanng patent
An Efficient Job Scheduling for MapReduce Clusters
Internatona Journa of Future Generaton ommuncaton and Networkng, pp. 391-398 http://dx.do.org/10.14257/jfgcn.2015.8.2.32 An Effcent Job Schedung for MapReduce usters Jun Lu 1, Tanshu Wu 1, and Mng We Ln
TCP/IP Interaction Based on Congestion Price: Stability and Optimality
TCP/IP Interacton Based on Congeston Prce: Stabty and Optmaty Jayue He Eectrca Engneerng Prnceton Unversty Ema: jhe@prncetonedu Mung Chang Eectrca Engneerng Prnceton Unversty Ema: changm@prncetonedu Jennfer
Recurrence. 1 Definitions and main statements
Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.
Expressive Negotiation over Donations to Charities
Expressve Negotaton over Donatons to Chartes Vncent Contzer Carnege Meon Unversty 5000 Forbes Avenue Pttsburgh, PA 523, USA [email protected] Tuomas Sandhom Carnege Meon Unversty 5000 Forbes Avenue Pttsburgh,
Predicting Advertiser Bidding Behaviors in Sponsored Search by Rationality Modeling
Predctng Advertser Bddng Behavors n Sponsored Search by Ratonaty Modeng Hafeng Xu Centre for Computatona Mathematcs n Industry and Commerce Unversty of Wateroo Wateroo, ON, Canada [email protected] Dy
The Dynamics of Wealth and Income Distribution in a Neoclassical Growth Model * Stephen J. Turnovsky. University of Washington, Seattle
The Dynamcs of Weath and Income Dstrbuton n a Neocassca Growth Mode * Stephen J. Turnovsy Unversty of Washngton, Seatte Ceca García-Peñaosa CNRS and GREQAM March 26 Abstract: We examne the evouton of the
Multi-agent System for Custom Relationship Management with SVMs Tool
Mut-agent System for Custom Reatonshp Management wth SVMs oo Yanshan Xao, Bo Lu, 3, Dan Luo, and Longbng Cao Guangzhou Asan Games Organzng Commttee, Guangzhou 5063, P.R. Chna Facuty of Informaton echnoogy,
A Resources Allocation Model for Multi-Project Management
A Resources Aocaton Mode for Mut-Proect Management Hamdatou Kane, Aban Tsser To cte ths verson: Hamdatou Kane, Aban Tsser. A Resources Aocaton Mode for Mut-Proect Management. 9th Internatona Conference
Comparison of workflow software products
Internatona Conference on Computer Systems and Technooges - CompSysTech 2006 Comparson of worfow software products Krasmra Stoova,Todor Stoov Abstract: Ths research addresses probems, reated to the assessment
GRADIENT METHODS FOR BINARY INTEGER PROGRAMMING
Proceedns of the 4st Internatona Conference on Computers & Industra Enneern GRADIENT METHODS FOR BINARY INTEGER PROGRAMMING Chen-Yuan Huan¹, Ta-Chun Wan² Insttute of Cv Avaton, Natona Chen Kun Unversty,
Clustering based Two-Stage Text Classification Requiring Minimal Training Data
OI: 10.2298/CSIS120130044Z Custerng based Two-Stage Text Cassfcaton Requrng Mnma Tranng ata Xue Zhang 1,2 and Wangxn Xao 3,4 1 Key Laboratory of Hgh Confdence Software Technooges, Mnstry of Educaton, Pekng
VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) 2127472, Fax: (370-5) 276 1380, Email: info@teltonika.
VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual
Dynamic Virtual Network Allocation for OpenFlow Based Cloud Resident Data Center
56 IEICE TRANS. COMMUN., VOL.E96 B, NO. JANUARY 203 PAPER Speca Secton on Networ Vrtuazaton, and Fuson Patform of Computng and Networng Dynamc Vrtua Networ Aocaton for OpenFow Based Coud Resdent Data Center
An Ensemble Classification Framework to Evolving Data Streams
Internatona Journa of Scence and Research (IJSR) ISSN (Onne): 39-7064 An Ensembe Cassfcaton Framework to Evovng Data Streams Naga Chthra Dev. R MCA, (M.Ph), Sr Jayendra Saraswathy Maha Vdyaaya, Coege of
Chapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT
Chapter 4 ECOOMIC DISATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the
Prediction of Success or Fail of Students on Different Educational Majors at the End of the High School with Artificial Neural Networks Methods
Predcton of Success or Fa of on Dfferent Educatona Maors at the End of the Hgh Schoo th Artfca Neura Netors Methods Sayyed Mad Maznan, Member, IACSIT, and Sayyede Azam Aboghasempur Abstract The man obectve
SMOOTH TRAJECTORY PLANNING ALGORITHMS FOR INDUSTRIAL ROBOTS: AN EXPERIMENTAL EVALUATION
1. Albano LANZUTTI SMOOTH TRAJECTORY PLANNING ALGORITHMS FOR INDUSTRIAL ROBOTS: AN EXPERIMENTAL EVALUATION 1. DIPARTIMENTO DI INGEGNERIA ELETTRICA, GESTIONALE E MECCANICA UNIVERSITA' DI UDINE, UDINE ITALY
8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by
6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng
Off-line and on-line scheduling on heterogeneous master-slave platforms
Laboratore de Informatque du Paraésme Écoe Normae Supéreure de Lyon Unté Mxte de Recherche CNRS-INRIA-ENS LYON-UCBL n o 5668 Off-ne and on-ne schedung on heterogeneous master-save patforms Jean-Franços
An Interest-Oriented Network Evolution Mechanism for Online Communities
An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne
2) A single-language trained classifier: one. classifier trained on documents written in
Openng the ega terature Porta to mutngua access E. Francescon, G. Perugne ITTIG Insttute of Lega Informaton Theory and Technooges Itaan Natona Research Counc, Forence, Itay Te: +39 055 43999 Fax: +39 055
What is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..
Laddered Multilevel DC/AC Inverters used in Solar Panel Energy Systems
Proceedngs of the nd Internatonal Conference on Computer Scence and Electroncs Engneerng (ICCSEE 03) Laddered Multlevel DC/AC Inverters used n Solar Panel Energy Systems Fang Ln Luo, Senor Member IEEE
I. INTRODUCTION. 1 IRCCyN: UMR CNRS 6596, Ecole Centrale de Nantes, Université de Nantes, Ecole des Mines de Nantes
he Knematc Analyss of a Symmetrcal hree-degree-of-freedom lanar arallel Manpulator Damen Chablat and hlppe Wenger Insttut de Recherche en Communcatons et Cybernétque de Nantes, rue de la Noë, 442 Nantes,
Support Vector Machines
Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada [email protected] Abstract Ths s a note to explan support vector machnes.
Damage detection in composite laminates using coin-tap method
Damage detecton n composte lamnates usng con-tap method S.J. Km Korea Aerospace Research Insttute, 45 Eoeun-Dong, Youseong-Gu, 35-333 Daejeon, Republc of Korea [email protected] 45 The con-tap test has the
A Secure Password-Authenticated Key Agreement Using Smart Cards
A Secure Password-Authentcated Key Agreement Usng Smart Cards Ka Chan 1, Wen-Chung Kuo 2 and Jn-Chou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,
7.5. Present Value of an Annuity. Investigate
7.5 Present Value of an Annuty Owen and Anna are approachng retrement and are puttng ther fnances n order. They have worked hard and nvested ther earnngs so that they now have a large amount of money on
Answer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy
4.02 Quz Solutons Fall 2004 Multple-Choce Questons (30/00 ponts) Please, crcle the correct answer for each of the followng 0 multple-choce questons. For each queston, only one of the answers s correct.
A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm
Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):1884-1889 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel
BERNSTEIN POLYNOMIALS
On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful
NON-CONSTANT SUM RED-AND-BLACK GAMES WITH BET-DEPENDENT WIN PROBABILITY FUNCTION LAURA PONTIGGIA, University of the Sciences in Philadelphia
To appear n Journal o Appled Probablty June 2007 O-COSTAT SUM RED-AD-BLACK GAMES WITH BET-DEPEDET WI PROBABILITY FUCTIO LAURA POTIGGIA, Unversty o the Scences n Phladelpha Abstract In ths paper we nvestgate
The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis
The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna [email protected] Abstract.
J. Parallel Distrib. Comput.
J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n
"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *
Iranan Journal of Scence & Technology, Transacton B, Engneerng, ol. 30, No. B6, 789-794 rnted n The Islamc Republc of Iran, 006 Shraz Unversty "Research Note" ALICATION OF CHARGE SIMULATION METHOD TO ELECTRIC
A Simple Congestion-Aware Algorithm for Load Balancing in Datacenter Networks
A Smpe Congeston-Aware Agorthm for Load Baancng n Datacenter Networs Mehrnoosh Shafee, and Javad Ghader, Coumba Unversty Abstract We study the probem of oad baancng n datacenter networs, namey, assgnng
v a 1 b 1 i, a 2 b 2 i,..., a n b n i.
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are
Cardiovascular Event Risk Assessment Fusion of Individual Risk Assessment Tools Applied to the Portuguese Population
Cardovascuar Event Rsk Assessment Fuson of Indvdua Rsk Assessment Toos Apped to the Portuguese Popuaton S. Paredes, T. Rocha, P. de Carvaho, J. Henrques, J. Moras*, J. Ferrera, M. Mendes Abstract Cardovascuar
Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College
Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure
Vision Mouse. Saurabh Sarkar a* University of Cincinnati, Cincinnati, USA ABSTRACT 1. INTRODUCTION
Vson Mouse Saurabh Sarkar a* a Unversty of Cncnnat, Cncnnat, USA ABSTRACT The report dscusses a vson based approach towards trackng of eyes and fngers. The report descrbes the process of locatng the possble
DEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
Factored Conditional Restricted Boltzmann Machines for Modeling Motion Style
Factored Condtona Restrcted Botzmann Machnes for Modeng Moton Stye Graham W. Tayor [email protected] Geoffrey E. Hnton [email protected] Department of Computer Scence, Unversty of Toronto, Toronto,
Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic
Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange
Extending Probabilistic Dynamic Epistemic Logic
Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set
Neural Network-based Colonoscopic Diagnosis Using On-line Learning and Differential Evolution
Neura Networ-based Coonoscopc Dagnoss Usng On-ne Learnng and Dfferenta Evouton George D. Magouas, Vasss P. Paganaos * and Mchae N. Vrahats * Department of Informaton Systems and Computng, Brune Unversty,
XAC08-6 Professional Project Management
1 XAC08-6 Professona Project anagement Ths Lecture: Tte s so manager shoud ncude a s management pan a document that gudes any experts agree Some faure project to Ba, ba, ba, ba Communcaton anagement Wee
Towards Specialization of the Contract-Aware Software Development Process
Towards Specalzaton of the Contract-Aware Software Development Process Anna Derezńska, Przemysław Ołtarzewsk Insttute of Computer Scence, Warsaw Unversty of Technology, Nowowejska 5/9, 00-665 Warsaw, Poland
where the coordinates are related to those in the old frame as follows.
Chapter 2 - Cartesan Vectors and Tensors: Ther Algebra Defnton of a vector Examples of vectors Scalar multplcaton Addton of vectors coplanar vectors Unt vectors A bass of non-coplanar vectors Scalar product
A Multi-Camera System on PC-Cluster for Real-time 3-D Tracking
The 23 rd Conference of the Mechancal Engneerng Network of Thaland November 4 7, 2009, Chang Ma A Mult-Camera System on PC-Cluster for Real-tme 3-D Trackng Vboon Sangveraphunsr*, Krtsana Uttamang, and
benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).
REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or
ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING
ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 610-519-4390,
Clever techniques for purchasing electricity
n o at z a r e b! s u F gn be Cever technques for purchasng eectrcty Make your choce today What does the fu berazaton of the eectrcty reta market mean? What w change, who w beneft, why and n what way?
Multi-Robot Tracking of a Moving Object Using Directional Sensors
Mult-Robot Trackng of a Movng Object Usng Drectonal Sensors Xaomng Hu, Karl H. Johansson, Manuel Mazo Jr., Alberto Speranzon Dept. of Sgnals, Sensors & Systems Royal Insttute of Technology, SE- 44 Stockholm,
NMT EE 589 & UNM ME 482/582 ROBOT ENGINEERING. Dr. Stephen Bruder NMT EE 589 & UNM ME 482/582
NMT EE 589 & UNM ME 482/582 ROBOT ENGINEERING Dr. Stephen Bruder NMT EE 589 & UNM ME 482/582 7. Root Dynamcs 7.2 Intro to Root Dynamcs We now look at the forces requred to cause moton of the root.e. dynamcs!!
Loop Parallelization
- - Loop Parallelzaton C-52 Complaton steps: nested loops operatng on arrays, sequentell executon of teraton space DECLARE B[..,..+] FOR I :=.. FOR J :=.. I B[I,J] := B[I-,J]+B[I-,J-] ED FOR ED FOR analyze
Luby s Alg. for Maximal Independent Sets using Pairwise Independence
Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent
Feasibility of Using Discriminate Pricing Schemes for Energy Trading in Smart Grid
Feasblty of Usng Dscrmnate Prcng Schemes for Energy Tradng n Smart Grd Wayes Tushar, Chau Yuen, Bo Cha, Davd B. Smth, and H. Vncent Poor Sngapore Unversty of Technology and Desgn, Sngapore 138682. Emal:
RESEARCH ON DUAL-SHAKER SINE VIBRATION CONTROL. Yaoqi FENG 1, Hanping QIU 1. China Academy of Space Technology (CAST) yaoqi.feng@yahoo.
ICSV4 Carns Australa 9- July, 007 RESEARCH ON DUAL-SHAKER SINE VIBRATION CONTROL Yaoq FENG, Hanpng QIU Dynamc Test Laboratory, BISEE Chna Academy of Space Technology (CAST) [email protected] Abstract
Power-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts
Power-of-wo Polces for Sngle- Warehouse Mult-Retaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)
Linear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits
Lnear Crcuts Analyss. Superposton, Theenn /Norton Equalent crcuts So far we hae explored tmendependent (resste) elements that are also lnear. A tmendependent elements s one for whch we can plot an / cure.
On the Interaction between Load Balancing and Speed Scaling
On the Interacton between Load Balancng and Speed Scalng Ljun Chen, Na L and Steven H. Low Engneerng & Appled Scence Dvson, Calforna Insttute of Technology, USA Abstract Speed scalng has been wdely adopted
How To Solve An Onlne Control Polcy On A Vrtualzed Data Center
Dynamc Resource Allocaton and Power Management n Vrtualzed Data Centers Rahul Urgaonkar, Ulas C. Kozat, Ken Igarash, Mchael J. Neely [email protected], {kozat, garash}@docomolabs-usa.com, [email protected]
Lecture 3: Force of Interest, Real Interest Rate, Annuity
Lecture 3: Force of Interest, Real Interest Rate, Annuty Goals: Study contnuous compoundng and force of nterest Dscuss real nterest rate Learn annuty-mmedate, and ts present value Study annuty-due, and
Increasing Supported VoIP Flows in WMNs through Link-Based Aggregation
Increasng Supported VoIP Fows n WMNs through n-based Aggregaton J. Oech, Y. Hamam, A. Kuren F SATIE TUT Pretora, South Afrca [email protected] T. Owa Meraa Insttute Counc of Scentfc and Industra Research (CSIR)
INVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS
21 22 September 2007, BULGARIA 119 Proceedngs of the Internatonal Conference on Informaton Technologes (InfoTech-2007) 21 st 22 nd September 2007, Bulgara vol. 2 INVESTIGATION OF VEHICULAR USERS FAIRNESS
Design and Development of a Security Evaluation Platform Based on International Standards
Internatonal Journal of Informatcs Socety, VOL.5, NO.2 (203) 7-80 7 Desgn and Development of a Securty Evaluaton Platform Based on Internatonal Standards Yuj Takahash and Yoshm Teshgawara Graduate School
On the Interaction between Load Balancing and Speed Scaling
On the Interacton between Load Balancng and Speed Scalng Ljun Chen and Na L Abstract Speed scalng has been wdely adopted n computer and communcaton systems, n partcular, to reduce energy consumpton. An
How To Understand The Results Of The German Meris Cloud And Water Vapour Product
Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPP-ATBD-ClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller
Ring structure of splines on triangulations
www.oeaw.ac.at Rng structure of splnes on trangulatons N. Vllamzar RICAM-Report 2014-48 www.rcam.oeaw.ac.at RING STRUCTURE OF SPLINES ON TRIANGULATIONS NELLY VILLAMIZAR Introducton For a trangulated regon
Calculation of Sampling Weights
Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a two-stage stratfed cluster desgn. 1 The frst stage conssted of a sample
Stability, observer design and control of networks using Lyapunov methods
Stablty, observer desgn and control of networks usng Lyapunov methods von Lars Naujok Dssertaton zur Erlangung des Grades enes Doktors der Naturwssenschaften - Dr. rer. nat. - Vorgelegt m Fachberech 3
Distributed Multi-Target Tracking In A Self-Configuring Camera Network
Dstrbuted Mult-Target Trackng In A Self-Confgurng Camera Network Crstan Soto, B Song, Amt K. Roy-Chowdhury Department of Electrcal Engneerng Unversty of Calforna, Rversde {cwlder,bsong,amtrc}@ee.ucr.edu
An Analysis of Dynamic Severity and Population Size
An Analyss of Dynamc Severty and Populaton Sze Karsten Wecker Unversty of Stuttgart, Insttute of Computer Scence, Bretwesenstr. 2 22, 7565 Stuttgart, Germany, emal: [email protected]
Politecnico di Torino. Porto Institutional Repository
Poltecnco d orno Porto Insttutonal Repostory [Proceedng] rbt dynamcs and knematcs wth full quaternons rgnal Ctaton: Andres D; Canuto E. (5). rbt dynamcs and knematcs wth full quaternons. In: 16th IFAC
Traffic State Estimation in the Traffic Management Center of Berlin
Traffc State Estmaton n the Traffc Management Center of Berln Authors: Peter Vortsch, PTV AG, Stumpfstrasse, D-763 Karlsruhe, Germany phone ++49/72/965/35, emal [email protected] Peter Möhl, PTV AG,
An Electricity Trade Model for Microgrid Communities in Smart Grid
An Electrcty Trade Model for Mcrogrd Countes n Sart Grd Tansong Cu, Yanzh Wang, Shahn Nazaran and Massoud Pedra Unversty of Southern Calforna Departent of Electrcal Engneerng Los Angeles, CA, USA {tcu,
2. SYSTEM MODEL. the SLA (unlike the only other related mechanism [15] we can compare it is never able to meet the SLA).
Managng Server Energy and Operatonal Costs n Hostng Centers Yyu Chen Dept. of IE Penn State Unversty Unversty Park, PA 16802 [email protected] Anand Svasubramanam Dept. of CSE Penn State Unversty Unversty
The OC Curve of Attribute Acceptance Plans
The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4
Generating Timed Trajectories for Autonomous Robotic Platforms: A Non-Linear Dynamical Systems Approach
Generatng Tmed Trajectores for Autonomous Robotc Platforms: A Non-Lnear Dynamcal Systems Approach Crstna Manuela Pexoto dos Santos Open Access Database www.-techonlne.com. Introducton Over the last years,
Hacia un Modelo de Red Inmunológica Artificial Basado en Kernels. Towards a Kernel Based Model for Artificial Immune Networks
Haca un Modeo de Red Inmunoógca Artfca Basado en Kernes Towards a Kerne Based Mode for Artfca Immune Networs Juan C. Gaeano, Ing. 1, Fabo A. Gonzáez, PhD. 1 Integent Systems Research Lab, Natona Unversty
21 Vectors: The Cross Product & Torque
21 Vectors: The Cross Product & Torque Do not use our left hand when applng ether the rght-hand rule for the cross product of two vectors dscussed n ths chapter or the rght-hand rule for somethng curl
Faraday's Law of Induction
Introducton Faraday's Law o Inducton In ths lab, you wll study Faraday's Law o nducton usng a wand wth col whch swngs through a magnetc eld. You wll also examne converson o mechanc energy nto electrc energy
Laws of Electromagnetism
There are four laws of electromagnetsm: Laws of Electromagnetsm The law of Bot-Savart Ampere's law Force law Faraday's law magnetc feld generated by currents n wres the effect of a current on a loop of
A Design Method of High-availability and Low-optical-loss Optical Aggregation Network Architecture
A Desgn Method of Hgh-avalablty and Low-optcal-loss Optcal Aggregaton Network Archtecture Takehro Sato, Kuntaka Ashzawa, Kazumasa Tokuhash, Dasuke Ish, Satoru Okamoto and Naoak Yamanaka Dept. of Informaton
How Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence
1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh
ON THE ACCURACY, REPEATABILITY, AND DEGREE OF INFLUENCE OF KINEMATICS PARAMETERS FOR INDUSTRIAL ROBOTS
Internatonal Journal of Modellng and Smulaton, Vol. 22, No. 3, 2002 ON THE ACCURACY, REPEATABILITY, AND DEGREE OF INFLUENCE OF KINEMATICS PARAMETERS FOR INDUSTRIAL ROBOTS P.S. Shakolas, K.L. Conrad, and
