This paper looks at the problem of searching the plane for an object
with multiple agents, in co-ordinated search.  Also the problem of how
to deal with noise within the context of Sandor Fakete's Kissing
Circles algorithm is addressed and a method of coping is conjectured.

The relative performance of a family of redezvous search algorithms
for mulit-agent search in the plane.  Some very strict assumptions
have been made to idealize the circumstance in order to simplify the
analysis.