Scribd
Upload
100 views3 pages

Velociraptor

The document describes two problems involving velociraptors chasing a person. For the first problem, the document derives an equation to calculate the time it takes for the velociraptor to catch the person, which is 6.217 seconds. For the second problem, the document proposes using a numeric differential equation solver and maximizer to find the angle at which the raptors can catch the person in the least amount of time. It describes setting up differential equations to model the movement of the raptors and person, then numerically solving them to find the time of capture for different angles and maximizing this value. The last run of the algorithm found an angle of 33 degrees with capture at 2.9 seconds.

Uploaded by

Ash Dünn
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
100 views3 pages

Velociraptor

The document describes two problems involving velociraptors chasing a person. For the first problem, the document derives an equation to calculate the time it takes for the velociraptor to catch the person, which is 6.217 seconds. For the second problem, the document proposes using a numeric differential equation solver and maximizer to find the angle at which the raptors can catch the person in the least amount of time. It describes setting up differential equations to model the movement of the raptors and person, then numerically solving them to find the time of capture for different angles and maximizing this value. The last run of the algorithm found an angle of 33 degrees with capture at 2.9 seconds.

Uploaded by

Ash Dünn
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

1

Question 1

The rst problem is fairly trivial. The speed of the velociraptor is given by S =4t S = 25 t < 25/4 t 25/4

we can use this to derive the location of the raptor, assuming R(0) = 0.
T

R(T ) =
0 25/4

4tdt
T

T < 25/4 25dt T 25/4

R(T ) =
0

4tdt +
25/4

The location of the person is given by


T

P (T ) =
0

6dt + P (0) = 6T + 40

Equating the previous with R(T) would give us an equation for the time it takes for the raptor to catch the person. Well assume that T is greater than 25/4 when were calculating because if the solution gives a T less than 25/4, well just go back and assume that T is less than 25/4.
25/4 T

P (T ) = 6T + 40 = R(T ) =
0

4tdt +
25/4

25dt

25/4

6T + 40 =
0

4tdt +
25/4

25dt = 625/8 25((25/4) T )

25T 6T = 40 625/8 + 625/4

T = 945/152 = 6.217 Since 6.217 < 6.25, well have to recheck our answer. Instead, we use the following equation: 1

P (T ) = 6T + 40 = R(T ) =
0

4tdt

4T 2 2 2 4T + 6T + 4 = 0 6T + 40 = Take the positive solution from the binomial formula, T = 3+2 89 6.217 which is pretty much what we got before. So at 6.217 seconds, the raptor catches the person. The person runs about 6.217*6 = 37.3 meters before he is caught.

Question 2

The problem is solved using a numeric diff eq. solver and a numeric maximizer. Since the problem is symmetric along y, only the top and right side raptors were considered, and the angle is restricted to 0 to 90 degrees. For a given angle, nd the least time T when the location of 1 raptor converge on the persons. This could be done by numerically solving the differential equations describing the location of the raptors, and equating that to the location of the person. So for a given angle, , we have a function F () that gives the time T. We then use newtons method or any numeric maximizer to nd arg max F (). The system of equations for the location of the raptor R1 is described by the following: R1x (t) = S1(t) cos() R1y (t) = S1(t) sin() where theta describes the angle of the vector R1 P . Subsitute cos() and sin() with appropriate computation, i.e. cos() = P x(t) R1x(t) (P x(t) R1x(t))2 + (P y(t) R1y(t))2 P y(t) R1y(t) (P x(t) R1x(t))2 + (P y(t) R1y(t))2 2

sin() =

The boundary condition of the raptor R1 is given by: R1x(0) = 0 R1y(0) = 20 3/9 S1(t) is the speed of the raptor described by part 1, i.e. S1(t) = 4t S1(t) = 10 t < 10/4 t 10/4

Px(t) and Py(t) are the location of the person based on the initial angle . i.e. (6t cos(), 6t sin()) R2 is described in the same way except with different boundary condition and speed. For a given , we can solve the above differential equations numerically, and thereby obtain a T s.t. the location of 1 raptor converges with the persons. This is usually the largest number that is still in the domain of the solved functions due to the fact that the denominator (the distance between R and P) goes to 0 afterward. Having obtained a numerical function F () for the minimum time one of the raptors converges on to the person, we can then use any maximizer to give a solution to the problem arg max F (). The last time I ran an algorithm to solve the question, it gave about 33.00 degrees north of the horizon with the point of contact at t= 2.9 seconds. Due to the symmetry, the solutions are 33.00, and 147.00 degrees.

You might also like