Triathlete's Dilemma

Activity Information

Learning Goals

  • Analyze constant motion
  • Use geometry/trigonometry to determine distance
  • Analyze graphs
  • Examine effect of changing variables in a problem situation

Prior Knowledge Required

  • 2-D vectors
  • Pythagorean Theorem

Code Manipulation

  • Modify existing code
  • Copy and paste code
  • Create and use while loops
  • Translate physical quantities and equations into code

—-

Activity

Handout

Triathlete's Dilemma

You are a triathlete in the water and you need to get to your bike parked in a rack at a specific location on the shore in the shortest amount of time possible. You can run faster than you can swim. Do you swim directly to the shore, then run to your bike? Do you swim to a point closer to your bike, then run? How do you solve this dilemma? Here are the specific parameters:

  • The shoreline is linear and coincident with the x-axis
  • You are in the water at the following coordinates, labeled “Start”: (-50,120)
  • Your bike is parked at these coordinates, labelled “End: (100,-50)
  • You are a well-conditioned athlete and can swim at 2 m/s and run at 9 m/s

Your goal is to determine the optimal x-coordinate shore point to swim towards to get to your bike in the shortest possible time. Using the starter code below, decide what you need in order to compute the sim time and corresponding run time. You are probably aware that there is no reason to swim away from your bike or beyond your bike, so limit your shore point analysis to the x-axis range established by the initial x-coordinates of the Start and End locations. As a starting point, you should consider every half meter point along the shoreline.

You will examine your total time results graphically. Notice in the code, that the graph commands are already there, but the graph won't be generated until you produce some data. Your “while” loop should include a calculation for the swim time, run time, and total time for each half-meter position along the beach. Your graph will plot corresponding shore positions versus total time.

Extension questions:

  1. How could you modify your code to get greater precision in your answer? What specific changes would you make?
  2. What happens to the critical shore point if you swim faster?
  3. What happens if you change this situation? Suppose it's a sea lion in the water trying to get to the bike! Reverse your original speeds—Make the swim speed 9 m/s and the run speed 2 m/s. What is the new shore point for the fastest travel time now?
  4. Use the accompanying picture below to help answer this question. The distance from the shoreline to the swimmer (a) is 65 m. The distance from the shoreline to the bike (b) is 83 m. The sum of (x) and (y) is 135 m. The person can swim at 1.56 m/s and can run at 8.75 m/s. Solve for (x) to produce the shortest time possible to get your starting point in the water to your bike.

Code

  1. GlowScript 2.8 VPython
  2.  
  3. #scene attributes
  4. scene.width = 750
  5. scene.height = 568
  6. scene.fov = .3
  7. scene.align = "left"
  8.  
  9. ## Objects for the lake, beach, start and end points, and labels
  10. lake = box(pos=vector(0,100,0), size=vector(300,200,2), axis=vector(1,0,0), color=color.cyan, texture=textures.rough)
  11. beach = box(pos=vector(0,-50,0), size=vector(300,100,2), axis=vector(1,0,0), color=color.yellow, texture=textures.stucco)
  12. start = sphere(pos=vec(-50,120,0), radius=10, color=color.green)
  13. end = sphere(pos=vec(100,-50,0), radius=10, color=color.red)
  14. starttext = text(pos=vec(-65,130,0), text='Start', depth=2, height=10, color=color.green)
  15. endtext = text(pos=vec(90,-70,0), text='End', depth=2, height=10, color=color.red)
  16.  
  17. #Initial swim speed and run speed
  18. swimv = 2
  19. runv = 9
  20.  
  21. #Calculations to determine the amount of time for swim and amount of time for run--think distance/speed...
  22. swimtime = 0
  23. runtime = 0
  24. totaltime = swimtime+runtime
  25.  
  26. #this draws a line from start to shore point and from shore point to end
  27. target = 0
  28. swimroute = cylinder(pos=vec(start.pos.x,start.pos.y,1), axis=vector(target-start.pos.x,0-start.pos.y,1), radius=1, color=color.green)
  29. runroute = cylinder(pos=vec(end.pos.x,end.pos.y,1), axis=vec(target-end.pos.x,0-end.pos.y,1), radius=1, color=color.red)
  30.  
  31. ##graph total time vs shore point position
  32. Grph1 = graph(title='Finding Optimal Path', xtitle='Shoreline Coordinate (m)', ytitle='Total Time (s)', fast=False, align="right", ymin=0, ymax=200, xmin=-50, xmax=100)
  33. TimeOpt = gcurve(color=color.red, label='Optimal Path')
  34.  
  35. while target<0:
  36. rate(120)
  37. swimtime =
  38. runtime =
  39. totaltime = swimtime+runtime
  40. swimroute.axis = vec(target-start.pos.x,0-start.pos.y,1)
  41. runroute.axis = vec(target-end.pos.x,0-end.pos.y,1)
  42. TimeOpt.plot(target,totaltime)
  43. target = target + dt

