In this paper we analyze known conditions on control policies, which guarantee convergence in the multi-agent rendezvous problem. We discuss two examples which suggest a way to relax the continuity condition and to extend the class of control policies that may solve the problem. We propose a new, less restrictive condition, which characterizes a class of possibly non-continuous policies that guarantee rendezvous.