Search results for "consensus protocol"
showing 8 items of 18 documents
Dealing with uncertainty in consensus protocols
2009
Recent results on consensus protocols for networks are presented. The basic tools and the main contribution available in the literature are considered, together with some of the related challenging aspects: estimation in networks and how to deal with disturbances is considered. Motivated by applications to sensor, peer-to-peer, and ad hoc networks, many papers have considered the problem of estimation in a consensus fashion. Here, the Unknown But Bounded (UBB) noise affecting the network is addressed in details. Because of the presence of UBB disturbances convergence to equilibria with all equal components is, in general, not possible. The solution of the e-consensus problem, where the stat…
Decentralized classification in societies of autonomous and heterogenous robots
2011
This paper addresses the classification problem for a set of autonomous robots that interact with each other. The objective is to classify agents that “behave” in “different way”, due to their own physical dynamics or to the interaction protocol they are obeying to, as belonging to different “species”. This paper describes a technique that allows a decentralized classification system to be built in a systematic way, once the hybrid models describing the behavior of the different species are given. This technique is based on a decentralized identification mechanism, by which every agent classifies its neighbors using only local information. By endowing every agent with such a local classifie…
Distributed Consensus in Networks of Dynamic Agents
2006
Stationary and distributed consensus protocols for a network of n dynamic agents under local information is considered. Consensus must be reached on a group decision value returned by a function of the agents' initial state values. As a main contribution we show that the agents can reach consensus if the value of such a function computed over the agents' state trajectories is time invariant. We use this basic result to introduce a protocol design rule allowing consensus on a quite general set of values. Such a set includes, e.g., any generalized mean of order p of the agents' initial states. We demonstrate that the asymptotical consensus is reached via a Lyapunov approach. Finally we perfor…
LPV model identification for gain scheduling control: An application to rotating stall and surge control problem
2006
Abstract We approach the problem of identifying a nonlinear plant by parameterizing its dynamics as a linear parameter varying (LPV) model. The system under consideration is the Moore–Greitzer model which captures surge and stall phenomena in compressors. The control task is formulated as a problem of output regulation at various set points (stable and unstable) of the system under inputs and states constraints. We assume that inputs, outputs and scheduling parameters are measurable. It is worth pointing out that the adopted technique allows for identification of an LPV model's coefficients without the requirements of slow variations amongst set points. An example of combined identification…
Quantized Dissensus in Networks of Agents subject to Death and Duplication
2012
Dissensus is a modeling framework for networks of dynamic agents in competition for scarce resources. Originally inspired by biological cells behaviors, it fits also marketing, finance and many other application areas. Competition is often unstable in the sense that strong agents, those having access to large resources, gain more and more resources at the expense of weak agents. Thus, strong agents duplicate when reaching a critical amount of resources, whereas weak agents die when loosing all their resources. To capture all these phenomena we introduce systems with a discrete time gossip and unstable state dynamics interrupted by discrete events affecting the network topology. Invariancy o…
Lazy consensus for networks with unknown but bounded disturbances
2007
We consider stationary consensus protocols for networks of dynamic agents. The measure of the neighbors' state is affected by Unknown But Bounded disturbances. Here the main contribution is the formulation and solution of what we call the isin-consensus problem, where the states are required to converge in a tube of ray isin asymptotically or in finite time.
Consensus in Noncooperative Dynamic Games: a Multi-Retailer Inventory Application
2008
We focus on Nash equilibria and Pareto optimal Nash equilibria for a finite horizon noncooperative dynamic game with a special structure of the stage cost. We study the existence of these solutions by proving that the game is a potential game. For the single-stage version of the game, we characterize the aforementioned solutions and derive a consensus protocol that makes the players converge to the unique Pareto optimal Nash equilibrium. Such an equilibrium guarantees the interests of the players and is also social optimal in the set of Nash equilibria. For the multistage version of the game, we present an algorithm that converges to Nash equilibria, unfortunately, not necessarily Pareto op…