Bring it on, Complexity! Present and future of self-organising middle-out abstraction

ion is not only the essence of model building in the first place but it is also the key to expressive and efficiently solvable models. We postulate that a model should be as detailed and as comprehensive as possible, while its (numeric) utilisation for the purpose of rather specific predictions or simulations should automatically lead to model simplifications and abstractions. Whenever possible, this should happen without jeopardising the model validity; whenever necessary, the loss of accuracy the abstractions cause should be made transparent. SOMO pursues this endeavour by building and maintaining hierarchies of abstractions learned from observation. The higher the level of hierarchy, the fewer interactions have to be tested. Such tests are typically intertwined with expensive condition queries—only the state changes of the simulation will be performed to drive its evolution. Similar shortcuts by means of hierarchical organisation have been conceptualised and implemented in numerous other contexts. For instance, different levels of detail (LOD) of computer graphics resources such as meshes (differing in the numbers of vertices) and textures (differing in the numbers of pixels) are typically organised in hierarchies to allow for fast access to the most commonly used assets, whereas the graphics scenes themselves are often subjected to spatial partitioning hierarchies that allow algorithms to quickly determine which graphics objects need to be rendered in a given view port [Möller et al. (2008)]. There is a significant overlap between these culling techniques and mechanisms to speed-up the detection of collisions between geometric objects, one of the foundational functionalities of physics engines—both rely on the quick discovery of objects at specific locations. In general, the locations of the geometries may change, which is why the spatial partitioning hierarchies are dynamically created and adjusted. Dynamic adjustments of the bounding volume hierarchies are also required if the geometries themselves are dynamic, for instance if they change their scale. In this case, a method has been shown to yield rather good results that updates the upper half of the hierarchy bottom-up if one of the geometries changes. The lower half February 11, 2015 13:20 World Scientific Book 9in x 6in SOMO-bookchapter S. von Mammen & J.-Ph. Steghöfer — Present and future of SOMO abstraction 5 is only updated selectively in a top-down fashion, as soon as the changed geometry is accessed [Larsson and Akenine-Möller (2001)]. Hierarchical optimisations have also been deployed in the field of artificial intelligence. For example, costly automated planning routines can be pruned early, if high levels of a hierarchy reflect the adherence of a plan’s most critical variables [Sacerdoti (1974)]. Similarly, reflective agents need to plan their coordination—hierarchical abstractions of their interaction partners may increase their decision performance, too [Durfee (1999)]. 1.4 Emergence and Hierarchies in a Natural System In Rasmussen et al. (2001), an approach, or “Ansatz”, to capturing the emergence of physicochemical compound objects with according emergent properties is described. We want to use their example to illustrate the mechanics of SOMO. In their experiments, attracting, repelling, and bonding forces among charged monomers and water molecules are shown to result in higher-order polymer and micelle formations—at each level, the resulting compounds obtain novel physical and chemical properties. In the model, hydrophobic monomers bind to hydrophilic monomers as well as to polymerised hydrophobic monomers, which results in 2-order amphiphilic polymers which, in turn, aggregate in 3-order micelle structures. At each stage, the resultant compounds exhibit properties different from the underlying constituents; The aggregating nature of the process yields compounds of greater size but it also leads to varying qualitative, geometric structures and differentiated physiochemical behaviours. An adapted illustration of the emergent process is shown in Figure 1.1.

[1]  Qing Zhao,et al.  Distributed Learning in Wireless Sensor Networks , 2007 .

[2]  Tomas Akenine-Möller,et al.  Collision Detection for Continuously Deforming Bodies , 2001, Eurographics.

[3]  Jonathan D. Cryer,et al.  Time Series Analysis , 1986 .

[4]  W. Oechel,et al.  Automatic design and manufacture of robotic lifeforms , 2022 .

[5]  Christian Jacob,et al.  Hierarchical self-organized learning in agent-based modeling of the MAPK signaling pathway , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

[6]  C. Emmeche,et al.  On emergence and explanation , 1997 .

[7]  Michele Amoretti,et al.  Simulation Modelling Practice and Theory , 2015 .

[8]  Sarvapali D. Ramchurn,et al.  DEVISING A TRUST MODEL FOR MULTI-AGENT INTERACTIONS USING CONFIDENCE AND REPUTATION , 2004, Appl. Artif. Intell..

[9]  Tomas Akenine-Möller,et al.  Real-time rendering , 1997 .

[10]  Mark F. Horstemeyer,et al.  Multiscale Modeling: A Review , 2009 .

[11]  Christian Jacob,et al.  Adaptive Modularization of the MAPK Signaling Pathway Using the Multiagent Paradigm , 2010, PPSN.

[12]  Martin Nilsson,et al.  Ansatz for Dynamical Hierarchies , 2002, Artificial Life.

[13]  Jörg Denzinger,et al.  Combining Coaching and Learning to Create Cooperative Character Behavior , 2005, CIG.

[14]  S. V. Mammen,et al.  Self-Organized Learning of Collective Behaviours in Agent-Based Simulations , 2022 .

[15]  Wolfgang Reif,et al.  HiSPADA: Self-Organising Hierarchies for Large-Scale Multi-Agent Systems , 2013, ICAS 2013.

[16]  Stewart W. Wilson Classifier Fitness Based on Accuracy , 1995, Evolutionary Computation.

[17]  Jiawei Han,et al.  Efficient mining of partial periodic patterns in time series database , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[18]  Vladimir Sarpe,et al.  Optimization of Swarm-Based Simulations , 2012 .

[19]  Timothy Davison,et al.  Adaptive agent abstractions to speed up spatial agent-based simulations , 2014, Simul. Model. Pract. Theory.

[20]  Theo Ungerer,et al.  Confidence as a Means to Assess the Accuracy of Trust Values , 2012, 2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications.

[21]  Armin Fuchs,et al.  Nonlinear Dynamics in Complex Systems: Theory and Applications for the Life-, Neuro- and Natural Sciences , 2012 .

[22]  Qiang Wang,et al.  Time series analysis with multiple resolutions , 2010, Inf. Syst..

[23]  Patrick Th. Eugster,et al.  The "art" of programming gossip-based systems , 2007, OPSR.

[24]  Eamonn J. Keogh,et al.  Probabilistic discovery of time series motifs , 2003, KDD '03.

[25]  Ariel D. Procaccia,et al.  Gossip-based aggregation of trust in decentralized reputation systems , 2007, Autonomous Agents and Multi-Agent Systems.

[26]  Wolfgang Weiss,et al.  A Computational Systems Biology Software Platform for Multiscale Modeling and Simulation: Integrating Whole-Body Physiology, Disease Biology, and Molecular Reaction Networks , 2011, Front. Physio..

[27]  Earl D. Sacerdoti,et al.  Planning in a Hierarchy of Abstraction Spaces , 1974, IJCAI.

[28]  Wolfgang Banzhaf,et al.  Artificial ChemistriesA Review , 2001, Artificial Life.

[29]  Jörg Hähner,et al.  Organic Traffic Control , 2011, Organic Computing.

[30]  Thomas A Louis,et al.  Effective communication of standard errors and confidence intervals. , 2008, Biostatistics.

[31]  Hod Lipson,et al.  Actively probing and modeling users in interactive coevolution , 2006, GECCO.

[32]  Christian Jacob,et al.  Abstraction of agent interaction processes: Towards large-scale multi-agent models , 2013, Simul..

[33]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[34]  J. Kiefer Conditional Confidence Statements and Confidence Estimators , 1977 .