Design of distributed ℋ∞-optimized controllers considering stochastic communication link failures

2015 ◽  
Author(s):  
Martin Jilg ◽  
Jens Tonne ◽  
Olaf Stursberg
Keyword(s):  
Communication Link ◽  
Link Failures

Flocking Control under Virtual Leader-Follower with Link Failure

2012 ◽  
Vol 591-593 ◽  
pp. 1617-1620
Author(s):  
Wen Kai Wang ◽  
Huan Xin Peng
Keyword(s):  
Time Delay ◽  
Communication Link ◽  
Link Failure ◽  
Network Congestion ◽  
Link Failures ◽  
Virtual Leader ◽  
The Impact ◽  
Multi Agents

For time-delay, noise and network congestion in the communication among agents, there are random communication link failures among agents. In the paper, we analyze the distributed flocking algorithms under virtual leader-follower model with random communication link failures. Under virtual leader-follower model, flocking algorithm can avoid diverging, but the performance of flocking algorithm with link failure often degrades. We analyze the impact brought by link failures on the flocking algorithm when part agents can’t receive the information of the virtual leader, and simulations are done. Results show that the performance of distributed flocking algorithm depends on the probability of link failure. Smaller is the probability of link failures among multi-agents, better is the performance of flocking algorithms with link failure.

Robust Event-Triggered Dynamic Average Consensus Against Communication Link Failures With Application to Battery Control

2020 ◽  
Vol 7 (3) ◽  
pp. 1559-1570
Author(s):  
Lantao Xing ◽  
Qianwen Xu ◽  
Changyun Wen ◽  
Yu-Chu Tian ◽  
Yateendra Mishra ◽  
...  
Keyword(s):  
Communication Link ◽  
Link Failures ◽  
Average Consensus ◽  
Event Triggered

Pseudo Two-Hop Distributed Consensus Algorithm with Link Failure

2012 ◽  
Vol 591-593 ◽  
pp. 1575-1578
Author(s):  
Huan Xin Peng ◽  
Wen Kai Wang
Keyword(s):  
Time Delay ◽  
Consensus Algorithm ◽  
Communication Link ◽  
Link Failure ◽  
Network Congestion ◽  
Distributed Consensus ◽  
Link Failures ◽  
Convergence Performance ◽  
Simulation Results ◽  
Independent Identically Distributed

For time-delay, noise and network congestion in the communication among agents, there are often random communication link failures among agents. In this paper, we analyze the pseudo two-hop distributed consensus algorithm with link failures, and research the relation between convergence performance and the probability of link failures. Supposing that the probability of link failures in every link is independent identically distributed, we analyze the convergence performance of the pseudo two-hop distributed consensus algorithm with link failures, and simulation results are provided to verify these analytical results.

On Number of Planes of Rearrangeably Nonblocking Optical Banyan Networks with Link Failures

2008 ◽  
Vol 1 (1) ◽  
pp. 43-54
Author(s):  
Basra Sultana ◽  
Mamun-ur-Rashid Khandker
Keyword(s):  
Optical Switching ◽  
Blocking Probability ◽  
Link Failure ◽  
Link Failures ◽  
Small Depth ◽  
Internal Link ◽  
Banyan Network ◽  
Minimum Number ◽  
Switch Design ◽  
Banyan Networks

Vertically stacked optical banyan (VSOB) networks are attractive for serving as optical switching systems due to the desirable properties (such as the small depth and self-routing capability) of banyan network structures. Although banyan-type networks result in severe blocking and crosstalk, both these problems can be minimized by using sufficient number of banyan planes in the VSOB network structure. The number of banyan planes is minimum for rearrangeably nonblocking and maximum for strictly nonblocking structure. Both results are available for VSOB networks when there exist no internal link-failures. Since the issue of link-failure is unavoidable, we intend to find the minimum number of planes required to make a VSOB network nonblocking when some links are broken or failed in the structure. This paper presents the approximate number of planes required to make a VSOB networks rearrangeably nonblocking allowing link-failures. We also show an interesting behavior of the  blocking  probability of a faulty VSOB networks that the blocking probability may not  always  increase monotonously with  the  increase  of  link-failures; blocking probability  decreases  for  certain range of  link-failures, and then increases again. We believe that such fluctuating behavior of blocking probability with the increase of link failure probability deserves special attention in switch design.  Keywords: Banyan networks; Blocking probability; Switching networks; Vertical stacking; Link-failures. © 2009 JSR Publications. ISSN: 2070-0237(Print); 2070-0245 (Online). All rights reserved. DOI: 10.3329/jsr.v1i1.1070

Sign in / Sign up

Export Citation Format

Share Document