Skip to main content
Log in

A quantitative micro–macro link for collective decisions: the shortest path discovery/selection example

  • Published:
Swarm Intelligence Aims and scope Submit manuscript

Abstract

In this paper, we study how to obtain a quantitative correspondence between the dynamics of the microscopic implementation of a robot swarm and the dynamics of a macroscopic model of nest-site selection in honeybees. We do so by considering a collective decision-making case study: the shortest path discovery/selection problem. In this case study, obtaining a quantitative correspondence between the microscopic and macroscopic dynamics—the so-called micro–macro link problem—is particularly challenging because the macroscopic model does not take into account the spatial factors inherent to the path discovery/selection problem. We frame this study in the context of a general engineering methodology that prescribes the inclusion of available theoretical knowledge about target macroscopic models into design patterns for the microscopic implementation. The attainment of the micro–macro link presented in this paper represents a necessary step towards the formalisation of a design pattern for collective decision making in distributed systems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

Notes

  1. For a more specific definition of design patterns in the distributed systems domain, the interested reader is referred to the work of Babaoğlu et al. (2006).

  2. http://www.gctronic.com/doc/index.php/Overo_Extension.

References

  • Alexander, C., Ishikawa, S., & Silverstein, M. (1977). A pattern language: Towns, buildings, construction. New York: Oxford University Press.

    Google Scholar 

  • Arganda, S., Pérez-Escudero, A., & de Polavieja, G. (2012). A common rule for decision making in animal collectives across species. Proceedings of the National Academy of Sciences, 109(50), 20508–20513.

    Article  Google Scholar 

  • Babaoğlu, O., Canright, G., Deutsch, A., Di Caro, G. A., Ducatelle, F., Gambardella, L. M., et al. (2006). Design patterns from biology for distributed computing. Transactions on Adaptive and Autonomous Systems, 1(1), 26–66.

    Article  Google Scholar 

  • Baronchelli, A., Ferrer-i Cancho, R., Pastor-Satorras, R., Chater, N., & Christiansen, M. H. (2013). Networks in cognitive science. Trends in Cognitive Sciences, 17(7), 348–360.

    Article  Google Scholar 

  • Bartumeus, F., Da Luz, M. G. E., Viswanathan, G. M., & Catalan, J. (2005). Animal search strategies: A quantitative random-walk analysis. Ecology, 86(11), 3078–3087.

    Article  Google Scholar 

  • Berman, S., Halasz, A., Hsieh, M. A., & Kumar, V. (2009). Optimized stochastic policies for task allocation in swarms of robots. IEEE Transactions on Robotics, 25(4), 927–937.

    Article  Google Scholar 

  • Berman, S., Kumar, V., & Nagpal, R. (2011). Design of control policies for spatially inhomogeneous robot swarms with application to commercial pollination. In Proceedings of the 2011 IEEE International Conference on Robotics and Automation (ICRA 2011), (pp. 378–385). IEEE.

  • Brambilla, M., Ferrante, E., Birattari, M., & Dorigo, M. (2013). Swarm robotics: A review from the swarm engineering perspective. Swarm Intelligence, 7(1), 1–41.

    Article  Google Scholar 

  • Brambilla, M., Brutschy, A., Dorigo, M., & Birattari, M. (2015). Property-driven design for robot swarms. ACM Transactions on Autonomous and Adaptive Systems, 9(4), 17:1–17:28.

    Google Scholar 

  • Campo, A., Gutiérrez, A., Nouyan, S., Pinciroli, C., Longchamp, V., Garnier, S., et al. (2010). Artificial pheromone for path selection by a foraging swarm of robots. Biological Cybernetics, 103(5), 339–352.

    Article  Google Scholar 

  • Campo, A., Garnier, S., Dédriche, O., Zekkri, M., & Dorigo, M. (2011). Self-organized discrimination of resources. PLoS One, 6(5), e19888.

    Article  Google Scholar 

  • Castellano, C., Fortunato, S., & Loreto, V. (2009). Statistical physics of social dynamics. Reviews of Modern Physics, 81(2), 591–646.

    Article  Google Scholar 

  • Codling, E. A., Plank, M. J., & Benhamou, S. (2008). Random walk models in biology. Journal of the Royal Society, Interface, 5(25), 813–34.

    Article  Google Scholar 

  • Couzin, I. D. (2009). Collective cognition in animal groups. Trends in Cognitive Sciences, 13(1), 36–43.

    Article  Google Scholar 

  • Ferrante, E., Turgut, A. E., Huepe, C., Stranieri, A., Pinciroli, C., & Dorigo, M. (2012). Self-organized flocking with a mobile robot swarm: A novel motion control method. Adaptive Behavior, 20(6), 460–477.

  • Gamma, E., Helm, R., Johnson, R., & Vlissides, J. (1995). Design patterns: Elements of reusable object-oriented software. Boston, MA: Addison-Wesley Professional.

    Google Scholar 

  • Gardelli, L., Viroli, M., & Omicini, A. (2007). Design patterns for self-organising systems. In H. D. Burkhard, G. Lindemann, R. Verbrugge, & L. Z. Varge (Eds.), Multi-agent systems and applications V, volume 4696 of LNCS (pp. 123–132). Springer: Berlin.

  • Garnier, S., Jost, C., Gautrais, J., Asadpour, M., Caprari, G., Jeanson, R., et al. (2008). The embodiment of cockroach aggregation behavior in a group of micro-robots. Artificial Life, 14(4), 387–408.

    Article  Google Scholar 

  • Garnier, S., Gautrais, J., Asadpour, M., Jost, C., & Theraulaz, G. (2009). Self-organized aggregation triggers collective decision making in a group of cockroach-like robots. Adaptive Behavior, 17(2), 109–133.

    Article  Google Scholar 

  • Gillespie, D. T. (1976). A general method for numerically simulating stochastic time evolution of coupled chemical reactions. Journal of Computational Physics, 22, 403–434.

    Article  MathSciNet  Google Scholar 

  • Gutiérrez, A., Campo, A., Dorigo, M., Donate, J., Monasterio-Huelin, F., & Magdalena, L. (2009). Open e-puck range and bearing miniaturized board for local communication in swarm robotics. In IEEE International Conference on Robotics and Automation (ICRA), (pp. 3111–3116). IEEE Press.

  • Gutiérrez, A., Campo, A., Monasterio-Huelin, F., Magdalena, L., & Dorigo, M. (2010). Collective decision-making based on social odometry. Neural Computing & Applications, 19(6), 807–823.

    Article  Google Scholar 

  • Hamann, H., & Wörn, H. (2008). A framework of space–time continuous models for algorithm design in swarm robotics. Swarm Intelligence, 2(2), 209–239.

    Article  Google Scholar 

  • Jeanson, R., Blanco, S., Fournier, R., Deneubourg, J.-L., Fourcassié, V., & Theraulaz, G. (2003). A model of animal movements in a bounded space. Journal of Theoretical Biology, 225(4), 443–451.

    Article  MathSciNet  Google Scholar 

  • Kao, A. B., Miller, N., Torney, C., Hartnett, A., & Couzin, I. D. (2014). Collective learning and optimal consensus decisions in social animal groups. PLoS Computational Biology, 10(8), e1003762.

    Article  Google Scholar 

  • Kazadi, S. (2009). Model independence in swarm robotics. International Journal of Intelligent Computing and Cybernetics, 2(4), 672–694.

    Article  MathSciNet  MATH  Google Scholar 

  • Marshall, J. A. R., Bogacz, R., Dornhaus, A., Planqué, R., Kovacs, T., & Franks, N. R. (2009). On optimal decision-making in brains and social insect colonies. Journal of the Royal Society, Interface, 6(40), 1065–1074.

    Article  Google Scholar 

  • Mondada, F., Bonani, M., Raemy, X., Pugh, J., Cianci, C., Klaptocz, A., Magnenat, S., Zufferey, J.-C., Floreano, D., & Martinoli, A. (2009). The e-puck, a robot designed for education in engineering. In Proceedings of the 9th conference on autonomous robot systems and competitions, volume 1(1), (pp. 59–65). IPCB, Castelo Branco, Portugal.

  • Montes, M., Ferrante, E., Scheidler, A., Pinciroli, C., Birattari, M., & Dorigo, M. (2010). Majority-rule opinion dynamics with differential latency: A mechanism for self-organized collective decision-making. Swarm Intelligence, 5(3–4), 305–327.

    Google Scholar 

  • Nelson, W. (1969). Hazard plotting for incomplete failure data. Journal of Quality Technology, 1, 27–52.

    Google Scholar 

  • Pais, D., Hogan, P. M., Schlegel, T., Franks, N. R., Leonard, N. E., & Marshall, J. A. R. (2013). A mechanism for value-sensitive decision-making. PLoS One, 8(9), e73216.

    Article  Google Scholar 

  • Parker, C. A. C., & Zhang, H. (2009). Cooperative decision-making in decentralized multiple-robot systems: The best-of-N problem. IEEE Transactions on Mechatronics, 14(2), 240–251.

    Article  Google Scholar 

  • Parker, C. A. C., & Zhang, H. (2010). Collective unary decision-making by decentralized multiple-robot systems applied to the task-sequencing problem. Swarm Intelligence, 4(3), 199–220.

    Article  Google Scholar 

  • Pinciroli, C., Trianni, V., O’Grady, R., Pini, G., Brutschy, A., Brambilla, M., et al. (2012). ARGoS: A modular, parallel, multi-engine simulator for multi-robot systems. Swarm Intelligence, 6(4), 271–295.

    Article  Google Scholar 

  • Reina, A., Dorigo, M., & Trianni, V. (2014). Towards a cognitive design pattern for collective decision-making. In M. Dorigo, et al. (Eds.), Proceedings of 9th International Conference on Swarm Intelligence (ANTS) Volume 8667 of LNCS (pp. 194–205). Springer Verlag, Berlin, Germany.

  • Roberts, J. F., Stirling, T. S., Zufferey, J.-C., & Floreano, D. (2009). 2.5d infrared range and bearing system for collective robotics. In IEEE/RSJ International Conference on Intelligent Robots and Systems, 2009. IROS 2009, (pp. 3659–3664). IEEE Press.

  • Sartoretti, G., Hongler, M.-O., de Oliveira, M. E., & Mondada, F. (2014). Decentralized self-selection of swarm trajectories: From dynamical systems theory to robotic implementation. Swarm Intelligence, 8(4), 329–351.

    Article  Google Scholar 

  • Scheidler, A., Brutschy, A., Ferrante, E., & Dorigo, M. (2015). The k-unanimity rule for self-organized decision making in swarms of robots. IEEE Transactions on Cybernetics (in press).

  • Seeley, T. D., Visscher, P. K., Schlegel, T., Hogan, P. M., Franks, N. R., & Marshall, J. A. R. (2012). Stop signals provide cross inhibition in collective decision-making by honeybee swarms. Science, 335(6064), 108–111.

    Article  Google Scholar 

  • Trianni, V., & Dorigo, M. (2006). Self-organisation and communication in groups of simulated and physical robots. Biological Cybernetics, 95(3), 213–231.

    Article  MATH  Google Scholar 

  • Valentini, G., Hamann, H., & Dorigo, M. (2014). Self-organized collective decision making: The weighted voter model. In A. Lomuscio, P. Scerri, A. Bazzan, & M. Huhns (Eds.), Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS ’14, (pp. 45–52). International Foundation for Autonomous Agents and Multiagent Systems.

  • Vicsek, T., & Zafeiris, A. (2012). Collective motion. Physics Reports, 517(3–4), 71–140.

    Article  Google Scholar 

  • Vigelius, M., Meyer, B., & Pascoe, G. (2014). Multiscale modelling and analysis of collective decision making in swarm robotics. PloS One, 9(11), e111542.

    Article  Google Scholar 

  • Wilson, S., Pavlic, T. P., Kumar, G. P., Buffin, A., Pratt, S. C., & Berman, S. (2014). Design of ant-inspired stochastic control policies for collective transport by robotic swarms. Swarm Intelligence, 8(4), 303–327.

    Article  Google Scholar 

