n walkers ${A}_{i}$ ($i=1,2,...,n$) start out from X to Y simultaneously with constant speeds ${a}_{1}<{a}_{2}<...<{a}_{n}$. At the same time, motorcyclist M with speed $m=1$ starts out from Y to carry them, as shown below:
The motorcyclist can choose to pick up a walker upon meeting. He can carry at most one person, but is free to drop off the person he carries at any time. Left to themselves, walkers walk straight forward (from X to Y) with the given speeds $a_i$, while motorcyclist is free to drive either forwards or backwards, loaded or unloaded.
The motorcylist's objective (challenge!) is to find a plan under which all the walkers arrive at Y simultaneously, if such a plan exists. We call such a plan a feasible plan, and call the $({a}_{1},{a}_{2},...,{a}_{n})$ for which a feasible plan exists a feasible configuration. For given n, define the set of all feasible configurations as feasible set ${B}_{n}$.
The question:What is the feasible set ${B}_{n}$ like? Or at least, what is ${B}_{4}$ like?
n=2 is trivial because ${B}_{2}={\mathbb{R}}_{++}^{2}$. I worked out the n=3 case, for which ${B}^{3}=\{({a}_{1},{a}_{2},{a}_{3})| 2{a}_{2}\leq{a}_{1}+1,\ {a}_{3}<1 \}$. Despite the simple final answer, however, there're a lot of subtleties, nuances and discussions one need to fill in the process, which really makes me doubt if one can really characterize ${B}_{n}$ for even moderately large n.
Alternatively, for given n, one may try to look for a kind of dominant plan (or a rule,a set of instructions for what to do, if you wish) for the motorcyclist, in the sense that if this plan doesn't work, no other plan does. If we succeed in finding one, given any configuration, we can simply input it to a computer program that simulates the whole process using the plan and see the outcome. In short, we make the question "given a configuration, decide if it's feasible" a decidable one. For n=3, one can show the following is a dominant strategy:
1) Upon meeting ${A}_{3}$, drive him back and drop him at position x before meeting ${A}_{1}$, where x is chosen such that 2) is satisfied:
2) Pick up ${A}_{1}$ and carry him forward to meet ${A}_{2}$ at some position y. x in 1) is chosen such that ${A}_{3}$ now just arrive at y, too. A configuration will be feasible iff y$\leq$the destination Y.
(Necessarily, this gives the ${B}^{3}$ I described earlier, too)
I actually posted this on MO about half a year ago and no one's given a define answer: https://mathoverflow.net/questions/72449/the-motorcyclists-challenge. I also wonder whether anything could be said about ${B}_{n}$ for large n? Speculations are appreciated, too.