<i>k</i>-Circle Formation and <i>k</i>-epf by Asynchronous Robots
For a given positive integer <i>k</i>, the <i>k</i>-circle formation problem asks a set of autonomous, asynchronous robots to form disjoint circles having <i>k</i> robots each at distinct locations, centered at a set of fixed points in the Euclidean plane. The rob...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-02-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/14/2/62 |