A probabilistic solution to rendezvous problem

Abstract

Here is a description of a probabilistic algorithm to help two people, lost in a complex maze, find each other in minimum possible time. These problems are broadly classified as 'Rendezvous Problems'[1]. The algorithm can be used in many practical situations like robots finding each other, detectives catching thieves, etc. The important point to note is that this algorithm works when the user is aware of the entire network of roads. He need not know anything else say the initial location or the present location of the other person. © 2013 Springer.