The motorcyclist's challenge - MathOverflow most recent 30 from http://mathoverflow.net 2013-05-24T07:50:03Z http://mathoverflow.net/feeds/question/72449 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/72449/the-motorcyclists-challenge The motorcyclist's challenge unknown (google) 2011-08-09T07:25:05Z 2011-09-22T05:22:12Z <p>n walkers <code>${A}_{i}$</code> start out from X to Y simultaneously with speeds <code>${a}_{i}$</code>, <code>$i=1,2,...,n$</code>. <code>${a}_{i}\neq {a}_{j}$</code> if $i\neq j$. At the same time, a motorcyclist M with speed $m=1$ starts out from Y to carry them (as shown in the illustration attached). The motorcyclist can pick up any person he meets. He can carry at most one person. But he's free to drop off the person he carries at any time. Walkers just walk straight forwards (from X to Y), while motorcyclist is free to drive either forwards or backwards.</p> <p>The motorcylist's goal 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 <strong>feasible plan</strong>. </p> <p>Define the configuration of the problem to be the n-tuple <code>$({a}_{1},{a}_{2},...,{a}_{n})\in {\mathbb{R}}_{++}^{n}$</code>. </p> <p>Define ${B}^{n}\subseteq{\mathbb{R}}_{++}^{n}$ to be the set of all feasible configurations (i.e., configurations for which a feasible plan exists).</p> <p>Trivially, we know that <code>${B}^{1}={\mathbb{R}}_{++}$</code> and <code>${B}^{2}={\mathbb{R}}_{++}^{2}$</code>. Also it's easy to see that ${B}^{n}\subseteq {(0,1)}^{n}$ for $n>2$. However, it is nontrivial to find ${B}^{n}$ for $n>2$. Without loss of generality, assuming <code>${a}_{1}&lt;{a}_{2}&lt;...&lt;{a}_{n}$</code>, I find that <code>${B}^{3}=\{({a}_{1},{a}_{2},{a}_{3})| 2{a}_{2}\leq{a}_{1}+1,\ {a}_{3}&lt;1 \}$</code>, which is neat!</p> <hr> <p>When I tried to figure out ${B}^{4}$, however, I found it to be significantly harder than ${B}^{3}$. So I have two related questions here:</p> <p>1.How should we tackle ${B}^{n}$? Is there some systematic method we can use to characterize ${B}^{n}$ for successive n's? </p> <p>2.If not, can we speculate what ${B}^{n}$ will look like, for example by giving some upper and lower bound on it which we are able to characterize?<br> <img src="http://i1191.photobucket.com/albums/z473/eric55555/QQ.jpg" alt="alt text"></p> <hr> <p>EDIT: $n=4$ is EXHAUSTING, and honestly I have no idea where to start. Maybe it's just impractical to find ${B}^{n}$ for $n>3$. An interesting way to simplify the model is to assume that M can teleport himself anywhere he wants (as long as the motorcycle is not loaded). This assumption may allow a cleaner analysis and nicer answer. </p> http://mathoverflow.net/questions/72449/the-motorcyclists-challenge/72544#72544 Answer by Barry Cipra for The motorcyclist's challenge Barry Cipra 2011-08-10T03:47:28Z 2011-08-10T06:19:57Z <p>[[Please see SECOND EDIT at the bottom before bothering to read this]]</p> <p>I'm not sure that $B^3=\{(a_1,a_2,a_3)|2a_2≤a_1+1, a_3&lt;1\}$ is the right answer. I find that the feasible set for $n=3$ includes a region defined by </p> <p>$${3a_2a_3 + a_2 - a_3 -1 \over 3 + a_2 + a_3 - a_2a_3} &lt; a_1$$</p> <p>(following the convention $a_1 &lt; a_2 &lt; a_3$). The denominator on the left hand side is always positive, but the numerator is negative when $a_2=1/2$, which means there are feasible configurations with $2a_2 > a_1+1$ --- just pick a value of $a_2$ slightly larger than $1/2$ that keeps the left hand side negative and then pick $a_1$ smaller than $2a_2-1$.</p> <p>Note, I'm not saying that this inequality <em>defines</em> the feasible set, merely that it specifies a portion of it.</p> <p>Here's my reasoning. The motorcyclist will first encounter walker 3, and can transport him back to walker 2. He can then effectively "bind" those two walkers together, in a way I'll describe below, and slow them down to a speed arbitrarily close to the left-hand side above, while walker 1 saunters by. When walker 1 has a sufficient lead, the motorcyclist can "release" walker 2 and either "hold" walker 3 in place or transport him some distance back before releasing him -- all timed so that walkers 2 and 3 catch up with 1 at the finish line.</p> <p>Here's what I mean by "binding" walkers 2 and 3 together. For convenience, let's use a number line that has walker 3 (being carried left on the motorcycle) meet walker 2 at $x=0$. For a short time $\delta$, let walker 3 continue heading left on the motorcycle, so that he's now at $x_3 = -\delta$ while walker 2 is at $x_2 = \delta a_2$. Now drop off walker 3 and zip off to catch walker 2. This will take time $\Delta = \delta(1+a_2)/(1-a_2)$, at which time walker 3 is at $\Delta a_3-\delta$ and walker 2 is at $(\Delta + \delta)a_2$. If the mortorcyclist now picks up walker 2 and heads back to the left, they meet walker 3 after time $$\Delta' = {(\Delta + \delta)a_2 - (\Delta a_3 - \delta) \over 1+a_3}$$ at which point they are at $$x = \Delta a_3 - \delta + \Delta'a_3$$ and the process can repeat (i.e., take walker 3 back for time $\delta$, etc.). By taking $\delta$ small, the two walkers can be kept close together, and their average speed over a complete cycle is</p> <p>$${\Delta a_3 - \delta + \Delta'a_3 \over \delta + \Delta + \Delta'} = {3a_2a_3 + a_2 - a_3 -1 \over 3 + a_2 + a_3 - a_2a_3}$$</p> <p>(Caveat: I did the algebra here three times by hand, and got the same answer on the last two tries. You can judge for yourself the probability of the result being correct.)</p> <p>It's worth noting why the inequality doesn't define the feasible set. It's because even if the inequality is (slightly) violated, there might be a $\delta$ for which the motorcyclist encounters walker 1 while he's transporting walker 3 to the left. If that happens, he can immediately drop off walker 3, pick up walker 1, and zip him some distance to the right, and then come back for walkers 2 and/or 3 and position them so that everyone arrives simultaneously at the finish line.</p> <p>EDIT: Forget a fair amount of what I said above. I forgot to consider that walker 1 may have a considerable distance to make up while walkers 2 and 3 are bound together. The safest thing to say is that the feasible set includes a region defined by</p> <p>$${3a_2a_3 + a_2 - a_3 -1 \over 3 + a_2 + a_3 - a_2a_3} &lt; 0$$</p> <p>which describes a setting where the bound pair move to the left while walker 1 proceeds to the right.</p> <p>SECOND EDIT: I should have tried doing the algebra one more time by hand before posting this. The correct average speed (I think) is</p> <p>$${\Delta a_3 - \delta + \Delta'a_3 \over \delta + \Delta + \Delta'} = {3a_2a_3 + a_2 + a_3 -1 \over 3 + a_2 + a_3 - a_2a_3}$$</p> <p>Note the $+a_3$ is the numerator, which corrects the $-a_3$ I originally obtained. This pretty well invalidates everything I had hoped to show.</p> http://mathoverflow.net/questions/72449/the-motorcyclists-challenge/72550#72550 Answer by unknown (google) for The motorcyclist's challenge unknown (google) 2011-08-10T05:04:04Z 2011-08-10T05:04:04Z <p>Well, this is not really an answer. It is motivated by fedja's comment. In the original problem <strong>we do allow motorcyclist (M) to drive walkers backward</strong>. If not, I think I can say something more:</p> <p>If driving walkers backward is not allowed, the best M can do is trying to successively drive slower walkers forward enough to correct positions before the fastest walker reach Y. Conceivably in a feasible configuration then, if he is visionary enough, M can figure out a plan in which he never goes forward unloaded (in this plan, when M placed someone in correct position, he immediately turns back to pick another walker). If this is true, then half of time M is empty (going backward), and half of time it's loaded (going forward).</p> <p>Let $T$ be the total time lapse of this plan, $L$ be the distance between XY, ${t}_{i}$ be the time on the motorcycle for walker $i$, then we have:</p> <p>$\sum{t}_{i}=T/2$ </p> <p><code>${t}_{i}+(T-{t}_{i}){a}_{i}=L\$</code> for $i=1,2,...,n$ </p> <p>which is n+1 equations for n+1 unknowns. What is perhaps a little surprising about the plan is that the total time $T$ doesn't depend on whom M decides to pick first, and whom to pick later. Maybe this is not very relevant to my original questions, but I can't help remark on it. </p>