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 条
  • [41] A Distributed Algorithm for Circle Formation by Multiple Mobile Robots
    Gautam, Avinash
    Mohan, Sudeept
    2013 INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION, ROBOTICS AND EMBEDDED SYSTEMS (CARE-2013), 2013,
  • [42] On Two-Dimensional Lyndon Words
    Marcus, Shoshana
    Sokol, Dina
    STRING PROCESSING AND INFORMATION RETRIEVAL (SPIRE 2013), 2013, 8214 : 206 - 217
  • [43] Periodic musical sequences and Lyndon words
    M. Chemillier
    Soft Computing, 2004, 8 : 611 - 616
  • [44] Lyndon Partial Words and Arrays with Applications
    Paramasivan, Meenakshi
    Kumari, R. Krishna
    Arulprakasam, R.
    Dare, V. Rajkumar
    COMBINATORIAL IMAGE ANALYSIS, IWCIA 2022, 2023, 13348 : 226 - 244
  • [45] Lyndon words, polylogarithms and the Riemann ζ function
    Minh, HN
    Petitot, M
    DISCRETE MATHEMATICS, 2000, 217 (1-3) : 273 - 292
  • [46] Gray code order for Lyndon words
    Vajnovszki, Vincent
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2007, 9 (02): : 145 - 151
  • [47] On morphisms preserving infinite Lyndon words
    Université de Picardie Jules Verne, LaRIA, 33 Rue Saint Leu, 80039 Amiens cedex 1, France
    Discrete Math. Theor. Comput. Sci., 2007, 2 (89-108):
  • [48] Generalized Lyndon factorizations of infinite words
    Burcroff, Amanda
    Winsor, Eric
    THEORETICAL COMPUTER SCIENCE, 2020, 809 : 30 - 38
  • [49] On morphisms preserving infinite Lyndon words
    Richmme, Gwenaeel
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2007, 9 (02): : 89 - 107
  • [50] Monomial algebras defined by Lyndon words
    Gateva-Ivanova, Tatiana
    Floystad, Gunnar
    JOURNAL OF ALGEBRA, 2014, 403 : 470 - 496
12345