1. Alpern S, Gal S (2003) The theory of search games and rendezvous. Kluwer Academic, Boston
2. Baeza-Yates R, Culberson J, Rawlins G (1993) Searching in the plane. Inf Comput 106(2): 234–252
3. Beck A (1964) On the linear search problem. Naval Res Logist 2:221–228
4. Beck A, Newman DJ (1970) Yet more on the linear search problem. Isr J Math 8:419–429
5. Bernstein DS, Finkelstein L, Zilberstein S (2003) Contract algorithms and robots on rays: unifying two scheduling problems. In: Proceedings of the 18th international joint conference on artificial intelligence (IJCAI), Acapulco, pp 1211–1217