The rendezvous and coordinated search problems

Considers the optimal search problems in which a pair of searchers seek to minimize the expected time taken to find each other (rendezvous search) or to regroup at their initial fixed location after one finds a stationary object on the line (coordinated search). There is a known distribution for the searchers and for the hidden object, respectively. These problems respectively generalize to two searchers the well known problems of “search games with immobile hiders” and the “linear search problem”