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 条
  • [21] SAFE WELDING WITH ROBOTICS.
    Schiedermayer, Marvin L.
    National safety news, 1983, 128 (02): : 48 - 50
  • [22] Telexistence: Next-generation networked robotics
    Tachi, S
    Telecommunication, Teleimmersion and Telexistence II, 2005, : 3 - +
  • [23] QoS Challenges in Wireless Sensor Networked Robotics
    Troubleyn, Evy
    Moerman, Ingrid
    Demeester, Piet
    WIRELESS PERSONAL COMMUNICATIONS, 2013, 70 (03) : 1059 - 1075
  • [24] The module pool: Building blocks for networked robotics
    McKee, GT
    Baker, DI
    Schenker, PS
    PROCEEDINGS OF THE 11TH INTERNATIONAL CONFERENCE ON ADVANCED ROBOTICS 2003, VOL 1-3, 2003, : 338 - 344
  • [25] QoS Challenges in Wireless Sensor Networked Robotics
    Evy Troubleyn
    Ingrid Moerman
    Piet Demeester
    Wireless Personal Communications, 2013, 70 : 1059 - 1075
  • [26] A study on transmission of image information in networked robotics
    Imai, T
    Iida, Y
    Fujimoto, H
    Sano, A
    VSMM 2000: 6TH INTERNATIONAL CONFERENCE ON VIRTUAL SYSTEMS AND MULTIMEDIA, 2000, : 323 - 328
  • [27] Complexity of probabilistic verification
    1600, ACM, New York, NY, USA (42):
  • [28] Probabilistic verification and approximation
    Lassaigne, Richard
    Peyronneta, Sylvain
    ANNALS OF PURE AND APPLIED LOGIC, 2008, 152 (1-3) : 122 - 131
  • [29] THE COMPLEXITY OF PROBABILISTIC VERIFICATION
    COURCOUBETIS, C
    YANNAKAKIS, M
    JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY, 1995, 42 (04): : 857 - 907
  • [30] VERIFICATION OF PROBABILISTIC PROGRAMS
    SHARIR, M
    PNUELI, A
    HART, S
    SIAM JOURNAL ON COMPUTING, 1984, 13 (02) : 292 - 314