Document - Fluid Analysis of Foraging Ants

2012

Conference article Open Access

Fluid Analysis of Foraging Ants

Massink M., Latella D.

[ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI] collective dynamics process algebra emergence Fluid flow [ INFO ] Computer Science [cs] self-organisation

Workers of the Argentine ant, Iridomyrmex humilis, are known to be capable to find efficiently the shortest route from their nest to a food source. Their approach is based on a simple pheromone trail-laying and following behaviour accessing only local information. In this note we explore the modelling and analysis of foraging ants in Bio-PEPA [8,6]. The simple case study concerns ants that need to cross a bridge with two branches of different length to reach food and carry the food home and is based on empirical data described by Goss and Deneubourg et al. We explore the conditions for which the shortest path emerges as the preferred one by the ants. The analysis is based on stochastic simulation and fluid flow analysis. The behaviour of ant colonies has inspired the development of an interesting class of optimisation algorithms ranging from alternative shortest path algorithms to new scheduling and routing algorithms, algorithms to solve set partition problems and for distributed information retrieval. Process algebraic fluid flow analysis may be an important additional technique to the analysis of such algorithms in a computationally efficient way.

Source: 14th International Conference on Coordination Models and Languages, COORDINATION 2012, pp. 152–165, Stockholm, 14-15/06/2012

Publisher: Springer-Verlag Berlin, Berlin, DEU

Citations

Ascens Project: http://www.ascens-ist.eu/
Bortolussi, L.: Stochastic concurrent constraint programming. In: Proceedings of the 4th International Workshop on Quantitative Aspects of Programming Languages (QAPL 2006). vol. 164-3. ENTCS (2006)
Bortolussi, L., Policriti, A.: Modeling biological systems in concurrent constraint programming. Constraints 13(1-2), 66{90 (2008)
Bortolussi, L., Policriti, A.: Dynamical systems and stochastic programming | from ordinary di erential equations and back. Transactions of Computational Systems Biology XI, 216{267 (2009)
Ciocchetta, F., Duguid, A., Gilmore, S., Guerriero, M.L., J., H.: The Bio-PEPA Tool Suite. In: Proc. of the 6th Int. Conf. on Quantitative Evaluation of SysTems (QEST 2009). pp. 309{310 (2009)
Ciocchetta, F., Guerriero, M.L.: Modelling biological compartments in Bio-PEPA. ENTCS 227, 77{95 (2009)
Ciocchetta, F., Hillston, J.: Bio-PEPA: An extension of the process algebra PEPA for biochemical networks. ENTCS 194(3), 103{117 (2008)
Ciocchetta, F., Hillston, J.: Bio-PEPA: A framework for the modelling and analysis of biological systems. TCS 410(33-34), 3065{3084 (2009)
De Nicola, R., Katoen, J., Latella, D., Loreti, M.: StoKLAIM: A stochastic extension of KLAIM (2006), CNR-ISTI Technical Report number ISTI-2006-TR-01
Deneubourg, J.L., Aron, S., Goss, S., Pasteels, J.M.: The self-organizing exploratory pattern of the argentine ant. Journal of Insects Behaviour 3(2) (1990)
Dorigo, M., Stutzle, T.: Ant Colony Optimization. The MIT Press (2004)
Gillepie, D.T.: Exact stochastic simulation of coupled chemical reactions. The Journal of Physical Chemistry 81(25), 2340{2361 (1977)
Goss, S., Aron, S., Deneubourg, J.L., Pasteels, J.M.: Self-organized shortcuts in the Argentine Ant. Naturwissenschaften 76, 579{581 (1989)
Hillston, J.: Fluid ow approximation of PEPA models. In: Proceedings of QEST'05. pp. 33{43. IEEE Computer Society (2005)
Kurtz, T.G.: Solutions of ordinary di erential equations as limits of pure Markov processes. Journal of Applied Probability 7(1), 49{58 (1970)
Kwiatkowska, M., Norman, G., Parker, D.: PRISM: Probabilistic model checking for performance and reliability analysis. ACM SIGMETRICS Performance Evaluation Review (2009)
Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: Veri cation of probabilistic real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) Proc. 23rd International Conference on Computer Aided Veri cation (CAV'11). LNCS, vol. 6806, pp. 585{591. Springer (2011)
Milner, R.: Calculi for synchrony and asynchrony. Theoretical Computer Science 25(3), 267{310 (1983)
Sumpter, D.J.T., Blanchard, G.B., Broomhead, D.S.: Ants and agents: a process algebra approach to modelling ant colony behaviour. Bulletin of Mathematical Biology 63, 951{980 (2001), doi: 10.1006/bulm.2001.0252
Tofts, C.: The autosynchronisation of leptothorax acervorem (fabricius) described in WSCCS. Tech. Rep. ECS-LFCS-90-128, LFCS, University of Edinburgh (1990)

Metrics

Back to previous page

Cite as

BibTeX entry

@inproceedings{oai:it.cnr:prodotti:187491,
	title = {Fluid Analysis of Foraging Ants},
	author = {Massink M. and Latella D.},
	publisher = {Springer-Verlag Berlin, Berlin, DEU},
	doi = {10.1007/978-3-642-30829-1_11},
	booktitle = {14th International Conference on Coordination Models and Languages, COORDINATION 2012, pp. 152–165, Stockholm, 14-15/06/2012},
	year = {2012}
}