Month: March 2024

INFLUENCE OF NETWORK STRUCTURE AND AGENT PROPERTY ON SYSTEM PERFORMANCE

HONGZHONG DENG, JI LI, HONGQIAN WU, and BINGFENG GE

Advances in Complex SystemsVol. 26, No. 07n08, 2350011

System structure can affect or decide the system function. Many pioneers have analyzed the impact of system’s macro-statistical characteristics, such as degree distribution and giant component, on system performance. But only few research works were conducted on the relation of mesoscopic structure and agent property with system task performance. In this paper, we designed a scenario that, in a multiagent system, agents will try their best to form a qualified team to fulfill more system tasks under the requirements from agent property, structure and task. The theoretical and simulation results show that the agent link network, agent properties and task requirement will co-affect the dynamic team formation and at last have serious effects on a system’s task completion ratio and performance. Some factors such as network density and task introduction period have positive influence. Task execution time and team size have negative influence. Some factors show a counter-intuitive influence. The clustering coefficient has not much influence as people expected and the task publicity time isn’t bigger the better. Notably, system performance is affected by the coupling effect, instead of the independent effects of all factors. The effect of system structure on system function conditionally relies on the support from agent ability and task requirement.

Read the full article at: www.worldscientific.com

Evolutionary Robotics: Taking a biologically inspired approach to the design of autonomous, adaptive machines.

Josh C. Bongard

Communications of the ACM

The automated design, construction, and deployment of autonomous and adaptive machines is an open problem. Industrial robots are an example of autonomous yet nonadaptive machines: they execute the same sequence of actions repeatedly. Conversely, unmanned drones are an example of adaptive yet non-autonomous machines: they exhibit the adaptive capabilities of their remote human operators. To date, the only force known to be capable of producing fully autonomous as well as adaptive machines is biological evolution. In the field of evolutionary robotics,9 one class of population-based metaheuristics—evolutionary algorithms—are used to optimize some or all aspects of an autonomous robot. The use of metaheuristics sets this subfield of robotics apart from the mainstream of robotics research, in which machine learning algorithms are used to optimize the control policya of a robot. As in other branches of computer science the use of a metaheuristic algorithm has a cost and a benefit. The cost is that it is not possible to guarantee if (or when) an optimal control policy will be found for a given robot. The benefit is few assumptions must be made about the problem: evolutionary algorithms can improve both the parameters and the architecture of the robot’s control policy, and even the shape of the robot itself.

Read the full article at: cacm.acm.org

Measuring Entanglement in Physical Networks

Cory Glover, Albert-László Barabási
The links of a physical network cannot cross, which often forces the network layout into non-optimal entangled states. Here we define a network fabric as a two-dimensional projection of a network and propose the average crossing number as a measure of network entanglement. We analytically derive the dependence of the crossing number on network density, average link length, degree heterogeneity, and community structure and show that the predictions accurately estimate the entanglement of both network models and of real physical networks.

Read the full article at: arxiv.org

Optimization of nonequilibrium free energy harvesting illustrated on bacteriorhodopsin

Jordi Piñero, Ricard Solé, and Artemy Kolchinsky
Phys. Rev. Research 6, 013275

Harvesting free energy from the environment is essential for the operation of many biological and artificial systems. We use techniques from stochastic thermodynamics to investigate the maximum rate of harvesting achievable by optimizing a set of reactions in a Markovian system, possibly under various kinds of topological, kinetic, and thermodynamic constraints. This question is relevant for the optimal design of new harvesting devices as well as for quantifying the efficiency of existing systems. We first demonstrate that the maximum harvesting rate can be expressed as a constrained convex optimization problem. We illustrate it on bacteriorhodopsin, a light-driven proton pump from Archaea, which we find is close to optimal under realistic conditions. In our second result, we solve the optimization problem in closed-form in three physically meaningful limiting regimes. These closed-form solutions are illustrated on two idealized models of unicyclic harvesting systems.

Read the full article at: link.aps.org

Disentangling the Timescales of a Complex System: A Bayesian Approach to Temporal Network Analysis

Giona Casiraghi, Georges Andres
Changes in the timescales at which complex systems evolve are essential to predicting critical transitions and catastrophic failures. Disentangling the timescales of the dynamics governing complex systems remains a key challenge. With this study, we introduce an integrated Bayesian framework based on temporal network models to address this challenge. We focus on two methodologies: change point detection for identifying shifts in system dynamics, and a spectrum analysis for inferring the distribution of timescales. Applied to synthetic and empirical datasets, these methologies robustly identify critical transitions and comprehensively map the dominant and subsidiaries timescales in complex systems. This dual approach offers a powerful tool for analyzing temporal networks, significantly enhancing our understanding of dynamic behaviors in complex systems.

Read the full article at: arxiv.org