m-RENDEZVOUS: Multi-Agent Asynchronous Rendezvous Search Technique

We study the problem of asynchronous rendezvous search with multiple mobile agents (robots) in the plane. The goal of the robots is to meet at a location in the environment which is not determined in advance as quickly as possible. They do not know the initial locations of each other or their own initial locations. Moreover, the initial distance between any pair of robots is also unknown. Therefore, the problem must be solved using an online approach. We study a new variant of the rendezvous search problem which we call m-RP. The objective of m-RP is exactly m更多