#### Filter Results:

#### Publication Year

2013

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

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 point, assuming each point can use only the locations of the others it sees when making decisions and that the visibility graph as a whole is connected. In time complexity analyses of… (More)

In multi-agent rendezvous it is naturally assumed that agents have a maximum speed of movement. In the absence of any distributed control issues, this imposes a lower bound on the time to rendezvous, for idealised point agents, proportional to the diameter of a configuration. Assuming bounded visibility, we consider Ω(<i>n</i><sup>2</sup> log <i>n</i>)… (More)

We present a two-parameter family (G m,k) m,k∈N ≥2 , of finite, non-abelian random groups and propose that, for each fixed k, as m → ∞ the commuting graph of G m,k is almost surely connected and of diameter k. We present heuristic arguments in favour of this conjecture, following the lines of classical arguments for the Erd˝ os– Rényi random graph. As well… (More)

- ‹
- 1
- ›