Formal Verification of Robotics Navigation Algorithms

Germanos, Vasileios and Secco, Emanuele Lindo (2016) Formal Verification of Robotics Navigation Algorithms. In: 2016 IEEE Intl Conference on Computational Science and Engineering (CSE) and IEEE Intl Conference on Embedded and Ubiquitous Computing (EUC) and 15th Intl Symposium on Distributed Computing and Applications for Business Engineering (DCABES). IEEE, Paris, pp. 177-180. ISBN 9781509035939

Full text not available from this repository.

Abstract

BUGs algorithms are navigation algorithms that
have been designed to seek of a target in a plane that contains obstacles. Many new navigation algorithms have been inspired from them and their applications can be found in autonomous mobile robots, e.g., self driving vehicles. These algorithms are inspired from insects and are comparable to the motion of ants, which yields motion strategies for the robot that guarantees the elusive target will be detected, if such strategies exist. However, these algorithms have not been formally verified using existing formal verification tools. Therefore, the aim of this paper is to apply model checking for verifying the correctness of BUGs algorithms and draw conclusions for future uses of formal methods in the design and model checking of navigation algorithms.

Item Type:	Book Section
Faculty / Department:	Faculty of Human and Digital Sciences > Mathematics and Computer Science
Depositing User:	Emanuele Secco
Date Deposited:	31 Jul 2017 15:26
Last Modified:	31 Jul 2017 15:26
URI:	https://hira.hope.ac.uk/id/eprint/1601

Actions (login required)

View Item