Answer Key

Handout

Our first modifications to the code are defining the variables “target” (line 22), and “final” (line 24). This represents at which x-coordinate you reach the shore and the x-coordinate of the bike rack, respectively. We add the variable “dt” (line 23) which is a miniscule increment in time, and used later in our while loop. We then create equations for the “swimtime” and “runtime” variables (lines 25 & 26); these equations are just a rearranged form of the Pythagorean Theorem solved for the length of the hypotenuse and divided by the swim speed and run speed variables—remember that distance divided by speed is time. Finally, the limits of the while loop are defined (line 35) and the swim time and run time equations are reentered (lines 37 & 38). Looking at the output graph, the optimal x-coordinate along the shore line is equal to -24.5.

Extension Solutions:

  1. In order to increase the precision of your answer, you can decrease the size of the “dt” variable. The smaller this variable, the more points along the graph the program will plot, and thus the more precise you can be with your answer. An exact answer, however, requires calculus to solve.
  2. The faster the swim speed, the further in the positive x-direction your critical shore point will be
  3. For the theoretical sea lion situation where the speeds are flipped, the new shore point is the x-coordinate equal to 91.0, with a total travel time of 45.97 seconds. You can find this by simply modifying lines 18 and 19.
  4. To solve this question graphically, you simply have to modify the “start” and “end” variables (lines 12 & 13) to match the new distances provided in the problem statement. As well, you have to adjust the “swimv” and “runv” variables to the new given speeds. Depending on how small you make your “dt” variable, the optimal shore critical point (x) approaches 9.77 meters.

Code

  1. GlowScript 2.8 VPython
  2.  
  3. #scene attributes
  4. scene.width = 750
  5. scene.height = 568
  6. scene.fov = .3
  7. scene.align = "left"
  8.  
  9. ## Objects for the lake and beach
  10. lake = box(pos=vector(0,100,0), size=vector(300,200,2), axis=vector(1,0,0), color=color.cyan, texture=textures.rough)
  11. beach = box(pos=vector(0,-50,0), size=vector(300,100,2), axis=vector(1,0,0), color=color.yellow, texture=textures.stucco)
  12. start = sphere(pos=vec(-50,120,0), radius=10, color=color.green)
  13. end = sphere(pos=vec(100,-50,0), radius=10, color=color.red)
  14. starttext = text(pos=vec(-65,130,0), text='Start', depth=2, height=10, color=color.green)
  15. endtext = text(pos=vec(90,-70,0), text='End', depth=2, height=10, color=color.red)
  16.  
  17. #Initial swim speed and run speed
  18. swimv = 2
  19. runv = 9
  20.  
  21. #Calculations to determine the amount of time for swim and amount of time for run--think distance/speed...
  22. target = -50
  23. dt = 0.5
  24. final = 100
  25. swimtime = sqrt(start.pos.y**2 + (target-start.pos.x)**2)/swimv
  26. runtime = sqrt(end.pos.y**2 + (end.pos.x-target)**2)/runv
  27. totaltime = swimtime+runtime
  28. swimroute = cylinder(pos=vec(start.pos.x,start.pos.y,1), axis=vector(target-start.pos.x,0-start.pos.y,1), radius=1, color=color.green)
  29. runroute = cylinder(pos=vec(end.pos.x,end.pos.y,1), axis=vec(target-end.pos.x,0-end.pos.y,1), radius=1, color=color.red)
  30.  
  31. ##graph net force vs position
  32. Grph1 = graph(title='Finding Optimal Path', xtitle='Shoreline Coordinate (m)', ytitle='Total Time (s)', fast=False, align="right", ymin=0, ymax=300, xmin=-50, xmax=100)
  33. TimeOpt = gcurve(color=color.red, label='Optimal Path')
  34.  
  35. while target<final:
  36. rate(120)
  37. swimtime = sqrt(start.pos.y**2 + (target-start.pos.x)**2)/swimv
  38. runtime = sqrt(end.pos.y**2 + (end.pos.x-target)**2)/runv
  39. totaltime = swimtime+runtime
  40. swimroute.axis = vec(target-start.pos.x,0-start.pos.y,1)
  41. runroute.axis = vec(target-end.pos.x,0-end.pos.y,1)
  42. TimeOpt.plot(target,totaltime)
  43. target = target + dt

See Also

  • repository/triathlete_s_dilemma.txt
  • Last modified: 2021/02/16 23:53
  • by porcaro1