Abstract
This article investigates the use of the integral of linear birth-death processes in the context of analyzing swarm robotics systems. We show that when a robot swarm can be modeled as a linear birth-death process, well-established results can be used to compute the expected value and/or the distribution of important swarm performance measures, such as the swarm activity time or the swarm energy consumption. We also show how the linear birth-death model can be used to estimate the long-term value of such performance measures and design robot controllers that satisfy constraints on these measures.
- N. Bailey. 1990. The Elements of Stochastic Processes With Applications to the Natural Sciences. Wiley, New York, NY.Google Scholar
- F. Ball and V. Stefanov. 2001. Further approaches to computing fundamental characteristics of birth-death processes. Journal of Applied Probability 38, 4, 995--1005.Google Scholar
Cross Ref
- S. Berman. 2010. Abstractions, Analysis Techniques, and Synthesis of Scalable Control Strategies for Robot Swarms. Ph.D. Dissertation. Department of Mechanical Engineering and Applied Mechanics, University of Pennsylvania.Google Scholar
- M. Brambilla, E. Ferrante, M. Birattari, and M. Dorigo. 2013. Swarm robotics: A review from the swarm engineering perspective. Swarm Intelligence 7, 1, 1--41.Google Scholar
Cross Ref
- A. Campo and M. Dorigo. 2007. Efficient multi-foraging in swarm robotics. In Advances in Artificial Life. Springer, Berlin, Germany, 696--705. Google Scholar
Digital Library
- F. Crawford and M. Suchard. 2012. Transition probabilities for general birth-death processes with applications in ecology, genetics, and evolution. Journal of Mathematical Biology, 553--580.Google Scholar
Cross Ref
- P. Flajolet and F. Guillemin. 2000. The formal theory of birth-and-death processes, lattice path combinatorics and continued fractions. Advances in Applied Probability 32, 3, 750--778.Google Scholar
Cross Ref
- J. Gani and D. Jerwood. 1972. The cost of a general stochastic epidemic. Journal of Applied Probability 9, 2, 257--269.Google Scholar
Cross Ref
- E. Gjondrekaj, M. Loreti, R. Pugliese, F. Tiezzi, C. Pinciroli, M. Brambilla, M. Birattari, and M. Dorigo. 2012. Towards a formal verification methodology for collective robotic systems. In Formal Methods and Software Engineering. Springer, Berlin, Germany, 54--70. Google Scholar
Digital Library
- H. Hamann. 2010. Space-Time Continuous Models of Swarm Robotic Systems: Supporting Global-to-Local Programming. Vol. 9. Springer, Berlin, Germany. Google Scholar
Digital Library
- H. Hamann, G. Valentini, Y. Khaluf, and M. Dorigo. 2014. Derivation of a micro-macro link for collective decision-making systems: Uncover network features based on drift measurements. In Parallel Problem Solving from Nature—PPSN XIII. Lecture Notes in Computer Science, Vol. 8672. Springer, 181--190.Google Scholar
- J. Hereford. 2010. Analysis of a new swarm search algorithm based on trophallaxis. In Proceedings of the 2010 IEEE Congress on Evolutionary Computation (CEC’10). IEEE, Los Alamitos, CA, 1--8.Google Scholar
Cross Ref
- M. Hernández-Suárez and C. Castillo-Chavez. 1999. A basic result on the integral for birth-death Markov processes. Mathematical Biosciences 161, 1--2, 95--104.Google Scholar
Cross Ref
- D. Jerwood. 1970. A note on the cost of the simple epidemic. Journal of Applied Probability 7, 2, 440--443.Google Scholar
Cross Ref
- Y. Khaluf, M. Birattari, and H. Hamann. 2014. A swarm robotics approach to task allocation under soft deadlines and negligible switching costs. In From Animals to Animats 13. Lecture Notes in Computer Science, Vol. 8575. Springer, 270--279.Google Scholar
- Y. Khaluf, M. Birattari, and F. Rammig. 2013. Probabilistic analysis of long-term swarm performance under spatial interferences. In Theory and Practice of Natural Computing. Lecture Notes in Computer Science, Vol. 8273. Springer, 121--132.Google Scholar
- K. Lerman, A. Galstyan, A. Martinoli, and A. Ijspeert. 2001. A macroscopic analytical model of collaboration in distributed robotic systems. Artificial Life 7, 4, 375--393. Google Scholar
Digital Library
- W. Liu and A. Winfield. 2010. Modeling and optimization of adaptive foraging in swarm robotic systems. International Journal of Robotics Research 29, 14, 1743--1760. Google Scholar
Digital Library
- M. Mangel and C. Tier. 1994. Four facts every conservation biologist should know about persistence. Ecology 75, 3, 607--614.Google Scholar
Cross Ref
- A. Martinoli, K. Easton, and W. Agassounon. 2004. Modeling swarm robotic systems: A case study in collaborative distributed manipulation. International Journal of Robotics Research 23, 4--5, 415--436.Google Scholar
Cross Ref
- A. Martinoli, A. Ijspeert, and L. Gambardella. 1999. A probabilistic model for understanding and comparing collective aggregation mechanisms. In Advances in Artificial Life. Springer, Berlin, Germany, 575--584. Google Scholar
Digital Library
- T. Mather and M. Hsieh. 2011. Distributed robot ensemble control for deployment to multiple sites. In Robotics: Science and Systems, H. F. Durrant-Whyte, N. Roy, and P. Abbeel (Eds.). MIT Press, Los Angeles, CA, 201--208.Google Scholar
- P. Moran. 1959. The Theory of Storage. Methuen Ltd, London, UK.Google Scholar
- C. Pinciroli, V. Trianni, R. O’Grady, G. Pini, A. Brutschy, M. Brambilla, N. Mathews, E. Ferrante, G. Di Caro, Frederick F. Ducatelle, M. Birattari, L. Gambardella, and M. Dorig. 2012. ARGoS: A modular, parallel, multi-engine simulator for multi-robot systems. Swarm Intelligence 6, 4, 271--295.Google Scholar
Cross Ref
- P. Pollett. 2003. Integrals for continuous-time Markov chains. Mathematical Biosciences 182, 2, 213--225.Google Scholar
Cross Ref
- P. Pollett and V. Stefanov. 2002. Path integrals for continuous-time Markov chains. Journal of Applied Probability 39, 901--904.Google Scholar
Cross Ref
- S. Puri. 1967. A class of stochastic models of response after infection in the absence of defense mechanism. In Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, Vol. 4. 511--535.Google Scholar
- S. Ross. 2006. Introduction to Probability Models (8th ed). Academic Press.Google Scholar
- F. Shaw and E. Klavins. 2008. Distributed estimation and control for stochastically interacting robots. In Proceedings of the 47th IEEE Conference on Decision and Control. IEEE, Los Alamitos, CA, 1895--1901.Google Scholar
- O. Soysal and E. Şahin. 2006. A macroscopic model for self-organized aggregation in swarm robotic systems. In Swarm Robotics. Lecture Notes in Computer Science, Vol. 4433. Springer, 27--42. Google Scholar
Digital Library
- V. Stefanov. 1995. Mean passage times for tridiagonal transition matrices. Journal of Applied Probability 32, 3, 846--849.Google Scholar
Cross Ref
- V. Stefanov and S. Wang. 2000. A note on integrals for birth--death processes. Mathematical Biosciences 168, 2, 161--165.Google Scholar
Cross Ref
- G. Valentini and H. Hamann. 2015. Time-variant feedback processes in collective decision-making systems: Influence and effect of dynamic neighborhood sizes. Swarm Intelligence 9, 2--3, 153--176.Google Scholar
Cross Ref
- B. Varghese and G. McKee. 2010. A mathematical model, implementation and study of a swarm system. Robotics and Autonomous Systems 58, 3, 287--294. Google Scholar
Digital Library
- A. Winfield, W. Liu, J. Nembrini, and A. Martinoli. 2008. Modelling a wireless connected swarm of mobile robots. Swarm Intelligence 2, 2--4, 241--266.Google Scholar
Cross Ref
- A. Winfield and J. Nembrini. 2006. Safety in numbers: Fault-tolerance in robot swarms. International Journal of Modelling, Identification and Control 1, 1, 30--37.Google Scholar
Cross Ref
- J. Yeh. 2006. Real Analysis: Theory of Measure and Integration. World Scientific, Singapore.Google Scholar
Index Terms
Modeling Robot Swarms Using Integrals of Birth-Death Processes
Recommendations
Cooperative Velocity Updating model based Particle Swarm Optimization
Particle swarm optimization (PSO) has shown its good performance in many optimization problems. This paper proposes a Cooperative Velocity Updating algorithm based Particle Swarm Optimization (CVUPSO), which is inspired by the competition and ...
A discrete-time queueing model with abandonments
QTNA '10: Proceedings of the 5th International Conference on Queueing Theory and Network ApplicationsThis paper presents a multi-server queueing model with abandonments in discrete time. In every time slot a generally distributed number (batch) of customers arrives. The different numbers of arrivals in consecutive slots are mutually independent. Each ...
Three Sub-swarms Exchange Particle Swarm Optimization Based on Different Evolvement Model
WMSVM '10: Proceedings of the 2010 Second International Conference on Modeling, Simulation and Visualization MethodsParticle swarm optimization and its modifications appear premature convergence for complex optimization problem, because particles’ performance becomes same in seeking later period. In this paper, a new model is proposed to avoiding particles’ ...






Comments