A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Symmetric Rendezvous Search on the Line With an Unknown Initial Distance
2013
IEEE Transactions on robotics
In the rendezvous search problem, two robots at unknown locations must successfully meet somewhere in the environment. We study the symmetric version of the problem in which they must use the same strategy. We provide a new algorithm for the symmetric rendezvous problem on the line. Our symmetric strategy has a competitive ratio of 17.686 for total distance traveled and a competitive ratio of 24.843 for total time. Both are improvements over the previously best known algorithm, which has (time
doi:10.1109/tro.2013.2272252
fatcat:6mrq3wgxz5gm7bkfzesoynjvjq