Find the relative position vector from one object to the other, minimize its squared magnitude to obtain the time of closest approach, then substitute that time into both original position vectors to find both locations.
The Method
For objects moving with constant velocities, suppose
Their relative position is
This vector points from object B to object A at the same time, so its magnitude is their separation. Instead of minimizing the distance , minimize the squared distance
This removes the square root without changing where the minimum occurs. Expand , solve , and verify a minimum using or the upward-opening quadratic shape. Check that the time lies in the permitted domain. For a closed interval, compare the stationary value with both endpoints.
For constant velocities, write and , so . Differentiating gives . Hence , provided . This compact formula is equivalent to expanding the quadratic. If , the objects have equal velocities and their separation is constant, so every allowed time gives the same distance.
Worked Example
Let
Then
Therefore,
Since , this gives the minimum. Substitution gives
The minimum distance is units. At closest approach, the relative-position vector is perpendicular to the relative-velocity vector, providing a useful check.
Exam Technique
This is AHL 3.12 Vector applications to kinematics, so it is HL-only and all relevant papers are GDC-active. Show the relative vector and squared-distance function before giving a GDC minimum. State the time, both positions, minimum distance, and appropriate units.
Keep full calculator precision until the final answers. If a negative stationary time is obtained but , the closest permitted approach occurs at .
The common misconception is that intersecting paths or closest approach implies a collision. A collision requires both objects to occupy the same position at the same time, so the minimum distance must be zero.
