Safe Networked Robotics With Probabilistic Verification

被引:0
|
作者
Narasimhan, Sai Shankar [1 ]
Bhat, Sharachchandra [1 ]
Chinchali, Sandeep P. [1 ]
机构
[1] Univ Texas Austin, Dept Elect & Comp Engn, Austin, TX 78712 USA
关键词
Formal methods in robotics and automation; networked robots; teleoperation; probabilistic verification; MARKOV DECISION-PROCESSES;
D O I
10.1109/LRA.2023.3340525
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
Autonomous robots must utilize rich sensory data to make safe control decisions. To process this data, compute-constrained robots often require assistance from remote computation, or the cloud, that runs compute-intensive deep neural network perception or control models. However, this assistance comes at the cost of a time delay due to network latency, resulting in past observations being used in the cloud to compute the control commands for the present robot state. Such communication delays could potentially lead to the violation of essential safety properties, such as collision avoidance. This article develops methods to ensure the safety of robots operated over communication networks with stochastic latency. To do so, we use tools from formal verification to construct a shield, i.e., a run-time monitor, that provides a list of safe actions for any delayed sensory observation, given the expected and maximum network latency. Our shield is minimally intrusive and enables networked robots to satisfy key safety constraints, expressed as temporal logic specifications, with desired probability. We demonstrate our approach on a real F1/10th autonomous vehicle that navigates in indoor environments and transmits rich LiDAR sensory data over congested WiFi links.
引用
下载
收藏
页码:2917 / 2924
页数:8
相关论文
共 50 条
  • [41] Towards Reliable and Safe Networked Applications
    Brekenfelder, Willi
    Parzyjegla, Helge
    Muehl, Gero
    2023 IEEE CONFERENCE ON NETWORK FUNCTION VIRTUALIZATION AND SOFTWARE DEFINED NETWORKS, NFV-SDN, 2023, : 189 - 192
  • [42] Distributed Safe Deployment of Networked Robots
    Alitappeh, Reza Javanmard
    Pimenta, Luciano C. A.
    DISTRIBUTED AUTONOMOUS ROBOTIC SYSTEMS, 2016, 112 : 65 - 77
  • [43] Clickybot: A Low-cost Platform for Networked Robotics
    Liu, Yanfei
    Westrick, William
    DeMange, Michael
    Tamashiro, Rodrigo
    PROCEEDINGS OF THE 2019 14TH IEEE CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS (ICIEA 2019), 2019, : 905 - 910
  • [44] Investigation on communication aspects of multiple swarm networked robotics
    Ali, Shahzad
    Khan, Zenib
    Din, Ahmad
    ul Hassan, Mahmood
    TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES, 2019, 27 (03) : 2010 - 2020
  • [45] Probabilistic Horn Clause Verification
    Albarghouthi, Aws
    STATIC ANALYSIS (SAS 2017), 2017, 10422 : 1 - 22
  • [46] Bloom filters in probabilistic verification
    Dillinger, PC
    Manolios, P
    FORMAL METHODS IN COMPUTER-AIDED DESIGN, PROCEEDINGS, 2004, 3312 : 367 - 381
  • [47] VERIFICATION OF MULTIPROCESS PROBABILISTIC PROTOCOLS
    PNUELI, A
    ZUCK, L
    DISTRIBUTED COMPUTING, 1986, 1 (01) : 53 - 72
  • [48] Probabilistic Verification of Network Configurations
    Steffen, Samuel
    Gehr, Timon
    Tsankov, Petar
    Vanbever, Laurent
    Vechev, Martin
    SIGCOMM '20: PROCEEDINGS OF THE 2020 ANNUAL CONFERENCE OF THE ACM SPECIAL INTEREST GROUP ON DATA COMMUNICATION ON THE APPLICATIONS, TECHNOLOGIES, ARCHITECTURES, AND PROTOCOLS FOR COMPUTER COMMUNICATION, 2020, : 750 - 764
  • [49] Program verification as probabilistic inference
    Gulwani, Sumit
    Jojic, Nebojsa
    ACM SIGPLAN NOTICES, 2007, 42 (01) : 277 - 289
  • [50] Accelerating Parametric Probabilistic Verification
    Jansen, Nils
    Corzilius, Florian
    Volk, Matthias
    Wimmer, Ralf
    Abraham, Erika
    Katoen, Joost-Pieter
    Becker, Bernd
    QUANTITATIVE EVALUATION OF SYSTEMS, QEST 2014, 2014, 8657 : 404 - 420