4.5 Article

Analysing robot swarm behaviour via probabilistic model checking

Journal

ROBOTICS AND AUTONOMOUS SYSTEMS
Volume 60, Issue 2, Pages 199-213

Publisher

ELSEVIER
DOI: 10.1016/j.robot.2011.10.005

Keywords

Robot swarms; Swarm algorithms; Formal verification; Probabilistic model-checking

Funding

  1. EPSRC [EP/F033567]
  2. EPSRC [EP/F033567/1] Funding Source: UKRI
  3. Engineering and Physical Sciences Research Council [EP/F033567/1] Funding Source: researchfish

Ask authors/readers for more resources

An alternative to deploying a single robot of high complexity can be to utilise robot swarms comprising large numbers of identical, and much simpler, robots. Such swarms have been shown to be adaptable, fault-tolerant and widely applicable. However, designing individual robot algorithms to ensure effective and correct overall swarm behaviour is actually very difficult. While mechanisms for assessing the effectiveness of any swarm algorithm before deployment are essential, such mechanisms have traditionally involved either computational simulations of swarm behaviour, or experiments with robot swarms themselves. However, such simulations or experiments cannot, by their nature, analyse all possible swarm behaviours. In this paper, we will develop and apply the use of automated probabilistic formal verification techniques to robot swarms, involving an exhaustive mathematical analysis, in order to assess whether swarms will indeed behave as required. In particular we consider a foraging robot scenario to which we apply probabilistic model checking. (C) 2011 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available