Active Inferants: An Active Inference Framework for Ant Colony Behavior.
Ontology highlight
ABSTRACT:
SUBMITTER: Friedman DA
PROVIDER: S-EPMC8264549 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Individuals vary within a species in many ecologically important ways, but the causes and consequences of such variation are often poorly understood. Foraging behavior is among the most profitable and risky activities in which organisms engage and is expected to be under strong selection. Among social insects there is evidence that within-colony variation in traits such as foraging behavior can increase colony fitness, but variation between colonies and the potential consequences of such variation are poorly documented. In this study, we tested natural populations of the red imported fire ant, Solenopsis invicta, for the existence of colony and regional variation in foraging behavior and tested the persistence of this variation over time and across foraging habitats. We also reared single-lineage colonies in standardized environments to explore the contribution of colony lineage. Fire ants from natural populations exhibited significant and persistent colony and regional-level variation in foraging behaviors such as extra-nest activity, exploration, and discovery of and recruitment to resources. Moreover, colony-level variation in extra-nest activity was significantly correlated with colony growth, suggesting that this variation has fitness consequences. Lineage of the colony had a significant effect on extra-nest activity and exploratory activity and explained approximately half of the variation observed in foraging behaviors, suggesting a heritable component to colony-level variation in behavior.
| S-EPMC4510567 | biostudies-literature
Project description:RNA sequence design is studied at least as long as the classical folding problem. Although for the latter the functional fold of an RNA molecule is to be found ,: inverse folding tries to identify RNA sequences that fold into a function-specific target structure. In combination with RNA-based biotechnology and synthetic biology ,: reliable RNA sequence design becomes a crucial step to generate novel biochemical components.In this article ,: the computational tool antaRNA is presented. It is capable of compiling RNA sequences for a given structure that comply in addition with an adjustable full range objective GC-content distribution ,: specific sequence constraints and additional fuzzy structure constraints. antaRNA applies ant colony optimization meta-heuristics and its superior performance is shown on a biological datasets.http://www.bioinf.uni-freiburg.de/Software/antaRNA CONTACT: backofen@informatik.uni-freiburg.deSupplementary data are available at Bioinformatics online.
| S-EPMC4576691 | biostudies-literature
Project description:Allocation of goods is a key feature in defining the connection between the individual and the collective scale in any society. Both the process by which goods are to be distributed, and the resulting allocation to the members of the society may affect the success of the population as a whole. One of the most striking natural examples of a highly successful cooperative society is the ant colony which often acts as a single superorganism. In particular, each individual within the ant colony has a "communal stomach" which is used to store and share food with the other colony members by mouth to mouth feeding. Sharing food between communal stomachs allows the colony as a whole to get its food requirements and, more so, allows each individual within the colony to reach its nutritional intake target. The vast majority of colony members do not forage independently but obtain their food through secondary interactions in which food is exchanged between individuals. The global effect of this exchange is not well understood. To gain better understanding into this process we used fluorescence imaging to measure how food from a single external source is distributed and mixed within a Camponotus sanctus ant colony. Using entropic measures to quantify food-blending, we show that while collected food flows into all parts of the colony it mixes only partly. We show that mixing is controlled by the ants' interaction rule which implies that only a fraction of the maximal potential is actually transferred. This rule leads to a robust blending process: i.e., neither the exact food volume that is transferred, nor the interaction schedule are essential to generate the global outcome. Finally, we show how the ants' interaction rules may optimize a trade-off between fast dissemination and efficient mixing. Our results regarding the distribution of a single food source provide a baseline for future studies on distributed regulation of multiple food sources in social insect colonies.
| S-EPMC6681937 | biostudies-literature
Project description:One of the current challenges in bioinformatics is to discover new ways to transform a set of compounds into specific products. The usual approach is finding the reactions to synthesize a particular product, from a given substrate, by means of classical searching algorithms. However, they have three main limitations: difficulty in handling large amounts of reactions and compounds; absence of a step that verifies the availability of substrates; and inability to find branched pathways. We present here a novel bio-inspired algorithm for synthesizing linear and branched metabolic pathways. It allows relating several compounds simultaneously, ensuring the availability of substrates for every reaction in the solution. Comparisons with classical searching algorithms and other recent metaheuristic approaches show clear advantages of this proposal, fully recovering well-known pathways. Furthermore, solutions found can be analyzed in a simple way through graphical representations on the web.
| S-EPMC6219534 | biostudies-literature
Project description:We report all-optical implementation of the optimization algorithm for the famous "ant colony" problem. Ant colonies progressively optimize pathway to food discovered by one of the ants through identifying the discovered route with volatile chemicals (pheromones) secreted on the way back from the food deposit. Mathematically this is an important example of graph optimization problem with dynamically changing parameters. Using an optical network with nonlinear waveguides to represent the graph and a feedback loop, we experimentally show that photons traveling through the network behave like ants that dynamically modify the environment to find the shortest pathway to any chosen point in the graph. This proof-of-principle demonstration illustrates how transient nonlinearity in the optical system can be exploited to tackle complex optimization problems directly, on the hardware level, which may be used for self-routing of optical signals in transparent communication networks and energy flow in photonic systems.
| S-EPMC4879568 | biostudies-literature
Project description:Incomplete or partial observations of network structures pose a serious challenge to theoretical and engineering studies of real networks. To remedy the missing links in real datasets, topology-based link prediction is introduced into the studies of various networks. Due to the complexity of network structures, the accuracy and robustness of most link prediction algorithms are not satisfying enough. In this paper, we propose a quantum-inspired ant colony optimization algorithm that integrates ant colony optimization and quantum computing to predict links in networks. Extensive experiments on both synthetic and real networks show that the accuracy and robustness of the new algorithm is competitive in respect to most of the state of the art algorithms. This result suggests that the application of intelligent optimization to link prediction is promising for boosting its accuracy and robustness.
| S-EPMC6127200 | biostudies-literature
Project description:Labeled data is the main ingredient for classification tasks. Labeled data is not always available and free. Semi-supervised learning solves the problem of labeling the unlabeled instances through heuristics. Self-training is one of the most widely-used comprehensible approaches for labeling data. Traditional self-training approaches tend to show low classification accuracy when the majority of the data is unlabeled. A novel approach named Self-Training using Associative Classification using Ant Colony Optimization (ST-AC-ACO) has been proposed in this article to label and classify the unlabeled data instances to improve self-training classification accuracy by exploiting the association among attribute values (terms) and between a set of terms and class labels of the labeled instances. Ant Colony Optimization (ACO) has been employed to construct associative classification rules based on labeled and pseudo-labeled instances. Experiments demonstrate the superiority of the proposed associative self-training approach to its competing traditional self-training approaches.
| S-EPMC8444075 | biostudies-literature
Project description:A vehicular ad hoc network (VANET) is a wirelessly connected network of vehicular nodes. A number of techniques, such as message ferrying, data aggregation, and vehicular node clustering aim to improve communication efficiency in VANETs. Cluster heads (CHs), selected in the process of clustering, manage inter-cluster and intra-cluster communication. The lifetime of clusters and number of CHs determines the efficiency of network. In this paper a Clustering algorithm based on Ant Colony Optimization (ACO) for VANETs (CACONET) is proposed. CACONET forms optimized clusters for robust communication. CACONET is compared empirically with state-of-the-art baseline techniques like Multi-Objective Particle Swarm Optimization (MOPSO) and Comprehensive Learning Particle Swarm Optimization (CLPSO). Experiments varying the grid size of the network, the transmission range of nodes, and number of nodes in the network were performed to evaluate the comparative effectiveness of these algorithms. For optimized clustering, the parameters considered are the transmission range, direction and speed of the nodes. The results indicate that CACONET significantly outperforms MOPSO and CLPSO.
| S-EPMC4858224 | biostudies-literature
Project description:The mass raids of army ants are an iconic collective phenomenon, in which many thousands of ants spontaneously leave their nest to hunt for food, mostly other arthropods. While the structure and ecology of these raids have been relatively well studied, how army ants evolved such complex cooperative behavior is not understood. Here, we show that army ant mass raiding has evolved from a different form of cooperative hunting called group raiding, in which a scout directs a small group of ants to a specific target through chemical communication. We describe the structure of group raids in the clonal raider ant, a close relative of army ants in the subfamily Dorylinae. We find evidence that the coarse structure of group raids and mass raids is highly conserved and that all doryline ants likely follow similar behavioral rules for raiding. We also find that the evolution of army ant mass raiding occurred concurrently with expansions in colony size. By experimentally increasing colony size in the clonal raider ant, we show that mass raiding gradually emerges from group raiding without altering individual behavioral rules. This suggests that increasing colony size can explain the evolution of army ant mass raids and supports the idea that complex social behaviors may evolve via mechanisms that need not alter the behavioral interaction rules that immediately underlie the collective behavior of interest.
| S-EPMC8179172 | biostudies-literature
Project description:The ant colony algorithm (ACA) is a heuristic algorithm that resolves the optimality problem by simulating an ant's foraging process, which finds the shortest path. The connotation of the ACA is to find the optimal solution. The Proportional Integral Derivative (PID) parameter tuning is an essential tool in the control field and includes three parameters, Kp, Ki, and Kd, to achieve the best control effect. Besides, tuning the PID parameters is closely related to finding the "optimal" solution that can be attained based on the feasible combination of the two. This article transforms the PID parameter tuning problem into an ACA that finds the optimal solution called ACA-based PID parameters tuning. Furthermore, PID control is simulated by setting the parameters of ACA, such as ant colony size, iteration times, nodes, paths, path evaluation criteria, pheromone concentration, heuristic function, weight factor, and decision function. Eventually, the two PID controller parameter tuning strategies are compared and analyzed, and the advantages and disadvantages of each are obtained. Compared with the 4:1 attenuation curve method, the proposed method can significantly reduce the MP score of the overshoot of the system, increase the time, and improve the dynamic and steady-state performance of the system, but reduce the steady-state error of the system. Therefore, the feasibility and effectiveness of the proposed method is verified.
| S-EPMC10703037 | biostudies-literature