Circle formation of weak robots and Lyndon words

被引：15
|
作者：
Dieudonne, Yoann [1 ]
Petit, Franck [1 ]
机构：
[1] Univ Picardie Jules Verne, CNRS, LaRIA, FRE 2733, Amiens, France
来源：
INFORMATION PROCESSING LETTERS | 2007年 / 101卷 / 04期
关键词：
distributed computing; formation of geometric patterns; mobile robot networks; self-deployment;
D O I：
10.1016/j.ipl.2006.09.008
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Lyndon words, which are used to build and to prove an efficient and simple deterministic protocol solving the CFP for a prime number of robots greater than or equal to 5 and their applications are discussed. Lyndon words can be used in the distributed control of a set of n anonymous robots being memoryless, without any common sense of direction, and unable to communicate in an other way than observation. An efficient and simple deterministic protocol to form a regular n-gon was presented for a prime number of robots. Lyndon words has proven itself efficient in solving the Circle Formation Problem without any arbitrary number of robots.
引用
收藏
页码：156 / 162
页数：7
相关论文
共 50 条
  • [21] Language of Lyndon Partial Words
    Kumari, R. Krishna
    Arulprakasam, R.
    Dare, V. R.
    INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE, 2020, 15 (04): : 1173 - 1177
  • [22] Lyndon words and Fibonacci numbers
    Saari, Kalle
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2014, 121 : 34 - 44
  • [23] Formation Control of Weak Autonomous Robots
    Zhang, Huan
    Pathirana, Pubudu N.
    2011 50TH IEEE CONFERENCE ON DECISION AND CONTROL AND EUROPEAN CONTROL CONFERENCE (CDC-ECC), 2011, : 4220 - 4225
  • [24] Lyndon factorization of the Prouhet words
    Séébold, P
    THEORETICAL COMPUTER SCIENCE, 2003, 307 (01) : 179 - 197
  • [25] Lyndon factorization of sturmian words
    Melançon, G
    DISCRETE MATHEMATICS, 2000, 210 (1-3) : 137 - 149
  • [26] Lyndon words, permutations and trees
    Hohlweg, C
    Reutenauer, C
    THEORETICAL COMPUTER SCIENCE, 2003, 307 (01) : 173 - 178
  • [27] Unbordered factors and Lyndon words
    Duval, J. -P.
    Harju, T.
    Nowotka, D.
    DISCRETE MATHEMATICS, 2008, 308 (11) : 2261 - 2264
  • [28] Infinite Smooth Lyndon Words
    Paquin, Genevieve
    PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2008, 2008, : 126 - 139
  • [29] Structure of Polyzetas and Lyndon Words
    Minh H.N.
    Vietnam Journal of Mathematics, 2013, 41 (4) : 409 - 450
  • [30] Lyndon Words and Short Superstrings
    Mucha, Marcin
    PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 958 - 972
12345