Collaborative Robot Exploration and Rendezvous: Algorithms, Performance Bounds and Observations

Download PDF
Open Webpage

Nicholas Roy, Gregory Dudek

Published: 2001, Last Modified: 07 Nov 2025Auton. Robots 2001EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We consider the problem of how two heterogeneous robots can arrange to meet in an unknown environment from unknown starting locations: that is, the problem of arranging a robot rendezvous. We are interested, in particular, in allowing two robots to rendezvous so that they can collaboratively explore an unknown environment. Specifically, we address the problem of how a pair of exploring agents that cannot communicate with one another over long distances can meet if they start exploring at different unknown locations in an unknown environment.