<i>k</i>-Circle Formation and <i>k</i>-epf by Asynchronous Robots

<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...

Full description

Bibliographic Details
Main Authors: Subhash Bhagat, Bibhuti Das, Abhinav Chakraborty, Krishnendu Mukhopadhyaya
Format: Article
Language:English
Published: MDPI AG 2021-02-01
Series:Algorithms
Subjects:
swarm robotics
k-circle formation
k-epf
asynchronous
one axis agreement
Online Access:https://www.mdpi.com/1999-4893/14/2/62

Internet

https://www.mdpi.com/1999-4893/14/2/62

Similar Items