Learning to Serve and Bounce a Ball
|
|
- Cornelius Walsh
- 5 years ago
- Views:
Transcription
1 Sndr Amend Gregor Gebhrdt Technische Universität Drmstdt Abstrct In this pper we investigte lerning the tsks of bll serving nd bll bouncing. These tsks disply chrcteristics which re common in vriety of motor skills. To lern the required motor skills for these tsks the robot uses eltive Entropy Policy Serch which is stte of the rt method in Policy Serch einforcement Lerning. Our experiments show tht EPS does not only converge consistently to good solutions, but lso robust solutions. 1 Introduction Lerning motor skills similr to those of humn beings poses chllenging tsk for robots. They re difficult nd non-trivil to lern, but re necessry for performing complex tsks under vrying conditions. There re severl common spects to motor skills: Motor skills re often trget oriented. For exmple reching movements re often directed to specific objects. Motor skills re often lso constrined by time. As n exmple, bll hs to be cught before it hits the ground. Some tsks such s wlking require periodic motor skills, which involve repetedly performing similr movements. Most motor skills lso require feedbck to compenste for errors. For exmple when writing we try to keep constnt pressure on the pen. In this pper we will tke closer look t the motor skills of serving nd bouncing bll. Bll serving requires the robot to hit dropped bll to desired trget loction on the ground. Bll bouncing involves repetedly hitting the bll into the ir while keeping it centered bove the pddle. They re good representtives of the common spects of motor skills mentioned bove. Bll serving is trget oriented nd time dependent while bll bouncing enhnces serving with the spect of feedbck nd periodic movement. A detiled description of the tsks follows in Section 2. For lerning these tsks we will use the stte of the rt method eltive Entropy Policy Serch EPS which is explined in Section Furthermore we will compre EPS to Finite Differences nd evlute the robustness of our solution in Section 4. The benefit of lerning feedbck controller for bll bouncing will lso be evluted. 2 Bckground Before we come to the methods we used to lern the bll bouncing tsk, we will first describe the setup of the bll bouncing environment we used for the experiments nd then show how we modeled the movements of the robot rm. 2.1 The Experiment Setup For the experiments we used Brrett WAM Arm with seven degrees of freedom with tble tennis rcket ttched s the end effector. The robot rm ws simulted using the SL Simultion nd el-time Control Softwre Pckge Schl, The kinemtic configurtion of the Brrett WAM is shown in Figure 1. For our experiments we only ctuted the 4th nd the 7th joint. The 4th joint ws used to perform stroke movement, which will be explined in detil in the next section, nd the 7th joint ws used to control the motion of the bll in the x-direction. In the bll serving tsk the bll ws initilly dropped from the ceiling bove the tble tennis rcket. The robot hs to perform hitting motion to redirect the bll to trget loction on the ground. The trget loctions were specified s prt of the tsk. Given the trget loction x g nd the loction where the bll lnded x b the rewrd for the bll serving tsk ws given by = x g x b 2 In the bll bouncing tsk the bll ws lso dropped from the ceiling. Insted of trget on the ground the bll hd to be hit bck to the initil strting height bove the rcket. In this wy the robot nd bll return to the sme stte s t the strt of the movement, nd the ction cn be performed repetedly. Given tht
2 the pek of the blls trjectory is t x p nd the initil position ws t x i the rewrd function for the bll bouncing tsk ws given by = x i x p 2 ẋ p 2 For the bll bouncing tsk the bll position ws limited to the x-z plne. The lerned controller should lso be robust to disturbnces in the x direction. Figure 2: First pproch of prmetric representtion of stroke: sinusoidl trjectory of joint 4 elbow with mplitude A nd period T. hitting phse, nd fixed return phse in which the robot rm returns to its initil position. The dely phse strts when Bll hs reched its pek position. The trjectory of the elbow joint of this representtion is depicted in Figure 2. Figure 1: The kinemtic configurtion of the 7-DOF Brrett WAM Arm. The blue rrows depict the rottion xes of the joints. For our experiments we ctuted the 4th nd the 7th joint, while the other joints were kept in their zero position. 2.2 Prmetric epresenttion of Stroke The first nd most intuitive prmetric representtion of the stroke ws simple sinusoidl movement in the 4th joint elbow of the robot. The prmeters of this movement consisted only of the mplitude A of the sine nd its period T. The trjectory of the 4-th joint for this movement is outlined in Figure 2. However, this representtion did not led to good results. The second pproch we followed ws slightly more sophisticted representtion. Tht prt of the movement, in which the bll is hit, is still sinusoidl trjectory with mplitude A nd period T. Additionlly we introduced dely phse with the prmeter d before, nd return phse fter the stroke phse. So the totl movement is composed of dely phse, sinusoidl Figure 3: Second pproch of prmetric representtion of stroke: The movement consists of three phses: 1 dely phse with prmeter d, in which the rm rests t its initil position. 2 the hitting phse in which the rm follows sinusoidl trjectory with mplitude A nd period T in joint 4 to hit the bll. We will show in Section 4, tht we were ble to chieve good results with this representtion. 2.3 PD Control Additionlly to the stroke movement in joint 4 elbow of the robot, we lerned PD controller proportionlderivtive controller for the 7th joint, to rect on movements of the bll in x-direction. A PD controller hs the two prmeters k p nd k d which re pplied
3 Sndr Amend, Gregor Gebhrdt to the error nd the error s derivtive, respectively: u = k p e + k d ė. 1 The error e is the difference between desired position x d nd the bll s position x b, nlogously the error s derivtion is the difference between desired velocity ẋ d nd the bll s velocity ẋ b ll of them re only the x-components of positions nd velocities: u = k p x d x b + k d ẋ d ẋ b. 2 For the bll bouncing tsk the desired position of the bll is x d = 0, which is centered bove the rcket, nd it hs velocity of ẋ d = 0. For the bll serving tsk the PD controller ws not used. Insted the robot selected fixed ngle for the wrist joint throughout the trjectory. Using this joint it is ble to hit the bll in different x directions. 2.4 The Lerning Method In reinforcement lerning the generl setup Sutton nd Brto, 1998 considers n gent tht intercts with its environment. The ctions tken by this gent re bsed on Mrkov Decision Process MDP. Hence, if the gent is in stte s S it selects n ction A using the policy π s. The gent then trnsfers to the next stte s with the trnsition probbility Pss = ps s,. This trnsition yields rewrd rs, = s for the gent. The gol of reinforcement lerning is now to find policy tht mximizes the expected rewrd of the gent Jπ = s, µ π sπ s s 3 Here, µ π s denotes the probbility ob the gent being in stte s, the stte distribution. Policy serch methods re one group of methods to mximize the expected rewrd by directly serching for n optiml policy. However, one drwbck of most of these methods is they tke only the experience of the most recent trils into ccount for computing the new policy. Hence, there is loss of informtion from older policy evlutions during the policy improvement step. entropy between the observed dt distribution qs, nd the dt distribution p π s, = µ π sπ s Peters et l., 2010 is constrint to n upper bound ε: Dp π q = s, µ π sπ s log µπ sπ s qs, ε. 4 Together with the ssumption of sttionry stte distribution µ π s nd the constrint tht probbility distributions must sum to 1, they get the following problem sttement: Problem Sttement. The gol of reltive entropy policy serch is to obtin policies tht mximize the expected rewrd Jπ while the informtion loss is bounded, i.e., mx Jπ = µ π sπ s π,µ π s 5 s, s.t. ε µ π sπ s log µπ sπ s 6 qs, s, µ π s φ s = µ π sπ spss φ s 7 s s,,s 1 = s, µ π sπ s 8 Both µ π nd π re probbility distributions nd the fetures φ s of the MDP re sttionry under policy π. 3 Lerning the Stroke As we described in Section 2.2, the stroke movements re bstrcted using prmetric description. Due to this simplifiction we do not hve ny sttes or, from nother point of view, we re lwys in the sme stte, when executing the movement. Thus we cn simplify the EPS problem sttement to the following form: Problem Sttement. Mximize the expected rewrd Jπ while the loss of informtion is bounded, i.e., mx Jπ = π s.t. ε π 9 π log π q eltive Entropy Policy Serch 1 = π 11 To circumvent the problem of loss of informtion when directly optimizing the policy, Peters et l proposed the reltive entropy policy serch EPS method. The objective function here is gin the expected rewrd, which they wnt to be mximized. But dditionlly the Kullbck-Leibler divergence or reltive From this simplified problem we cn then derive the policy updte π = q exp q exp, 12
4 with the Lgrngin prmeter which we obtin from the minimiztion of the dul function g = log q exp + ε. 13 As we re using policy itertion the dt distribution q is inherent in the distribution of the smples from the old policy. Hence the smple-bsed policy updte becomes weighted mximum likelihood estimtion with weight w i for the i-th smple: r exp i w i =, 14 i=1 exp r i where r i is the rewrd received by the i-th smple of the policy. The dul function becomes then 1 ri ĝ = log exp + ε, 15 i=1 with the number of smples. The lerning lgorithm is outlined in Algorithm 1. 4 Experiments To evlute EPS for lerning motor skills we rn three experiments. In the first experiment we compred the performnce of EPS with tht of finite differences with POP on the bll serving tsk. In the second experiment we evluted the effect of different vlues for ε on the performnce of EPS. In the third experiment the robot lerns bll bouncing with feedbck controller to compenste for errors. 4.1 Comprison with Finite Differences In this experiment the robot ws given the tsk of serving the bll to three different loctions: x g = [0, 1.5] x g = [1, 2] x g = [2, 1] Ech trget loction ws evluted three times with both methods. For comprison the robot used EPS nd finite differences with POP. For EPS the ε ws set to 1. For finite differences with POP the initil step size ws The step size ws incresed by fctor of 1.2 when the grdient direction styed the sme nd decresed by fctor of 0.5 when the grdient flipped. Both methods were given 50 itertions for ech tsk nd 15 smples per itertion. The results of the experiments re shown in Figure 4. Policy Itertion with Adpted EPS Input: mximl informtion loss ε, initil policy π 0, number of itertions, number of smples M. for k do Smpling:: Drw M smples i from the policy π k. Critic: Evlute policy forech smple i, i {1,..., M} do Perfrom experiment with smple i to obtin rewrd r i. Compute the Dul Function: 1 ri ĝ = log exp + ε i=1 Compute the Dul Function s Derivtive: ĝ 1 ri = log exp i=1 1 i=1 r r i exp i + ε i=1 exp r i Optimize: = fmin BFGSĝ, ĝ, 0. Actor: Improve policy ew Policy is weighted mximum likelihood estimtion of smples with weights r exp i w i = i=1 exp r i Algorithm 1: Policy Itertion with dpted EPS. fmin BFGS stnds for the Broyden-Fletcher- Goldfrb-Shnnon BFGS optimiztion method. As cn be seen by the plots both methods strted with the sme performnce s they were initilized with the sme prmeters. However EPS quickly converged to the trget loction. In comprison the finite differences method converged more slowly. The solutions found by finite differences tended to perform worse thn those of EPS. This is due to finite differences often ending in locl mximum where it simply lets the bll drop to the ground. At this point there is no longer grdient nd the method stops lerning. This experiment shows tht EPS is more robust to getting stuck in such locl mximum.
5 Sndr Amend, Gregor Gebhrdt 0.2 Bll Trjectory Bll Bouncing without Controller z Position x 10 3 x Position Figure 4: Comprison Finite Differences with POP nd EPS finl rewrd ewrds After 50 Itertions epsilon Figure 5: Effect of different ε vlues 4.2 Effect of different vlues for ε In the second experiment we investigted the effects of chnging the min prmeter of the EPS method. The evlution ws gin performed using the bll serving tsk. In this cse the bll ws lwys served to the sme trget loction. x g = [ 2, 2] As performnce mesure we looked t the rewrds chieved fter 50 itertions. Agin ech itertion consisted of 15 smples. Ech ε vlue ws tested five times. The results of the experiment re shown in Figure 5. As cn be seen the EPS lgorithm is ble to consistently obtin good finl rewrds when using ε vlues in the rnge 0.4 to 2. Using higher ε vlues seems to hve led to numericl instbilities nd the method Figure 6: Bll trjectory without feedbck controller. A smll error ccumultes nd would eventully led to the bll flling off the pddle. Student Version of MATLAB does not lern. For smller ε vlues the performnce grdully decreses. The wide pek of performnce indictes tht the performnce of EPS is not sensitive to ε nd cn be esily tuned. 4.3 Lerning Bll Bouncing In the finl experiment the robot ws given the tsk to robustly perform the bll bouncing tsk. First the robot lerned stndrd hitting movement where the bll ws dropped from the initil position s usul. To lern this hitting motion EPS ws used with 50 itertions, ε = 1 nd 15 smples per itertion. The lerned movement ws conctented into periodic motion ccording to the time it took the bll to get bck to the initil position. The resulting bll trjectory cn be seen in Figure 6. A smll error ccumulted in the x direction which would eventully result in the bll flling off the pddle. We therefore lso lerned PD controller bsed on the blls position nd velocity in the x direction s lredy described in section 2.3. To lern the gins of the PD controller we gin used EPS for 50 itertions. The resulting controller ws evluted by initilly dropping the bll t 2.5 cm increments cross the width of the rcket. In ech tril the robot successfully mnged to bounce the bll bck to center of the rcket nd keep bouncing it there. As n dditionl test we evluted the sitution where the bll is thrown ner the edge of the pddle with horizontl speed of 1.25 m/s. The resulting bll trjectory is shown in Figure 7. The figure shows tht even in this extreme sitution the lerned controller ws still ble to compenste for the error nd successfully perform the bll bouncing tsk.
6 z Position Bll Trjectory Bll Bouncing with Controller x Position Figure 7: Bll trjectory with feedbck controller. The bll is thrown onto the pddle with speed of 1.25 m/s. The width of the pddle is mrked with blck line. The robot is ble to slowly bring the bll to the center of the pddle. 5 Conclusion Student Version of MATLAB In this pper we investigted using the eltive Entropy Policy Serch lgorithm for lerning robot motor skills. We looked t the tsks of bll serving nd bll bouncing. Our experimentl results show tht EPS is robust to getting stuck in locl mxim. EPS is bsed on bounding the informtion loss between policies by vlue ε. We discovered tht the performnce of the lgorithm is not sensitive to this prmeter which mens it cn be esily set. Using the EPS lgorithm the robot ws ble to lern to serve the bll to vrious trget loctions nd robustly perform the bll bouncing tsk. The lerned controller ws even ble to compenste for the bll being thrown onto the pddle with horizontl velocity of 1.25 m/s. In the future we would like to use controller bsed on inverse kinemtics, such tht the pddle cn esily be rotted round the x xis. Using such controller the PD feedbck controller could lso be lerned for the y direction similr to how the robot lerns it now in the x direction. We lso pln to investigte using the stte dependent version of EPS to directly lern to serve the bll to different trget loctions. eferences C. Dniel, G. eumnn, nd J. Peters. Hierrchicl reltive entropy policy serch. In Proceedings of the Interntionl Conference on Artificil Intelligence nd Sttistics AISTATS 2012, C. Dniel, G. eumnn, nd J. Peters. Lerning concurrent motor skills in verstile solution spces. In Proceedings of the Interntionl Conference on obot Systems IOS, 2012b. Jn Peters, K Mülling, nd Ysemin Altun. eltive entropy policy serch. tionl Conference on Artificil Intelligence, Stefn Schl. The sl simultion nd rel-time control softwre pckge. Processing, pges 1 94, ichrd S. Sutton nd Andrew G. Brto. Introduction to einforcement Lerning. MIT Press, Cmbridge, MA, USA, 1st edition, ISB Derivtion of dpted EPS Lgrngin of the progrm in Equtions 9-11: L = π + ε π log π q + λ 1 π = [ π log π ] q λ + ε + λ 16 Differentite the Lgrngin with respect to π: L π = log π q λ + π 1 π = log π q λ 17 Set to zero nd solve for π: log π q = λ 18 π = q exp λ 1 19 = q exp exp 1 λ 20 Since we require tht π = 1, we cn sum up both sides of Eqution 20 over nd obtin: 1 = q exp exp 1 λ 1 = exp 1 λ q exp exp 1 λ 1 = q exp 21
7 Sndr Amend, Gregor Gebhrdt If we insert Eqution 21 into Eqution 20 we get: q exp π = 22 q exp We cn now replce π in the Lgrngin Eqution 16 using Eqution 22 nd obtin the dul function: q exp L = q exp q exp log q q exp λ + ε + λ 23 For the ske of limited spce the following equtions show the simplifiction of only the term in the big squre brckets of Eqution 23: q exp log q λ q exp [ = + log ] q exp λ [ = log ] q exp λ 24 As the term in Eqution 24 is now not dependent on the running vrible of the outer summtion in Eqution 23 nymore, we cn pull it out of tht sum nd thus q exp q exp = Applying the simplifictions of Equtions 24 nd 25 to the Lgrngin in Eqution 23, we obtin the dul function s follows: g = log q exp λ + ε + λ = log q exp + ε 26
Reinforcement learning II
CS 1675 Introduction to Mchine Lerning Lecture 26 Reinforcement lerning II Milos Huskrecht milos@cs.pitt.edu 5329 Sennott Squre Reinforcement lerning Bsics: Input x Lerner Output Reinforcement r Critic
More informationReinforcement Learning
Reinforcement Lerning Tom Mitchell, Mchine Lerning, chpter 13 Outline Introduction Comprison with inductive lerning Mrkov Decision Processes: the model Optiml policy: The tsk Q Lerning: Q function Algorithm
More information19 Optimal behavior: Game theory
Intro. to Artificil Intelligence: Dle Schuurmns, Relu Ptrscu 1 19 Optiml behvior: Gme theory Adversril stte dynmics hve to ccount for worst cse Compute policy π : S A tht mximizes minimum rewrd Let S (,
More informationChapter 0. What is the Lebesgue integral about?
Chpter 0. Wht is the Lebesgue integrl bout? The pln is to hve tutoril sheet ech week, most often on Fridy, (to be done during the clss) where you will try to get used to the ides introduced in the previous
More informationBellman Optimality Equation for V*
Bellmn Optimlity Eqution for V* The vlue of stte under n optiml policy must equl the expected return for the best ction from tht stte: V (s) mx Q (s,) A(s) mx A(s) mx A(s) Er t 1 V (s t 1 ) s t s, t s
More information1 Online Learning and Regret Minimization
2.997 Decision-Mking in Lrge-Scle Systems My 10 MIT, Spring 2004 Hndout #29 Lecture Note 24 1 Online Lerning nd Regret Minimiztion In this lecture, we consider the problem of sequentil decision mking in
More information2D1431 Machine Learning Lab 3: Reinforcement Learning
2D1431 Mchine Lerning Lb 3: Reinforcement Lerning Frnk Hoffmnn modified by Örjn Ekeberg December 7, 2004 1 Introduction In this lb you will lern bout dynmic progrmming nd reinforcement lerning. It is ssumed
More informationChapter 4: Dynamic Programming
Chpter 4: Dynmic Progrmming Objectives of this chpter: Overview of collection of clssicl solution methods for MDPs known s dynmic progrmming (DP) Show how DP cn be used to compute vlue functions, nd hence,
More informationCS 188: Artificial Intelligence Spring 2007
CS 188: Artificil Intelligence Spring 2007 Lecture 3: Queue-Bsed Serch 1/23/2007 Srini Nrynn UC Berkeley Mny slides over the course dpted from Dn Klein, Sturt Russell or Andrew Moore Announcements Assignment
More informationAdministrivia CSE 190: Reinforcement Learning: An Introduction
Administrivi CSE 190: Reinforcement Lerning: An Introduction Any emil sent to me bout the course should hve CSE 190 in the subject line! Chpter 4: Dynmic Progrmming Acknowledgment: A good number of these
More information{ } = E! & $ " k r t +k +1
Chpter 4: Dynmic Progrmming Objectives of this chpter: Overview of collection of clssicl solution methods for MDPs known s dynmic progrmming (DP) Show how DP cn be used to compute vlue functions, nd hence,
More informationModule 6 Value Iteration. CS 886 Sequential Decision Making and Reinforcement Learning University of Waterloo
Module 6 Vlue Itertion CS 886 Sequentil Decision Mking nd Reinforcement Lerning University of Wterloo Mrkov Decision Process Definition Set of sttes: S Set of ctions (i.e., decisions): A Trnsition model:
More informationTime Optimal Control of the Brockett Integrator
Milno (Itly) August 8 - September, 011 Time Optiml Control of the Brockett Integrtor S. Sinh Deprtment of Mthemtics, IIT Bomby, Mumbi, Indi (emil : sunnysphs4891@gmil.com) Abstrct: The Brockett integrtor
More informationProblem Set 3 Solutions
Chemistry 36 Dr Jen M Stndrd Problem Set 3 Solutions 1 Verify for the prticle in one-dimensionl box by explicit integrtion tht the wvefunction ψ ( x) π x is normlized To verify tht ψ ( x) is normlized,
More informationCS 188 Introduction to Artificial Intelligence Fall 2018 Note 7
CS 188 Introduction to Artificil Intelligence Fll 2018 Note 7 These lecture notes re hevily bsed on notes originlly written by Nikhil Shrm. Decision Networks In the third note, we lerned bout gme trees
More informationPHYSICS 211 MIDTERM I 21 April 2004
PHYSICS MIDERM I April 004 Exm is closed book, closed notes. Use only your formul sheet. Write ll work nd nswers in exm booklets. he bcks of pges will not be grded unless you so request on the front of
More informationa < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1
Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the
More informationIn-Class Problems 2 and 3: Projectile Motion Solutions. In-Class Problem 2: Throwing a Stone Down a Hill
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Deprtment of Physics Physics 8T Fll Term 4 In-Clss Problems nd 3: Projectile Motion Solutions We would like ech group to pply the problem solving strtegy with the
More informationFig. 1. Open-Loop and Closed-Loop Systems with Plant Variations
ME 3600 Control ystems Chrcteristics of Open-Loop nd Closed-Loop ystems Importnt Control ystem Chrcteristics o ensitivity of system response to prmetric vritions cn be reduced o rnsient nd stedy-stte responses
More informationLECTURE NOTE #12 PROF. ALAN YUILLE
LECTURE NOTE #12 PROF. ALAN YUILLE 1. Clustering, K-mens, nd EM Tsk: set of unlbeled dt D = {x 1,..., x n } Decompose into clsses w 1,..., w M where M is unknown. Lern clss models p(x w)) Discovery of
More informationDuality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below.
Dulity #. Second itertion for HW problem Recll our LP emple problem we hve been working on, in equlity form, is given below.,,,, 8 m F which, when written in slightly different form, is 8 F Recll tht we
More informationThis lecture covers Chapter 8 of HMU: Properties of CFLs
This lecture covers Chpter 8 of HMU: Properties of CFLs Turing Mchine Extensions of Turing Mchines Restrictions of Turing Mchines Additionl Reding: Chpter 8 of HMU. Turing Mchine: Informl Definition B
More informationDecision Networks. CS 188: Artificial Intelligence Fall Example: Decision Networks. Decision Networks. Decisions as Outcome Trees
CS 188: Artificil Intelligence Fll 2011 Decision Networks ME: choose the ction which mximizes the expected utility given the evidence mbrell Lecture 17: Decision Digrms 10/27/2011 Cn directly opertionlize
More informationObjectives. Materials
Techer Notes Activity 17 Fundmentl Theorem of Clculus Objectives Explore the connections between n ccumultion function, one defined by definite integrl, nd the integrnd Discover tht the derivtive of the
More informationIndefinite Integral. Chapter Integration - reverse of differentiation
Chpter Indefinite Integrl Most of the mthemticl opertions hve inverse opertions. The inverse opertion of differentition is clled integrtion. For exmple, describing process t the given moment knowing the
More informationPHYS Summer Professor Caillault Homework Solutions. Chapter 2
PHYS 1111 - Summer 2007 - Professor Cillult Homework Solutions Chpter 2 5. Picture the Problem: The runner moves long the ovl trck. Strtegy: The distnce is the totl length of trvel, nd the displcement
More informationBayesian Networks: Approximate Inference
pproches to inference yesin Networks: pproximte Inference xct inference Vrillimintion Join tree lgorithm pproximte inference Simplify the structure of the network to mkxct inferencfficient (vritionl methods,
More informationDATA Search I 魏忠钰. 复旦大学大数据学院 School of Data Science, Fudan University. March 7 th, 2018
DATA620006 魏忠钰 Serch I Mrch 7 th, 2018 Outline Serch Problems Uninformed Serch Depth-First Serch Bredth-First Serch Uniform-Cost Serch Rel world tsk - Pc-mn Serch problems A serch problem consists of:
More information4.4 Areas, Integrals and Antiderivatives
. res, integrls nd ntiderivtives 333. Ares, Integrls nd Antiderivtives This section explores properties of functions defined s res nd exmines some connections mong res, integrls nd ntiderivtives. In order
More informationSOLUTIONS FOR ADMISSIONS TEST IN MATHEMATICS, COMPUTER SCIENCE AND JOINT SCHOOLS WEDNESDAY 5 NOVEMBER 2014
SOLUTIONS FOR ADMISSIONS TEST IN MATHEMATICS, COMPUTER SCIENCE AND JOINT SCHOOLS WEDNESDAY 5 NOVEMBER 014 Mrk Scheme: Ech prt of Question 1 is worth four mrks which re wrded solely for the correct nswer.
More informationUnit #9 : Definite Integral Properties; Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties; Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationRecitation 3: More Applications of the Derivative
Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech
More information20 MATHEMATICS POLYNOMIALS
0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of
More informationReview of Calculus, cont d
Jim Lmbers MAT 460 Fll Semester 2009-10 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some
More informationDefinition of Continuity: The function f(x) is continuous at x = a if f(a) exists and lim
Mth 9 Course Summry/Study Guide Fll, 2005 [1] Limits Definition of Limit: We sy tht L is the limit of f(x) s x pproches if f(x) gets closer nd closer to L s x gets closer nd closer to. We write lim f(x)
More informationCalculus - Activity 1 Rate of change of a function at a point.
Nme: Clss: p 77 Mths Helper Plus Resource Set. Copright 00 Bruce A. Vughn, Techers Choice Softwre Clculus - Activit Rte of chnge of function t point. ) Strt Mths Helper Plus, then lod the file: Clculus
More informationMathematics Extension 1
04 Bored of Studies Tril Emintions Mthemtics Etension Written by Crrotsticks & Trebl. Generl Instructions Totl Mrks 70 Reding time 5 minutes. Working time hours. Write using blck or blue pen. Blck pen
More informationMath& 152 Section Integration by Parts
Mth& 5 Section 7. - Integrtion by Prts Integrtion by prts is rule tht trnsforms the integrl of the product of two functions into other (idelly simpler) integrls. Recll from Clculus I tht given two differentible
More informationMath 426: Probability Final Exam Practice
Mth 46: Probbility Finl Exm Prctice. Computtionl problems 4. Let T k (n) denote the number of prtitions of the set {,..., n} into k nonempty subsets, where k n. Argue tht T k (n) kt k (n ) + T k (n ) by
More informationMath 31S. Rumbos Fall Solutions to Assignment #16
Mth 31S. Rumbos Fll 2016 1 Solutions to Assignment #16 1. Logistic Growth 1. Suppose tht the growth of certin niml popultion is governed by the differentil eqution 1000 dn N dt = 100 N, (1) where N(t)
More informationA signalling model of school grades: centralized versus decentralized examinations
A signlling model of school grdes: centrlized versus decentrlized exmintions Mri De Pol nd Vincenzo Scopp Diprtimento di Economi e Sttistic, Università dell Clbri m.depol@unicl.it; v.scopp@unicl.it 1 The
More informationJonathan Mugan. July 15, 2013
Jonthn Mugn July 15, 2013 Imgine rt in Skinner box. The rt cn see screen of imges, nd dot in the lower-right corner determines if there will be shock. Bottom-up methods my not find this dot, but top-down
More informationf(x) dx, If one of these two conditions is not met, we call the integral improper. Our usual definition for the value for the definite integral
Improper Integrls Every time tht we hve evluted definite integrl such s f(x) dx, we hve mde two implicit ssumptions bout the integrl:. The intervl [, b] is finite, nd. f(x) is continuous on [, b]. If one
More informationDriving Cycle Construction of City Road for Hybrid Bus Based on Markov Process Deng Pan1, a, Fengchun Sun1,b*, Hongwen He1, c, Jiankun Peng1, d
Interntionl Industril Informtics nd Computer Engineering Conference (IIICEC 15) Driving Cycle Construction of City Rod for Hybrid Bus Bsed on Mrkov Process Deng Pn1,, Fengchun Sun1,b*, Hongwen He1, c,
More informationPartial Derivatives. Limits. For a single variable function f (x), the limit lim
Limits Prtil Derivtives For single vrible function f (x), the limit lim x f (x) exists only if the right-hnd side limit equls to the left-hnd side limit, i.e., lim f (x) = lim f (x). x x + For two vribles
More informationMAC-solutions of the nonexistent solutions of mathematical physics
Proceedings of the 4th WSEAS Interntionl Conference on Finite Differences - Finite Elements - Finite Volumes - Boundry Elements MAC-solutions of the nonexistent solutions of mthemticl physics IGO NEYGEBAUE
More informationChapter 3 Solving Nonlinear Equations
Chpter 3 Solving Nonliner Equtions 3.1 Introduction The nonliner function of unknown vrible x is in the form of where n could be non-integer. Root is the numericl vlue of x tht stisfies f ( x) 0. Grphiclly,
More informationUninformed Search Lecture 4
Lecture 4 Wht re common serch strtegies tht operte given only serch problem? How do they compre? 1 Agend A quick refresher DFS, BFS, ID-DFS, UCS Unifiction! 2 Serch Problem Formlism Defined vi the following
More informationStudent Session Topic: Particle Motion
Student Session Topic: Prticle Motion Prticle motion nd similr problems re on the AP Clculus exms lmost every yer. The prticle my be prticle, person, cr, etc. The position, velocity or ccelertion my be
More informationProperties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives
Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn
More informationTHERMAL EXPANSION COEFFICIENT OF WATER FOR VOLUMETRIC CALIBRATION
XX IMEKO World Congress Metrology for Green Growth September 9,, Busn, Republic of Kore THERMAL EXPANSION COEFFICIENT OF WATER FOR OLUMETRIC CALIBRATION Nieves Medin Hed of Mss Division, CEM, Spin, mnmedin@mityc.es
More informationTaylor Polynomial Inequalities
Tylor Polynomil Inequlities Ben Glin September 17, 24 Abstrct There re instnces where we my wish to pproximte the vlue of complicted function round given point by constructing simpler function such s polynomil
More informationAcceptance Sampling by Attributes
Introduction Acceptnce Smpling by Attributes Acceptnce smpling is concerned with inspection nd decision mking regrding products. Three spects of smpling re importnt: o Involves rndom smpling of n entire
More informationLecture 21: Order statistics
Lecture : Order sttistics Suppose we hve N mesurements of sclr, x i =, N Tke ll mesurements nd sort them into scending order x x x 3 x N Define the mesured running integrl S N (x) = 0 for x < x = i/n for
More informationProbabilistic Investigation of Sensitivities of Advanced Test- Analysis Model Correlation Methods
Probbilistic Investigtion of Sensitivities of Advnced Test- Anlysis Model Correltion Methods Liz Bergmn, Mtthew S. Allen, nd Dniel C. Kmmer Dept. of Engineering Physics University of Wisconsin-Mdison Rndll
More informationData Assimilation. Alan O Neill Data Assimilation Research Centre University of Reading
Dt Assimiltion Aln O Neill Dt Assimiltion Reserch Centre University of Reding Contents Motivtion Univrite sclr dt ssimiltion Multivrite vector dt ssimiltion Optiml Interpoltion BLUE 3d-Vritionl Method
More informationReinforcement learning
Reinforcement lerning Regulr MDP Given: Trnition model P Rewrd function R Find: Policy π Reinforcement lerning Trnition model nd rewrd function initilly unknown Still need to find the right policy Lern
More informationJim Lambers MAT 169 Fall Semester Lecture 4 Notes
Jim Lmbers MAT 169 Fll Semester 2009-10 Lecture 4 Notes These notes correspond to Section 8.2 in the text. Series Wht is Series? An infinte series, usully referred to simply s series, is n sum of ll of
More informationReview of Gaussian Quadrature method
Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge
More informationEstimation of Binomial Distribution in the Light of Future Data
British Journl of Mthemtics & Computer Science 102: 1-7, 2015, Article no.bjmcs.19191 ISSN: 2231-0851 SCIENCEDOMAIN interntionl www.sciencedomin.org Estimtion of Binomil Distribution in the Light of Future
More informationImproper Integrals. Type I Improper Integrals How do we evaluate an integral such as
Improper Integrls Two different types of integrls cn qulify s improper. The first type of improper integrl (which we will refer to s Type I) involves evluting n integrl over n infinite region. In the grph
More informationMulti-Armed Bandits: Non-adaptive and Adaptive Sampling
CSE 547/Stt 548: Mchine Lerning for Big Dt Lecture Multi-Armed Bndits: Non-dptive nd Adptive Smpling Instructor: Shm Kkde 1 The (stochstic) multi-rmed bndit problem The bsic prdigm is s follows: K Independent
More informationDistance And Velocity
Unit #8 - The Integrl Some problems nd solutions selected or dpted from Hughes-Hllett Clculus. Distnce And Velocity. The grph below shows the velocity, v, of n object (in meters/sec). Estimte the totl
More informationGoals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite
Unit #8 : The Integrl Gols: Determine how to clculte the re described by function. Define the definite integrl. Eplore the reltionship between the definite integrl nd re. Eplore wys to estimte the definite
More information5.2 Volumes: Disks and Washers
4 pplictions of definite integrls 5. Volumes: Disks nd Wshers In the previous section, we computed volumes of solids for which we could determine the re of cross-section or slice. In this section, we restrict
More informationMIXED MODELS (Sections ) I) In the unrestricted model, interactions are treated as in the random effects model:
1 2 MIXED MODELS (Sections 17.7 17.8) Exmple: Suppose tht in the fiber breking strength exmple, the four mchines used were the only ones of interest, but the interest ws over wide rnge of opertors, nd
More informationPrep Session Topic: Particle Motion
Student Notes Prep Session Topic: Prticle Motion Number Line for AB Prticle motion nd similr problems re on the AP Clculus exms lmost every yer. The prticle my be prticle, person, cr, etc. The position,
More information7.1 Integral as Net Change and 7.2 Areas in the Plane Calculus
7.1 Integrl s Net Chnge nd 7. Ares in the Plne Clculus 7.1 INTEGRAL AS NET CHANGE Notecrds from 7.1: Displcement vs Totl Distnce, Integrl s Net Chnge We hve lredy seen how the position of n oject cn e
More informationThermal Diffusivity. Paul Hughes. Department of Physics and Astronomy The University of Manchester Manchester M13 9PL. Second Year Laboratory Report
Therml iffusivity Pul Hughes eprtment of Physics nd Astronomy The University of nchester nchester 3 9PL Second Yer Lbortory Report Nov 4 Abstrct We investigted the therml diffusivity of cylindricl block
More informationState space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies
Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response
More informationMATH 144: Business Calculus Final Review
MATH 144: Business Clculus Finl Review 1 Skills 1. Clculte severl limits. 2. Find verticl nd horizontl symptotes for given rtionl function. 3. Clculte derivtive by definition. 4. Clculte severl derivtives
More informationalong the vector 5 a) Find the plane s coordinate after 1 hour. b) Find the plane s coordinate after 2 hours. c) Find the plane s coordinate
L8 VECTOR EQUATIONS OF LINES HL Mth - Sntowski Vector eqution of line 1 A plne strts journey t the point (4,1) moves ech hour long the vector. ) Find the plne s coordinte fter 1 hour. b) Find the plne
More informationExam 2, Mathematics 4701, Section ETY6 6:05 pm 7:40 pm, March 31, 2016, IH-1105 Instructor: Attila Máté 1
Exm, Mthemtics 471, Section ETY6 6:5 pm 7:4 pm, Mrch 1, 16, IH-115 Instructor: Attil Máté 1 17 copies 1. ) Stte the usul sufficient condition for the fixed-point itertion to converge when solving the eqution
More informationJack Simons, Henry Eyring Scientist and Professor Chemistry Department University of Utah
1. Born-Oppenheimer pprox.- energy surfces 2. Men-field (Hrtree-Fock) theory- orbitls 3. Pros nd cons of HF- RHF, UHF 4. Beyond HF- why? 5. First, one usully does HF-how? 6. Bsis sets nd nottions 7. MPn,
More information7.2 The Definite Integral
7.2 The Definite Integrl the definite integrl In the previous section, it ws found tht if function f is continuous nd nonnegtive, then the re under the grph of f on [, b] is given by F (b) F (), where
More informationSpace Curves. Recall the parametric equations of a curve in xy-plane and compare them with parametric equations of a curve in space.
Clculus 3 Li Vs Spce Curves Recll the prmetric equtions of curve in xy-plne nd compre them with prmetric equtions of curve in spce. Prmetric curve in plne x = x(t) y = y(t) Prmetric curve in spce x = x(t)
More informationROB EBY Blinn College Mathematics Department
ROB EBY Blinn College Mthemtics Deprtment Mthemtics Deprtment 5.1, 5.2 Are, Definite Integrls MATH 2413 Rob Eby-Fll 26 Weknowthtwhengiventhedistncefunction, wecnfindthevelocitytnypointbyfindingthederivtiveorinstntneous
More informationREGULARITY OF NONLOCAL MINIMAL CONES IN DIMENSION 2
EGULAITY OF NONLOCAL MINIMAL CONES IN DIMENSION 2 OVIDIU SAVIN AND ENICO VALDINOCI Abstrct. We show tht the only nonlocl s-miniml cones in 2 re the trivil ones for ll s 0, 1). As consequence we obtin tht
More informationChapters 4 & 5 Integrals & Applications
Contents Chpters 4 & 5 Integrls & Applictions Motivtion to Chpters 4 & 5 2 Chpter 4 3 Ares nd Distnces 3. VIDEO - Ares Under Functions............................................ 3.2 VIDEO - Applictions
More informationHow to simulate Turing machines by invertible one-dimensional cellular automata
How to simulte Turing mchines by invertible one-dimensionl cellulr utomt Jen-Christophe Dubcq Déprtement de Mthémtiques et d Informtique, École Normle Supérieure de Lyon, 46, llée d Itlie, 69364 Lyon Cedex
More informationSection 5.1 #7, 10, 16, 21, 25; Section 5.2 #8, 9, 15, 20, 27, 30; Section 5.3 #4, 6, 9, 13, 16, 28, 31; Section 5.4 #7, 18, 21, 23, 25, 29, 40
Mth B Prof. Audrey Terrs HW # Solutions by Alex Eustis Due Tuesdy, Oct. 9 Section 5. #7,, 6,, 5; Section 5. #8, 9, 5,, 7, 3; Section 5.3 #4, 6, 9, 3, 6, 8, 3; Section 5.4 #7, 8,, 3, 5, 9, 4 5..7 Since
More informationVyacheslav Telnin. Search for New Numbers.
Vycheslv Telnin Serch for New Numbers. 1 CHAPTER I 2 I.1 Introduction. In 1984, in the first issue for tht yer of the Science nd Life mgzine, I red the rticle "Non-Stndrd Anlysis" by V. Uspensky, in which
More informationThe steps of the hypothesis test
ttisticl Methods I (EXT 7005) Pge 78 Mosquito species Time of dy A B C Mid morning 0.0088 5.4900 5.5000 Mid Afternoon.3400 0.0300 0.8700 Dusk 0.600 5.400 3.000 The Chi squre test sttistic is the sum of
More informationLecture 1. Functional series. Pointwise and uniform convergence.
1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is
More informationChapter 4 Contravariance, Covariance, and Spacetime Diagrams
Chpter 4 Contrvrince, Covrince, nd Spcetime Digrms 4. The Components of Vector in Skewed Coordintes We hve seen in Chpter 3; figure 3.9, tht in order to show inertil motion tht is consistent with the Lorentz
More informationExploring parametric representation with the TI-84 Plus CE graphing calculator
Exploring prmetric representtion with the TI-84 Plus CE grphing clcultor Richrd Prr Executive Director Rice University School Mthemtics Project rprr@rice.edu Alice Fisher Director of Director of Technology
More informationSection 11.5 Estimation of difference of two proportions
ection.5 Estimtion of difference of two proportions As seen in estimtion of difference of two mens for nonnorml popultion bsed on lrge smple sizes, one cn use CLT in the pproximtion of the distribution
More informationNew Expansion and Infinite Series
Interntionl Mthemticl Forum, Vol. 9, 204, no. 22, 06-073 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.2988/imf.204.4502 New Expnsion nd Infinite Series Diyun Zhng College of Computer Nnjing University
More informationReview of basic calculus
Review of bsic clculus This brief review reclls some of the most importnt concepts, definitions, nd theorems from bsic clculus. It is not intended to tech bsic clculus from scrtch. If ny of the items below
More informationWe partition C into n small arcs by forming a partition of [a, b] by picking s i as follows: a = s 0 < s 1 < < s n = b.
Mth 255 - Vector lculus II Notes 4.2 Pth nd Line Integrls We begin with discussion of pth integrls (the book clls them sclr line integrls). We will do this for function of two vribles, but these ides cn
More informationStudent Activity 3: Single Factor ANOVA
MATH 40 Student Activity 3: Single Fctor ANOVA Some Bsic Concepts In designed experiment, two or more tretments, or combintions of tretments, is pplied to experimentl units The number of tretments, whether
More informationLECTURE 14. Dr. Teresa D. Golden University of North Texas Department of Chemistry
LECTURE 14 Dr. Teres D. Golden University of North Texs Deprtment of Chemistry Quntittive Methods A. Quntittive Phse Anlysis Qulittive D phses by comprison with stndrd ptterns. Estimte of proportions of
More informationThe Wave Equation I. MA 436 Kurt Bryan
1 Introduction The Wve Eqution I MA 436 Kurt Bryn Consider string stretching long the x xis, of indeterminte (or even infinite!) length. We wnt to derive n eqution which models the motion of the string
More informationA Signal-Level Fusion Model for Image-Based Change Detection in DARPA's Dynamic Database System
SPIE Aerosense 001 Conference on Signl Processing, Sensor Fusion, nd Trget Recognition X, April 16-0, Orlndo FL. (Minor errors in published version corrected.) A Signl-Level Fusion Model for Imge-Bsed
More informationDynamics of an Inertially Driven Robot
Vibrtions in Physicl Systems 018, 9, 01803 (1 of 9) Dynmics of n Inertilly Driven Robot Pweł FRITZKOWSKI Institute of Applied Mechnics, Poznn University of Technology, ul. Jn Pwł II 4, 60-965 Poznn, pwel.itzkowski@put.poznn.pl
More informationCHM Physical Chemistry I Chapter 1 - Supplementary Material
CHM 3410 - Physicl Chemistry I Chpter 1 - Supplementry Mteril For review of some bsic concepts in mth, see Atkins "Mthemticl Bckground 1 (pp 59-6), nd "Mthemticl Bckground " (pp 109-111). 1. Derivtion
More informationOverview of Calculus I
Overview of Clculus I Prof. Jim Swift Northern Arizon University There re three key concepts in clculus: The limit, the derivtive, nd the integrl. You need to understnd the definitions of these three things,
More informationMathematics of Motion II Projectiles
Chmp+ Fll 2001 Dn Stump 1 Mthemtics of Motion II Projectiles Tble of vribles t time v velocity, v 0 initil velocity ccelertion D distnce x position coordinte, x 0 initil position x horizontl coordinte
More informationSUMMER KNOWHOW STUDY AND LEARNING CENTRE
SUMMER KNOWHOW STUDY AND LEARNING CENTRE Indices & Logrithms 2 Contents Indices.2 Frctionl Indices.4 Logrithms 6 Exponentil equtions. Simplifying Surds 13 Opertions on Surds..16 Scientific Nottion..18
More informationKINEMATICS OF RIGID BODIES
KINEMTICS OF RIGID ODIES Introduction In rigid body kinemtics, e use the reltionships governing the displcement, velocity nd ccelertion, but must lso ccount for the rottionl motion of the body. Description
More information