multi-yb亚博全站首页

we explore how interacting micro-mechanism with simple behavior lead to macro collective behavior in multi-agent system. we analyze the micro-interaction mechanism of multi-agent, from the perspective of macro collective behavior. we study the multi-agent system with learning function. we explore the symmetry breaking process of how homogeneous individual evolve into heterogeneous individual. we study the mutual trust mechanism and reputation mechanism of agent. we also study complexity of evolutionary algorithm.

micro-mechanism of collective behavior

cooperation behavior, widely existing in real system, is a typical manifestation of collective emergence behavior. we build evolutionary model with cooperation and specialization of agents, put forward the descriptive index and evolution rules of agents, and also conclude a symmetry breaking micro-mechanism with division of labor. at the same time, we study the evolutionary model with competitive cooperation, describe the measurement index and evolution rules of the competition and cooperation among agents, and conduct model simulation based on agent. we focus on the relation between information share level and macro collective behavior (formation of cooperation).

complex adaptive system

a distinct manifestation of multi-agent system’s adaptability is to build trust and reputation. at the same time, the trust mechanism and reputation mechanism of agent group is also a major research area of p2p system. we study the trust mechanism and reputation mechanism of overall distributed multi-system. we introduce the approach of overall environmental information into p2p system to study the characteristic of non-scaling distribution of overall information. and it has been discovered that the mechanism that considers overall system information is better in quality than the original ones and also better meet real system’s demand on trust mechanism and reputation mechanism.  

evolutionary algorithm

evolutionary algorithm is a bionics algorithm that mimics natural genetic evolutionary laws. it can deal with the overall searching and optimization problem. it is also an important approach to study phylogeny. our focus is to study the algorithm complexity of evolutionary algorithm. the study on the convergence complexity of existing evolutionary algorithm all use expected first passage time. as an average quantity, expected first passage time actually misses much information about the distribution of convergence time. therefore, we introduce a concept that approximate to convergence in sense of probability, which could provide the whole time distribution. we use it, as a supplement of expected first passage time, to solve evolutionary algorithm problems that can apply hierarchical computation.