A traveller's problem
Florian Berger, Rolf Klein · 2010
A traveller is planning a tour from some start position, s, to a goal position g in d-dimensional space. Transportation is provided by n carriers. Each carrier is a convex object that results from intersecting finitely many closed linear subspaces; it moves at constant speed along a line. Different carriers may be assigned different velocity vectors. While using carrier C, the traveller can walk at innate speed v ≥ 0 in any direction, like a passenger on board a vessel. Whenever his current position on C is simultaneously contained in some other carrier C', the traveller can change from C to C', and continue his tour by C'.