Decentralized runtime enforcement for robotic swarms

被引:3
|
作者
Hu, Chi [1 ]
Dong, Wei [1 ]
Yang, Yong-hui [2 ]
Shi, Hao [1 ]
Deng, Fei [2 ]
机构
[1] Natl Univ Def Technol, Coll Comp Sci, Changsha 410073, Peoples R China
[2] China Acad Engn Phys, Inst Comp Applicat, Mianyang 621999, Sichuan, Peoples R China
基金
中国国家自然科学基金;
关键词
Runtime enforcement; Multi-level property; D-time enforcement; Robotic swarm; TP311;
D O I
10.1631/FITEE.2000203
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Robotic swarms are usually designed in a bottom-up way, which can make robotic swarms vulnerable to environmental impact. It is particularly true for the widely used control mode of robotic swarms, where it is often the case that neither the correctness of the swarming tasks at the macro level nor the safety of the interaction among agents at the micro level can be guaranteed. To ensure that the behaviors are safe at runtime, it is necessary to take into account the property guard approaches for robotic swarms in uncertain environments. Runtime enforcement is an approach which can guarantee the given properties in system execution and has no scalability issue. Although some runtime enforcement methods have been studied and applied in different domains, they cannot effectively solve the problem of property enforcement on robotic swarm tasks at present. In this paper, an enforcement method is proposed on swarms which should satisfy multi-level properties in uncertain environments. We introduce a macro-micro property enforcing framework with the notion of agent shields and a discrete-time enforcing mechanism called D-time enforcing. To realize this method, a domain specification language and the corresponding enforcer synthesis algorithms are developed. We then apply the approach to enforce the properties of the simulated robotic swarm in the robotflocksim platform. We evaluate and show the effectiveness of the method with experiments on specific unmanned aerial vehicle swarm tasks.
引用
收藏
页码:1591 / 1606
页数:16
相关论文
共 50 条
  • [1] Decentralized runtime enforcement for robotic swarms
    Chi Hu
    Wei Dong
    Yong-hui Yang
    Hao Shi
    Fei Deng
    Frontiers of Information Technology & Electronic Engineering, 2020, 21 : 1591 - 1606
  • [2] Decentralized controllers for shape generation with robotic swarms
    Hsieh, M. Ani
    Kumar, Vijay
    Chaimowicz, Luiz
    ROBOTICA, 2008, 26 (691-701) : 691 - 701
  • [3] Decentralized Lattice Formation Control for Micro Robotic Swarms
    Lionis, Grigoris
    Kyriakopoulos, Kostas J.
    2009 IEEE-RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, 2009, : 3756 - 3761
  • [4] Decentralized Control of Minimalistic Robotic Swarms For Guaranteed Target Encapsulation
    Sinhmar, Himani
    Kress-Gazit, Hadas
    2022 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2022, : 7251 - 7258
  • [5] Response probability enhances robustness in decentralized threshold-based robotic swarms
    Annie S. Wu
    R. Paul Wiegand
    Ramya Pradhan
    Swarm Intelligence, 2020, 14 : 233 - 258
  • [6] Response probability enhances robustness in decentralized threshold-based robotic swarms
    Wu, Annie S.
    Wiegand, R. Paul
    Pradhan, Ramya
    SWARM INTELLIGENCE, 2020, 14 (03) : 233 - 258
  • [7] On Bidirectional Runtime Enforcement
    Aceto, Luca
    Cassar, Ian
    Francalanza, Adrian
    Ingolfsdottir, Anna
    FORMAL TECHNIQUES FOR DISTRIBUTED OBJECTS, COMPONENTS, AND SYSTEMS, FORTE 2021, 2021, 12719 : 3 - 21
  • [8] Predictive runtime enforcement
    Pinisetty, Srinivas
    Preoteasa, Viorel
    Tripakis, Stavros
    Jeron, Thierry
    Falcone, Ylies
    Marchand, Herve
    FORMAL METHODS IN SYSTEM DESIGN, 2017, 51 (01) : 154 - 199
  • [9] Compositional Runtime Enforcement
    Pinisetty, Srinivas
    Tripakis, Stavros
    NASA FORMAL METHODS, NFM 2016, 2016, 9690 : 82 - 99
  • [10] Runtime Enforcement of Hyperproperties
    Coenen, Norine
    Finkbeiner, Bernd
    Hahn, Christopher
    Hofmann, Jana
    Schillo, Yannick
    AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, ATVA 2021, 2021, 12971 : 283 - 299