A drone delivery system operates in a warehouse modelled on a 3D coordinate grid. Two conveyor belt lines run through the warehouse. The first conveyor belt passes through A(1, −1, 2) with direction vector b⃗₁ = î + 2ĵ − k̂, and the second passes through B(2, 1, −1) with direction vector b⃗₂ = 2î − ĵ + 3k̂. The drone flies the shortest perpendicular path between the two belts.
A drone delivery system operates in a warehouse modelled on a 3D coordinate grid. Two conveyor belt lines run through the warehouse. The first conveyor belt passes through the point A(1, −1, 2) with direction vector b⃗₁ = î + 2ĵ − k̂, and the second conveyor belt passes through the point B(2, 1, −1) with direction vector b⃗₂ = 2î − ĵ + 3k̂.
A drone can only fly perpendicular to both conveyor belts. The warehouse manager needs to know:
(i) Whether the two conveyor belt lines are skew (non-intersecting, non-parallel). Verify by computing b⃗₁ × b⃗₂ and (B⃗ − A⃗) · (b⃗₁ × b⃗₂). [1 mark]
(ii) Find the vector b⃗₁ × b⃗₂ (the common perpendicular direction). [1 mark]
(iii) Find the shortest distance between the two conveyor belt lines, which is the minimum distance the drone must travel perpendicular to both belts. [2 marks]
Show answerHide answer
a⃗₁ = î − ĵ + 2k̂ (position vector of A), a⃗₂ = 2î + ĵ − k̂ (position vector of B)
(a⃗₂ − a⃗₁) = (2−1)î + (1−(−1))ĵ + (−1−2)k̂ = î + 2ĵ − 3k̂
First compute b⃗₁ × b⃗₂:
b⃗₁ × b⃗₂ = |î ĵ k̂ |
|1 2 −1|
|2 −1 3|
= î[(2)(3)−(−1)(−1)] − ĵ[(1)(3)−(−1)(2)] + k̂[(1)(−1)−(2)(2)]
= î[6 − 1] − ĵ[3 + 2] + k̂[−1 − 4]
= 5î − 5ĵ − 5k̂
Now check (a⃗₂ − a⃗₁) · (b⃗₁ × b⃗₂):
(î + 2ĵ − 3k̂) · (5î − 5ĵ − 5k̂)
= (1)(5) + (2)(−5) + (−3)(−5)
= 5 − 10 + 15 = 10 ≠ 0
∴ (a⃗₂ − a⃗₁) · (b⃗₁ × b⃗₂) = 10 ≠ 0, which confirms the two conveyor belt lines are skew (they neither intersect nor are parallel).
(ii) The common perpendicular direction is:
b⃗₁ × b⃗₂ = 5î − 5ĵ − 5k̂
∴ b⃗₁ × b⃗₂ = 5î − 5ĵ − 5k̂
(iii) Shortest distance between the two skew lines:
Using the formula: S.D. = |(a⃗₂ − a⃗₁) · (b⃗₁ × b⃗₂)| / |b⃗₁ × b⃗₂|
Numerator = |(a⃗₂ − a⃗₁) · (b⃗₁ × b⃗₂)| = |10| = 10
|b⃗₁ × b⃗₂| = |5î − 5ĵ − 5k̂| = √(5² + (−5)² + (−5)²) = √(25 + 25 + 25) = √75 = 5√3
∴ S.D. = 10 / (5√3) = 2/√3 = (2√3)/3
∴ Shortest distance between the two conveyor belt lines = (2√3)/3 units.
This is the minimum distance the drone must travel perpendicular to both belts.