Download references

Acknowledgments

This work was partially supported by the European Research Council through the ERC Advanced Grant “E-SWARM: Engineering Swarm Intelligence Systems” (contract 246939). Vito Trianni acknowledges support from the EU-FP7 Project “DICE: Distributed Cognition Engineering” funded by the European Commissions FP7 People Programme under the Marie Curie Career Integration Grant scheme (Project ID: 631297). Marco Dorigo acknowledges support from the Belgian F.R.S.-FNRS. We thank Gabriele Valentini for sharing the code of the Gillespie algorithm used for the study of macroscopic finite-size effects and Carlo Pinciroli for the support in the implementation of the swarm robotics simulations.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Andreagiovanni Reina.

Electronic supplementary material

Appendix

Appendix

1.1 Survival analysis

We estimated the transition rates of the macroscopic model from the multi-agent/swarm robotics simulations through survival analysis. In this appendix, we shortly introduce this methodology and we present the Nelson–Aalen estimator that we employed for our analysis. Finally, we describe how to estimate the transition rates directly from experimental data. We believe that showing the application of this statistical tool for the analysis of a swarm robotics experiment may be of interest to the community.

1.1.1 Survival analysis

Survival analysis is a branch of statistics that offers tools to estimate the change over time of the probability of an event from experimental data. Survival analysis has been initially introduced in medicine to estimate the probability of survival (or death) of an organism under some treatment. Subsequently, these tools generalised to the estimate of any transition probability between populations. Nowadays, survival analysis is employed in several fields, such as economics—e.g. to estimate the probability of a stock market crash—or mechanical engineering—e.g. to estimate the probability of engine failures. In this work, we apply survival analysis to estimate the transition rates of the macroscopic model of collective decision making.

