854 research outputs found
Differential Inequalities in Multi-Agent Coordination and Opinion Dynamics Modeling
Distributed algorithms of multi-agent coordination have attracted substantial
attention from the research community; the simplest and most thoroughly studied
of them are consensus protocols in the form of differential or difference
equations over general time-varying weighted graphs. These graphs are usually
characterized algebraically by their associated Laplacian matrices. Network
algorithms with similar algebraic graph theoretic structures, called being of
Laplacian-type in this paper, also arise in other related multi-agent control
problems, such as aggregation and containment control, target surrounding,
distributed optimization and modeling of opinion evolution in social groups. In
spite of their similarities, each of such algorithms has often been studied
using separate mathematical techniques. In this paper, a novel approach is
offered, allowing a unified and elegant way to examine many Laplacian-type
algorithms for multi-agent coordination. This approach is based on the analysis
of some differential or difference inequalities that have to be satisfied by
the some "outputs" of the agents (e.g. the distances to the desired set in
aggregation problems). Although such inequalities may have many unbounded
solutions, under natural graphic connectivity conditions all their bounded
solutions converge (and even reach consensus), entailing the convergence of the
corresponding distributed algorithms. In the theory of differential equations
the absence of bounded non-convergent solutions is referred to as the
equation's dichotomy. In this paper, we establish the dichotomy criteria of
Laplacian-type differential and difference inequalities and show that these
criteria enable one to extend a number of recent results, concerned with
Laplacian-type algorithms for multi-agent coordination and modeling opinion
formation in social groups.Comment: accepted to Automatic
Recurrent Averaging Inequalities in Multi-Agent Control and Social Dynamics Modeling
Many multi-agent control algorithms and dynamic agent-based models arising in
natural and social sciences are based on the principle of iterative averaging.
Each agent is associated to a value of interest, which may represent, for
instance, the opinion of an individual in a social group, the velocity vector
of a mobile robot in a flock, or the measurement of a sensor within a sensor
network. This value is updated, at each iteration, to a weighted average of
itself and of the values of the adjacent agents. It is well known that, under
natural assumptions on the network's graph connectivity, this local averaging
procedure eventually leads to global consensus, or synchronization of the
values at all nodes. Applications of iterative averaging include, but are not
limited to, algorithms for distributed optimization, for solution of linear and
nonlinear equations, for multi-robot coordination and for opinion formation in
social groups. Although these algorithms have similar structures, the
mathematical techniques used for their analysis are diverse, and conditions for
their convergence and differ from case to case. In this paper, we review many
of these algorithms and we show that their properties can be analyzed in a
unified way by using a novel tool based on recurrent averaging inequalities
(RAIs). We develop a theory of RAIs and apply it to the analysis of several
important multi-agent algorithms recently proposed in the literature
Recurrent averaging inequalities in multi-agent control and social dynamics modeling
Many multi-agent control algorithms and dynamic agent-based models arising in
natural and social sciences are based on the principle of iterative averaging.
Each agent is associated to a value of interest, which may represent, for
instance, the opinion of an individual in a social group, the velocity vector
of a mobile robot in a flock, or the measurement of a sensor within a sensor
network. This value is updated, at each iteration, to a weighted average of
itself and of the values of the adjacent agents. It is well known that, under
natural assumptions on the network's graph connectivity, this local averaging
procedure eventually leads to global consensus, or synchronization of the
values at all nodes. Applications of iterative averaging include, but are not
limited to, algorithms for distributed optimization, for solution of linear and
nonlinear equations, for multi-robot coordination and for opinion formation in
social groups. Although these algorithms have similar structures, the
mathematical techniques used for their analysis are diverse, and conditions for
their convergence and differ from case to case. In this paper, we review many
of these algorithms and we show that their properties can be analyzed in a
unified way by using a novel tool based on recurrent averaging inequalities
(RAIs). We develop a theory of RAIs and apply it to the analysis of several
important multi-agent algorithms recently proposed in the literature
Dynamic Social Balance and Convergent Appraisals via Homophily and Influence Mechanisms
Social balance theory describes allowable and forbidden configurations of the
topologies of signed directed social appraisal networks. In this paper, we
propose two discrete-time dynamical systems that explain how an appraisal
network \textcolor{blue}{converges to} social balance from an initially
unbalanced configuration. These two models are based on two different
socio-psychological mechanisms respectively: the homophily mechanism and the
influence mechanism. Our main theoretical contribution is a comprehensive
analysis for both models in three steps. First, we establish the well-posedness
and bounded evolution of the interpersonal appraisals. Second, we fully
characterize the set of equilibrium points; for both models, each equilibrium
network is composed by an arbitrary number of complete subgraphs satisfying
structural balance. Third, we establish the equivalence among three distinct
properties: non-vanishing appraisals, convergence to all-to-all appraisal
networks, and finite-time achievement of social balance. In addition to
theoretical analysis, Monte Carlo validations illustrates how the non-vanishing
appraisal condition holds for generic initial conditions in both models.
Moreover, numerical comparison between the two models indicate that the
homophily-based model might be a more universal explanation for the formation
of social balance. Finally, adopting the homophily-based model, we present
numerical results on the mediation and globalization of local conflicts, the
competition for allies, and the asymptotic formation of a single versus two
factions
- …