4 citations · 11 across the 8 of their papers we have counts for
1 paper · 1 filter
Peter Hegarty, Anders Martinsson, Dmitry Zhelezov
The classical multi-agent rendezvous problem asks for a deterministic algorithm by which n points scattered in a plane can move about at constant speed and merge at a single poin…