Rendezvous problem

The Rendezvous problem is a classic problem in the fields of computer science, robotics, and distributed systems. The core concept involves coordinating a group of agents (or entities) to meet at a common location or time despite having limited communication capabilities or knowledge about each other's initial positions.