Self-stabilizing flocking of a group of mobile robots with memory corruption

被引:0
|
作者
Xiong, Naixue [1 ]
Yang, Y. [2 ]
Park, Jong Hyuk [3 ]
Vasilakos, Athanasios V. [4 ]
Yan, Xuefeng [5 ]
Pan, Yi [1 ,6 ]
机构
[1] Georgia State Univ, Dept Comp Sci, Atlanta, GA 30303 USA
[2] Seikei Univ, Ctr Asian & Pacific Studies, Tokyo, Japan
[3] Kyungnam Univ, Dept Comp Sci & Engn, Kyungnam, South Korea
[4] Univ Western Macedonia, Dept Comp & Telecommun Engn, Thessaloniki, Greece
[5] Nanjing Univ Aeronaut & Astronaut, Coll Informat Sci & Technol, Nanjing, Jiangsu, Peoples R China
[6] Georgia State Univ, Dept Comp Informat Syst, Atlanta, GA 30303 USA
来源
基金
美国国家科学基金会;
关键词
mobile robot; decentralized coordination; local interactions; flocking; formation generation; self-organization;
D O I
10.1002/wcm.814
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The rapid development of wireless technology plays extremely important roles in monitoring, control, and collaboration related applications. This paper aims at state-of-the-art self-stabilizing flocking control of wireless mobile robots with memory corruption. Flocking of a group of wireless mobile robots has gained a lot of attention due to its wide applications in recent years. While there are few works addressed on fault tolerance issue of flocking, especially for transient failure of robots. However, in the practical applications of robots, for the weak robots, some of their parts, like sensor, moving actuator, or memory etc., are prone to be crashed due to the complex environment. So, it is interesting to explore such kind of component crash or corruption (partly crash), especially for transient failure. The transient failure means the failure is temporary and after a while the robots will not be influenced by outside environment. Specially, in this paper, we mainly focus on how one kind of transient failure-memory corruption affects robot flocking, especially for the existed fault tolerant flocking. Copyright (C) 2009 John Wiley & Sons, Ltd.
引用
收藏
页码:1061 / 1072
页数:12
相关论文
共 50 条
  • [41] Quiescence of self-stabilizing gossiping among mobile agents in graphs
    Masuzawa, Toshimitsu
    Tixeuil, Sebastien
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (14-15) : 1567 - 1582
  • [42] Brief Announcement: Self-Stabilizing Counting in Mobile Sensor Networks
    Beauquier, Joffroy
    Clement, Julien
    Messika, Stephane
    Rosaz, Laurent
    Rozoy, Brigitte
    PODC'07: PROCEEDINGS OF THE 26TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2007, : 396 - 397
  • [43] Stacon: Self-Stabilizing Context Neighborhood for Mobile IoT Devices
    Liu, Chenguang
    Hua, Jie
    Hu, Changyong
    Julien, Christine
    2019 IEEE INTERNATIONAL CONFERENCE ON PERVASIVE COMPUTING AND COMMUNICATIONS WORKSHOPS (PERCOM WORKSHOPS), 2019, : 361 - 363
  • [44] Self-Stabilizing Clustering Algorithm in Mobile Ad Hoc Networks
    Ali, Mansouri
    Salim, Bouhlel Mohamed
    2015 SAI INTELLIGENT SYSTEMS CONFERENCE (INTELLISYS), 2015, : 978 - 983
  • [45] Self-stabilizing timestamps
    Abraham, U
    THEORETICAL COMPUTER SCIENCE, 2003, 308 (1-3) : 449 - 515
  • [46] Memory space requirements for self-stabilizing leader election protocols
    Universite de Paris-Sud, Orsay, France
    Proc Annu ACM Symp Princ Distrib Comput, (199-207):
  • [47] Self-stabilizing group communication in directed networks (extended abstract)
    Dolev, S
    Schiller, E
    SELF-STABILIZING SYSTEMS, PROCEEDINGS, 2003, 2704 : 61 - 76
  • [48] Brief Announcement Forgive & Forget: Self-stabilizing Swarms in Spite of Byzantine Robots
    Ashkenazi, Yotam
    Dolev, Shlomi
    Kamei, Sayaka
    Ooshita, Fukuhito
    Wada, Koichi
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2019, 2019, 11914 : 16 - 21
  • [49] Self-Stabilizing Self-Assembly
    Jilek, Martin
    Stranska, Katerina
    Somr, Michael
    Kulich, Miroslav
    Zeman, Jan
    Preucil, Libor
    IEEE ROBOTICS AND AUTOMATION LETTERS, 2022, 7 (04) : 9763 - 9769
  • [50] Self-stabilizing dynamic mutual exclusion for mobile ad hoc networks
    Chen, Y
    Welch, JL
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2005, 65 (09) : 1072 - 1089