SWARM
«Concurrency» in M-L-Parallel Semi-Markov Process
Eugene Larkin, Alexey Ivutin
- Year
- 2017
- Citations
- 5
- Access
- Open access
Abstract
This article investigates the functioning of a swarm of robots, each of which receives instructions from the external human operator and autonomously executes them. An abstract model of functioning of a robot, a group of robots and multiple groups of robots was obtained using the notion of semi-Markov process. The concepts of aggregated initial and aggregated absorbing states were introduced. Correspondences for calculation of time parameters of concurrency were obtained.
Keywords
ConcurrencyRobotComputer scienceProcess (computing)Markov chainMarkov processSwarm behaviourSwarm roboticsOperator (biology)Group (periodic table)
Related papers
OTHER
📊 26,957 cites
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
PERCEPTION
📊 22,245 cites
Artificial intelligence: a modern approach
1995
OTHER
📊 18,993 cites
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991
SWARM
📊 14,853 cites
A new optimizer using particle swarm theory
R.C. Eberhart, James Kennedy
2002