Self-organized Middle-Out Abstraction
In this position paper we present a concept to automatically simplify computational processes in large-scale self-organizing multi-agent simulations. The fundamental idea is that groups of agents that exhibit predictable interaction patterns are temporarily subsumed by higher order agents with behaviours of lower computational costs. In this manner, hierarchies of meta-agents automatically abstract large-scale systems involving agents with in-depth behavioural descriptions, rendering the process of upfront simplification obsolete that is usually necessary in numerical approaches. Abstraction hierarchies are broken down again as soon as they become invalid, so that the loss of valuable process information due to simplification is minimized. We describe the algorithm and the representation, we argue for its general applicability and potential power and we underline the challenges that will need to be overcome.
KeywordsAbstraction multi-agent systems middle-out modelling simulation motif detection confidence estimation
Unable to display preview. Download preview PDF.
- 2.Dorin, A., McCormack, J.: Self-assembling dynamical hierarchies. Artificial Life Eight, 423 (2003)Google Scholar
- 4.Han, J., Dong, G., Yin, Y.: Efficient mining of partial periodic patterns in time series database. In: Proceedings of the International Conference on Data Engineering, Citeseer, pp. 106–115 (1999)Google Scholar
- 5.Johnson, S.: Emergence: The Connected Lives of Ants, Brains, Cities, and Software. Scribner, New York (2001)Google Scholar
- 10.Noble, D.: The music of life. Oxford University Press, Oxford (2006)Google Scholar
- 14.Shirazi, A.S., von Mammen, S., Jacob, C.: Adaptive modularization of the MAPK signaling pathway using the multiagent paradigm. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6239, pp. 401–410. Springer, Heidelberg (2010)Google Scholar