← Search

Costas Busch

2 accepted papers

2015

Tight analysis of a collisionless robot gathering algorithm

IROS 2015poster

We consider the fundamental problem of gathering a set of n robots in the Euclidean plane which have a physical extent and hence they cannot share their positions with other robots. The objective is to determine a minimum time schedule to gather the robots as close together as possible around a pred…

Cited by 16SourceScholar