Other works have used this type of analysis to estimate the parameters of multi-agent systems behaviour. Jeanson et al. (2003) use survival analysis to estimate the probability with which cockroaches change their behaviour. Garnier et al. (2008) and Reina et al. (2014) employed survival analysis to compute transition rates of artificial agents behaviour.

1.1.2 Hazard curve

We consider the three populations \(\{A,B,U\}\) in accordance with the agent’s commitment state described in Sect. 2. To compute the rate at which agents switch (transit between) their commitment state, we log the number of timesteps \(t\) interlaying between two commitment switches (transitions) and the relative type of event causing the switch (e.g. discovery or recruitment). At the end of an experiment, we log the timesteps \(t\) from the last commitment switch as censored event, which indicates that after \(t\) timesteps no transition happened. We use the Nelson–Aalen estimator (Nelson 1969) to compute the hazard curve \(H(t)\) from the collected experimental data. The hazard curve \(H(t)\) shows the cumulative probability of events occurring until time \(t\) and is computed as follows:

$$\begin{aligned} H(t) = \sum _{t_i\le t}d_i/n_i, \end{aligned}$$
(8)

where \(d_i\) is the number of events recorded at \(t_i\), and \(n_i\) is the number of events occurring (or censored) at time \(t \ge t_i\). In a memoryless system, the probability of an event does not change over time, therefore the curve of the cumulative probability as function of time corresponds to a line with a slope equal to the constant event rate (i.e. the transition rate). Assuming our system as memoryless, we compute the transition rate by linear fitting the hazard curve with a line passing through the origin. Additionally, the quality of the fitting can be used to verify the correctness of a memoryless implementation.

