Formal verification of probabilistic swarm behaviours

Authors:
Savas Konur;Clare Dixon;Michael Fisher
Affiliations:
Department of Computer Science, University of Liverpool, Liverpool, UK;Department of Computer Science, University of Liverpool, Liverpool, UK;Department of Computer Science, University of Liverpool, Liverpool, UK
Venue:
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Year:
2010

Citing 7
Cited 4

Model checking

Model checking
Mathematical Model of Foraging in a Group of Robots: Effect of Interference

Autonomous Robots
A formal analysis of bluetooth device discovery

International Journal on Software Tools for Technology Transfer (STTT)
Strategies for energy optimisation in a swarm of foraging robots

SAB'06 Proceedings of the 2nd international conference on Swarm robotics
From swarm intelligence to swarm robotics

SAB'04 Proceedings of the 2004 international conference on Swarm Robotics
A review of probabilistic macroscopic models for swarm robotic systems

SAB'04 Proceedings of the 2004 international conference on Swarm Robotics
PRISM: a tool for automatic verification of probabilistic systems

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Towards temporal verification of emergent behaviours in swarm robotic systems

TAROS'11 Proceedings of the 12th Annual conference on Towards autonomous robotic systems
Analysing robot swarm behaviour via probabilistic model checking

Robotics and Autonomous Systems
Property-driven design for swarm robotics

Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Towards a formal verification methodology for collective robotic systems

ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Robot swarms provide a way for a number of simple robots to work together to carry out a task. While swarms have been found to be adaptable, fault-tolerant and widely applicable, designing individual robot algorithms so as to ensure effective and correct swarm behaviour is very difficult. In order to assess swarm effectiveness, either experiments with real robots or computational simulations of the swarm are usually carried out. However, neither of these involve a deep analysis of all possible behaviours. In this paper we will utilise automated formal verification techniques, involving an exhaustive mathematical analysis, in order to assess whether our swarms will indeed behave as required.