Browsing by Subject "Multi agent systems"

Now showing 1 - 6 of 6

Open Access
An approximate analytical method of analysis of a threshold maintenance policy for a multiphase multicomponent model
(Springer, 2003) Anisimov, V. V.; Gürler, Ü.
A multicomponent system is investigated that consists of n identical unreliable components whose nonfailure operating time consists of a number of sequential phases with exponential times. A maintenance policy is studied that proposes the instant replacement of all the components as soon as the number of components that are in some doubtful state (before a failure) amounts to a predefined threshold value. A cost function averaged over a large period is studied. For a fixed n, an analytical approach is considered. If n increases, a new approximate analytical approach is proposed, which is based on results of the type of the averaging principle for recurrent semi-Markovian processes. The conditions of existence and properties of the optimal strategy are studied. An example is considered and possibilities of generalizations are discussed.
Open Access
Creating crowd variation with the OCEAN personality model
(IFAAMAS, 2008-05) Durupınar, Funda; Allbeck, J.; Pelechano, N.; Badler, N.
Most current crowd simulators animate homogeneous crowds, but include underlying parameters that can be tuned to create variations within the crowd. These parameters, however, are specific to the crowd models and may be difficult for an animator or naive user to use. We propose mapping these parameters to personality traits. In this paper, we extend the HiDAC (High-Density Autonomous Crowds) system by providing each agent with a personality model in order to examine how the emergent behavior of the crowd is affected. We use the OCEAN personality model as a basis for agent psychology. To each personality trait we associate nominal behaviors; thus, specifying personality for an agent leads to an automation of the low-level parameter tuning process. We describe a plausible mapping from personality traits to existing behavior types and analyze the overall emergent crowd behaviors. Copyright © 2008, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved.
Open Access
Foraging swarms as Nash equilibria of dynamic games
(IEEE, 2014) Özgüler, A. B.; Yildiz, A.
The question of whether foraging swarms can form as a result of a noncooperative game played by individuals is shown here to have an affirmative answer. A dynamic game played by N agents in 1-D motion is introduced and models, for instance, a foraging ant colony. Each agent controls its velocity to minimize its total work done in a finite time interval. The game is shown to have a unique Nash equilibrium under two different foraging location specifications, and both equilibria display many features of a foraging swarm behavior observed in biological swarms. Explicit expressions are derived for pairwise distances between individuals of the swarm, swarm size, and swarm center location during foraging.
Open Access
Local pinning of networks of multi-agent systems with transmission and pinning delays
(Institute of Electrical and Electronics Engineers, 2016) Lu, W.; Atay, F. M.
We study the stability of networks of multi-agent systems with local pinning strategies and two types of time delays, namely the transmission delay in the network and the pinning delay of the controllers. Sufficient conditions for stability are derived under specific scenarios by computing or estimating the dominant eigenvalue of the characteristic equation. In addition, controlling the network by pinning a single node is studied. Moreover, perturbation methods are employed to derive conditions in the limit of small and large pinning strengths. Numerical algorithms are proposed to verify stability, and simulation examples are presented to confirm the efficiency of analytic results. ï¿½ 2015 IEEE.
Open Access
On non-cooperative genomic privacy
(Springer, Berlin, Heidelberg, 2015) Humbert, M.; Ayday, Erman; Hubaux J.-P.; Telenti, A.
Over the last few years, the vast progress in genome sequencing has highly increased the availability of genomic data. Today, individuals can obtain their digital genomic sequences at reasonable prices from many online service providers. Individuals can store their data on personal devices, reveal it on public online databases, or share it with third parties. Yet, it has been shown that genomic data is very privacysensitive and highly correlated between relatives. Therefore, individuals’ decisions about how to manage and secure their genomic data are crucial. People of the same family might have very different opinions about (i) how to protect and (ii) whether or not to reveal their genome. We study this tension by using a game-theoretic approach. First, we model the interplay between two purely-selfish family members. We also analyze how the game evolves when relatives behave altruistically. We define closed-form Nash equilibria in different settings. We then extend the game to N players by means of multi-agent influence diagrams that enable us to efficiently compute Nash equilibria. Our results notably demonstrate that altruism does not always lead to a more efficient outcome in genomic-privacy games. They also show that, if the discrepancy between the genome-sharing benefits that players perceive is too high, they will follow opposite sharing strategies, which has a negative impact on the familial utility. © International Financial Cryptography Association 2015.
Open Access
Robust controller design based on reduced order plants
(Taylor & Francis, 2006) Özgüler, A. B.; Gündeş, A. N.
Two dual controller design methods are proposed for linear, time-invariant, multi-input multi-output systems, where designs based on a reduced order plant robustly stabilizer higher order plants with additional poles or zeros in the stable region. The additional poles (or zeros) are considered as multiplicative perturbations of the reduced plant. The methods are tailored towards closed-loop stability and performance and they yield estimates for the stability robustness and performance of the final design. They can be considered as formalizations of two classical heuristic model reduction techniques. One method neglects a plant-pole sufficiently far to the left of dominant poles and the other cancels a sufficiently small stable plant-zero with a pole at the origin.