1.1.3 Rate estimation

The rate of spontaneous transitions, in this study discovery and abandonment, can be directly estimated by computing the slope of the hazard curve, as detailed above. For instance, Fig. 12a shows the hazard curve of the discovery rate computed from multi-agent experiments with target area at distance \(d= 1.5\,\hbox {m}\). Differently, rate estimates of transitions consequent to an interaction—in this work, recruitment and cross-inhibition—include the probability of interaction with an agent of the other population, which we call hereafter the interacting population. This probability changes during the process as the interacting population size changes and must be taken into account to estimate a constant transition rate independently from the interacting population size. Therefore, we first compute one aggregate transition rate for every interacting population size, and then, we normalise the rates for the interacting population fraction. For instance, from Eq. (1), the cross-inhibition rate for the population \(B\) is \((-\sigma _A\varPsi _{A})\), which includes the size of the interacting population \(A\) that delivers the inhibition signal. Through survival analysis, we compute the aggregate rate (\(\sigma _A\varPsi _{A}\)) for varying values of \(\varPsi _{A}\) in the range \(]0,1[\). Then, by linear fitting, we discount from the aggregate rates the interacting population fraction to obtain \(\sigma _A\). Figure 12b shows a set of 50 aggregate rate estimates plotted as function of \(\varPsi _{A}\), the slope of the fitted line corresponds to the estimate of \(\sigma _A\).

Fig. 12
figure 12

a Cumulative discovery probability over time for target area at distance \(d= 1.5\,\hbox {m}\). The slope of the resulting line corresponds to the discovery rate estimate. b Cross-inhibition rate \(\sigma _A\) estimates over population fraction \(\varPsi _A\) for target area distances \(d_A=d_B= 2.5\,\hbox {m}\) and probability \(P_{\sigma }=0.1\)

To estimate the transition rates with constant population sizes, we run ad hoc experiments where the population sizes are fixed. In these experiments, agents follow the normal behaviour and, in case of commitment state transitions, they only log the event but do not change commitment state. In this way, we can quickly gather a large amount of data for every population size and parameterisation.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Reina, A., Miletitch, R., Dorigo, M. et al. A quantitative micro–macro link for collective decisions: the shortest path discovery/selection example. Swarm Intell 9, 75–102 (2015). https://doi.org/10.1007/s11721-015-0105-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11721-015-0105-y

Keywords

Navigation