Binary Information Press
In this paper, the p-Probabilistic Rendezvous algorithm (in short p-PR) is introduced. The main difference between the traditional rendezvous and the authors' is that the former requires exact location information to calculate the rendezvous. Without this restriction, p-PR is more suitable in applications, where the uncertainty of the locations is commonplace. The main novelty of their approach is that the geometric properties of the rendezvous problem are exploited to avoid the exhaustive examination of all combinations of the object instances.