TY - GEN
T1 - Uniform circle formation by asynchronous robots
T2 - 26th International Conference on Computer Communications and Networks, ICCCN 2017
AU - Jiang, Shan
AU - Cao, Jiannong
AU - Wang, Jia
AU - Stojmenovic, Milos
AU - Bourgeois, Julien
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/9/14
Y1 - 2017/9/14
N2 - Recent advances in robotics technology have made it practical to deploy a large number of inexpensive robots in a wide range of application domains. In many of those applications, a group of autonomous robots is required to form a predefined geometric shape such as a line or a circle. This problem, namely pattern formation problem, is one of the most important coordination problems in multi-robot systems. A particular pattern extensively studied in literature is the uniform circle, and the corresponding problem is called uniform circle formation. In uniform circle formation, a set of simple mobile robots (asynchronous, autonomous), starting from arbitrary positions on the plane, have to arrange themselves on the vertices of a regular polygon eventually. Towards addressing the problem, existing works usually make conveniently strong assumptions, i.e., the robots are regarded as mass points and have unlimited sensing and communication range. The question of whether the robots with actual size and limited sensing and communication range could form a uniform circle, to our knowledge, has remained open. In this paper, we propose a new approach towards addressing this issue. Three phases, consensus on the circle, circle formation, and uniform transformation, constitute our approach. Inside our approach, there are some new distributed algorithms such as convex hull construction and cardinality estimation. Simulation result, theoretical analysis, and successful deployment have shown the effectiveness and practicability of our approach.
AB - Recent advances in robotics technology have made it practical to deploy a large number of inexpensive robots in a wide range of application domains. In many of those applications, a group of autonomous robots is required to form a predefined geometric shape such as a line or a circle. This problem, namely pattern formation problem, is one of the most important coordination problems in multi-robot systems. A particular pattern extensively studied in literature is the uniform circle, and the corresponding problem is called uniform circle formation. In uniform circle formation, a set of simple mobile robots (asynchronous, autonomous), starting from arbitrary positions on the plane, have to arrange themselves on the vertices of a regular polygon eventually. Towards addressing the problem, existing works usually make conveniently strong assumptions, i.e., the robots are regarded as mass points and have unlimited sensing and communication range. The question of whether the robots with actual size and limited sensing and communication range could form a uniform circle, to our knowledge, has remained open. In this paper, we propose a new approach towards addressing this issue. Three phases, consensus on the circle, circle formation, and uniform transformation, constitute our approach. Inside our approach, there are some new distributed algorithms such as convex hull construction and cardinality estimation. Simulation result, theoretical analysis, and successful deployment have shown the effectiveness and practicability of our approach.
KW - Distributed algorithm
KW - Multi-robot system
KW - Uniform circle formation
UR - http://www.scopus.com/inward/record.url?scp=85032287189&partnerID=8YFLogxK
U2 - 10.1109/ICCCN.2017.8038468
DO - 10.1109/ICCCN.2017.8038468
M3 - Conference Proceeding
AN - SCOPUS:85032287189
T3 - 2017 26th International Conference on Computer Communications and Networks, ICCCN 2017
BT - 2017 26th International Conference on Computer Communications and Networks, ICCCN 2017
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 31 July 2017 through 3 August 2017
ER -