Constant Delay Lattice Train Schedules
share
The following geometric vehicle scheduling problem has been considered: given continuous curves f_1, …, f_n : ℝ→ℝ^2, find non-negative delays t_1, …, t_n minimizing max{ t_1, …, t_n } such that, for every distinct i and j and every time t, | f_j (t - t_j) - f_i (t - t_i) | > ℓ, where ℓ is a given safety distance. We study a variant of this problem where we consider trains (rods) of fixed length ℓ that move at constant speed and sets of train lines (tracks), each of which consisting of an axis-parallel line-segment with endpoints in the integer lattice ℤ^d and of a direction of movement (towards ∞ or - ∞). We are interested in upper bounds on the maximum delay we need to introduce on any line to avoid collisions, but more specifically on universal upper bounds that apply no matter the set of train lines. We show small universal constant upper bounds for d = 2 and any given ℓ and also for d = 3 and ℓ = 1. Through clique searching, we are also able to show that several of these upper bounds are tight.
READ FULL TEXT
