Testing, validation, and verification of robotic and autonomous systems: a systematic review

H Araujo, MR Mousavi, M Varshosaz - ACM Transactions on Software …, 2023 - dl.acm.org
We perform a systematic literature review on testing, validation, and verification of robotic
and autonomous systems (RAS). The scope of this review covers peer-reviewed research …

Skin and bones: Multi-layer, locally affine, optical flow and regularization with transparency

SX Ju, MJ Black, AD Jepson - Proceedings CVPR IEEE …, 1996 - ieeexplore.ieee.org
This paper describes a new method for estimating optical flow that strikes a balance
between the flexibility of local dense computations and the robustness and accuracy of …

Parameterized model checking of rendezvous systems

B Aminof, T Kotek, S Rubin, F Spegni, H Veith - Distributed Computing, 2018 - Springer
Parameterized model checking is the problem of deciding if a given formula holds
irrespective of the number of participating processes. A standard approach for solving the …

Verification of agent navigation in partially-known environments

B Aminof, A Murano, S Rubin, F Zuleger - Artificial Intelligence, 2022 - Elsevier
This paper establishes a framework based on logic and automata theory in which to model
and automatically verify systems of multiple mobile agents moving in environments with …

[HTML][HTML] Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane

M D'Emidio, G Di Stefano, D Frigioni… - Information and …, 2018 - Elsevier
In this paper we study the computational power of mobile robots without global coordination.
A comprehensive evaluation of the computational power of robots moving within the …

[HTML][HTML] An automata-theoretic approach to the verification of distributed algorithms

C Aiswarya, B Bollig, P Gastin - Information and Computation, 2018 - Elsevier
We introduce an automata-theoretic method for the verification of distributed algorithms
running on ring networks. In a distributed algorithm, an arbitrary number of processes …

[PDF][PDF] Automatic verification of multi-agent systems in parameterised grid-environments

B Aminof, A Murano, S Rubin, F Zuleger - Proceedings of the 2016 …, 2016 - ifaamas.org
We present a framework for modeling and analysing multiple mobile agents on grid-
environments such as finite mazes and labyrinths. Agents are modeled as automata, and the …

Synchronous gathering without multiplicity detection: a certified algorithm

T Balabonski, A Delga, L Rieg, S Tixeuil… - Theory of Computing …, 2019 - Springer
In mobile robotic swarms, the gathering problem consists in coordinating all the robots so
that in finite time they occupy the same location, not known beforehand. Multiplicity detection …

Using model checking to formally verify rendezvous algorithms for robots with lights in euclidean space

X Défago, A Heriban, S Tixeuil, K Wada - Robotics and Autonomous …, 2023 - Elsevier
The paper details the first successful attempt at using model checking techniques to verify
the correctness of distributed algorithms for robots evolving in a continuous environment …

Parameterized verification of algorithms for oblivious robots on a ring

A Sangnier, N Sznajder, M Potop-Butucaru… - Formal Methods in …, 2020 - Springer
We study verification problems for autonomous swarms of mobile robots that self-organize
and cooperate to solve global objectives. In particular, we focus in this paper on the model …