CraigDNeo
- 21
- 0
And yes we get times at those points too.
The discussion revolves around calculating the distance between two moving race cars at specific points, given their velocities and times at various distances. Participants explore methods for determining average velocity, acceleration, and distance, while addressing the complexities introduced by non-constant acceleration.
Participants do not reach a consensus on the best approach to calculate the distance between the two cars. There are competing views on whether to assume constant acceleration or to model acceleration as varying over time.
Limitations include the reliance on limited data points and the assumption of linearity in acceleration, which may not hold true in real-world scenarios. The discussion highlights the complexity of accurately modeling the motion of the cars given the available information.
CraigDNeo said:And yes we get times at those points too.
CraigDNeo said:so would we do something like this then
X = At^3 + Bt2^2 + C*t + D for 0, 60, 330 and 660. Then solve for A, B, C and D. My other question is that when solving for these unknowns, which data point would you start with?
CraigDNeo said:I put these into the linear solver for a
60 foot in 1.083s,
330 foot in 3.112s
660 foot in 4.83s
60 = A*1.17 + B*1.21 + C*1.31
330 = A*9.67 + B*30.08 + C*93.55
660 = A*23.33 + B*112.68 + C*544.23
and I get this in return
{ a = 63.82661360552823, b = -13.508610964551533, c = 1.273497212701 }
Now taking these values an finding the distance this car is as opposed to the other car,
for example, the other car's (CAR2) time at the 330 was 2.7038
So, my confusion currently, is calculating the other cars distance, do I still do the following:
X(t) = (A + B + C * 2.7038) * (2.7038)^2/2?
Then I would get 330 -X(t) = distances CAR1 is ahead or behind CAR2.
CraigDNeo said:Thanks again so much for your time and feedback, I have truly learned so much from this thread, and it is greatly appreciated.