Leader-follower multi-agent flocking with bounded missing data and random communication radius

2018 ◽  
Vol 41 (9) ◽  
pp. 2441-2450
Author(s):  
Xiaowu Mu ◽  
Yuehua He
Keyword(s):  
Numerical Simulation ◽  
Communication Network ◽  
Missing Data ◽  
Lower Bound ◽  
Multi Agent ◽  
Communication Radius ◽  
Independent And Identically Distributed

In this paper, the leader-follower Cucker–Smale flocking system with bounded missing data and random communication radius is studied. The communication network is determined by the stochastic distance radii between agents. The process by which data are lost in the communication network is independent and identically distributed. The goal of this paper is to determine a lower bound on the probability that the agents asymptotically achieve a flocking behaviour, i.e. the relative velocities between the leader agent and other agents asymptotically vanish and the relative positions converge. Finally, a numerical simulation example is provided to illustrate the obtained results.

Consensus of Multi-Agent Systems with Control-Affine Nonlinear Dynamics

2016 ◽  
Vol 04 (01) ◽  
pp. 61-73 ◽  
Author(s):  
Haiyun Hu ◽  
Se Young Yoon ◽  
Zongli Lin
Keyword(s):  
Nonlinear Dynamics ◽  
Numerical Simulation ◽  
Communication Network ◽  
Distributed Control ◽  
Consensus Problem ◽  
Communication Delays ◽  
Multi Agent Systems ◽  
Control Laws ◽  
Agent Systems ◽  
Multi Agent

This paper studies the consensus problem for a class of multi-agent systems, where each agent is a nonlinear system affine in control. Distributed control laws are proposed for multi-agent systems with and without communication delays, respectively. It is shown that under undirected and connected communication network our control laws ensure the state consensus of multi-agent systems in both cases. The effectiveness of the proposed control laws is demonstrated by numerical simulation.

scholarly journals Diffusion Estimation Over Cooperative Multi-Agent Networks With Missing Data

2016 ◽  
Vol 2 (3) ◽  
pp. 276-289 ◽  
Author(s):  
Mohammad Reza Gholami ◽  
Magnus Jansson ◽  
Erik G. Strom ◽  
Ali H. Sayed
Keyword(s):  
Missing Data ◽  
Multi Agent ◽  
Agent Networks

Multi-Agent–Based Simulation of University Email Communities

2011 ◽  
pp. 273-291
Author(s):  
David Rodrigues
Keyword(s):  
Communication Network ◽  
Network Formation ◽  
Real Data ◽  
Informal Communication ◽  
University Environment ◽  
Agent Based ◽  
Detection Techniques ◽  
The Social ◽  
Multi Agent ◽  
Full Knowledge

In this chapter, a study on informal communication network formation in a university environment is presented. The teacher communication network is analyzed through community detection techniques. It is evident that informal communication is an important process that traverses the vertical hierarchical structure of departments and courses in a university environment. A multi-agent model of the case study is presented here, showing the implications of using real data as training sets for multi-agent-based simulations. The influence of the “social neighborhood,” as a mechanism to create assortative networks of contacts without full knowledge of the network, is discussed. It is shown that the radius of this social neighborhood has an effect on the outcome of the network structure and that in a university’s case this distance is relatively small.

scholarly journals A scalable algorithm for the decomposition of minimally rigid graph

2020 ◽  
Vol 53 (5-6) ◽  
pp. 807-813
Author(s):  
Yadong Zhu ◽  
Qin Wang ◽  
Shengquan Li ◽  
Yuequan Yang
Keyword(s):  
Numerical Simulation ◽  
Equilibrium Problem ◽  
Spanning Tree ◽  
Formation Control ◽  
Function Method ◽  
Scalable Algorithm ◽  
Navigation Function ◽  
Multi Agent

The rigid graph needs to be decomposed to solve the multi-equilibrium problem of the multi-agent formation control based on navigation function method. In this paper, a theorem and a scalable algorithm based on the Henneberg sequence of graphs are proposed for the decomposition of minimally rigid graph. The theorem demonstrates that if graph G( V, E) is a minimally rigid graph, then it can be decomposed as G = Gt[Formula: see text] Gc, where G t is a spanning tree of G and G c contains the remaining edges and their vertices. Moreover, the scalable algorithm is given to construct G t = ( V t, E t) and G c = ( V c, E c), and assign the edges in E c to n -- 2 distinct vertices in a scalable way via communication. Furthermore, a lemma is given to show when the number of vertices is less than eight, any edge can be chosen as the initialized edge, and the scalable algorithm mentioned above is always feasible. Finally, the effectiveness of the scalable algorithm is verified by numerical simulation.

A LOWER BOUND FOR ORDER-PRESERVING BROADCAST IN THE POSTAL MODEL

1993 ◽  
Vol 03 (04) ◽  
pp. 313-320 ◽  
Author(s):  
PHILIP D. MACKENZIE
Keyword(s):  
Communication Network ◽  
Lower Bound ◽  
Lower Bounds ◽  
Message Passing ◽  
Upper Bounds ◽  
Communication Latency ◽  
Multiple Messages ◽  
Postal Model ◽  
Parameter Ranges

In the postal model of message passing systems, the actual communication network between processors is abstracted by a single communication latency factor, which measures the inverse ratio of the time it takes for a processor to send a message and the time that passes until the recipient receives the message. In this paper we examine the problem of broadcasting multiple messages in an order-preserving fashion in the postal model. We prove lower bounds for all parameter ranges and show that these lower bounds are within a factor of seven of the best upper bounds. In some cases, our lower bounds show significant asymptotic improvements over the previous best lower bounds.

scholarly journals Performance Analysis of SNR-Based HDAF M2M Cooperative Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-7
Author(s):  
Lingwei Xu ◽  
Hao Zhang ◽  
T. Aaron Gulliver
Keyword(s):  
Numerical Simulation ◽  
Performance Analysis ◽  
Lower Bound ◽  
Outage Probability ◽  
Power Allocation ◽  
Fading Channels ◽  
Cooperative Networks ◽  
Nakagami Fading ◽  
Nakagami Fading Channels

The lower bound on outage probability (OP) of mobile-to-mobile (M2M) cooperative networks overN-Nakagami fading channels is derived for SNR-based hybrid decode-amplify-forward (HDAF) relaying. The OP performance under different conditions is evaluated through numerical simulation to verify the accuracy of the analysis. These results show that the fading coefficient, number of cascaded components, relative geometric gain, and power-allocation are important parameters that influence this performance.

Sign in / Sign up

Export Citation Format

Share Document