Probabilistic Model Checking of Ant-Based Positionless Swarming.
Lecture Notes in Artificial Intelligence(2016)
Abstract
Robot swarms are collections of simple robots cooperating without centralized control. Control algorithms for swarms are often inspired by decentralised problem-solving systems found in nature. In this paper we conduct a formal analysis of an algorithm inspired by the foraging behaviour of ants, where a swarm of flying vehicles searches for a target at some unknown location. We show how both exhaustive model checking and statistical model checking can be used to check properties that complement the results obtained through simulation, resulting in information that would facilitate the logistics of swarm deployment.
MoreTranslated text
Key words
Robot Swarm, Micro Air Vehicles (MAV), Probabilistic Computation Tree Logic (PCTL), Pheromone Level, Probabilistic Model Checker PRISM
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined