Safe Networked Robotics with Probabilistic Verification

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Narasimhan, Sai Shankar, Bhat, Sharachchandra, Chinchali, Sandeep P.
Formato: Preprint
Publicado: 2023
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866913595896365056
author Narasimhan, Sai Shankar
Bhat, Sharachchandra
Chinchali, Sandeep P.
author_facet Narasimhan, Sai Shankar
Bhat, Sharachchandra
Chinchali, Sandeep P.
contents 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 paper 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.
format Preprint
id arxiv_https___arxiv_org_abs_2302_09182
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Safe Networked Robotics with Probabilistic Verification
Narasimhan, Sai Shankar
Bhat, Sharachchandra
Chinchali, Sandeep P.
Robotics
Formal Languages and Automata Theory
Systems and Control
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 paper 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.
title Safe Networked Robotics with Probabilistic Verification
topic Robotics
Formal Languages and Automata Theory
Systems and Control
url https://arxiv.org/abs/2302.09182