Speeding Up Velocity Consensus Control with Small World Communication Topology for Unmanned Aerial Vehicle Swarms

Xiang, Ji; Zhang, Wanpeng; Chen, Shaofei; Luo, Junren; Liu, Lu; Yuan, Weilin; Hu, Zhenzhen; Chen, Jing

doi:10.3390/electronics10202547

Cited by 6 publications

(3 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The consensus problem is a multi-disciplinary scientific field addressing how to achieve general agreement on some fact among the entities of a given community/group with different attitudes towards this fact [26]. As shown in the literature [27][28][29][30][31][32], the term consensus is applicable in various areas, e.g., cryptocurrencies, economics, bioinformatics, control of unmanned aerial vehicles (UAVs), load balancing, clock synchronization, etc. In Figure 3, we show an example of a group of eight children with and without a consensus on their opinions.…”

Section: Distributed Consensus-based Data Aggregationmentioning

confidence: 99%

Distributed Average Consensus Algorithms in d-Regular Bipartite Graphs: Comparative Study

Kenyeres

2023

Future Internet

View full text Add to dashboard Cite

Consensus-based data aggregation in d-regular bipartite graphs poses a challenging task for the scientific community since some of these algorithms diverge in this critical graph topology. Nevertheless, one can see a lack of scientific studies dealing with this topic in the literature. Motivated by our recent research concerned with this issue, we provide a comparative study of frequently applied consensus algorithms for distributed averaging in d-regular bipartite graphs in this paper. More specifically, we examine the performance of these algorithms with bounded execution in this topology in order to identify which algorithm can achieve the consensus despite no reconfiguration and find the best-performing algorithm in these graphs. In the experimental part, we apply the number of iterations required for consensus to evaluate the performance of the algorithms in randomly generated regular bipartite graphs with various connectivities and for three configurations of the applied stopping criterion, allowing us to identify the optimal distributed consensus algorithm for this graph topology. Moreover, the obtained experimental results presented in this paper are compared to other scientific manuscripts where the analyzed algorithms are examined in non-regular non-bipartite topologies.

show abstract

Section: Distributed Consensus-based Data Aggregationmentioning

confidence: 99%

Distributed Average Consensus Algorithms in d-Regular Bipartite Graphs: Comparative Study

Kenyeres

2023

Future Internet

View full text Add to dashboard Cite

show abstract

“…The traditional CA model adopts the AS strategy, i.e., the state of agent is determined by the states of all its neighboring agents. This makes the system more computationallyconsumed and difficult to converge, while using the NS strategy can increase the convergence speed of the system and improve the stability of the system [16,17]. In the NS strategy, neighboring agents are divided into several communication sectors.…”

Section: The Ns-as Strategymentioning

confidence: 99%

Distributed Cooperative Jamming with Neighborhood Selection Strategy for Unmanned Aerial Vehicle Swarms

et al. 2022

View full text Add to dashboard Cite

In system science, a swarm possesses certain characteristics which the isolated parts and the sum do not have. In order to explore emergence mechanism of a large–scale electromagnetic agents (EAs), a neighborhood selection (NS) strategy–based electromagnetic agent cellular automata (EA–CA) model is proposed in this paper. The model describes the process of agent state transition, in which a neighbor with the smallest state difference in each sector area is selected for state transition. Meanwhile, the evolution rules of the traditional CA are improved, and performance of different evolution strategies are compared. An application scenario in which the emergence of multi–jammers suppresses the radar radiation source is designed to demonstrate the effect of the EA–CA model. Experimental results show that the convergence speed of NS strategy is better than those of the traditional CA evolution rules, and the system achieves effective jamming with the target after emergence. It verifies the effectiveness and prospects of the proposed model in the application of electronic countermeasures (ECM).

show abstract

“…At the same time, researchers have also adopted many methods, including boosting communication efficiency [25], changing the communication topology [26], and designing advanced controllers [27] to improve the performance of consensus control protocols. For example, by introducing the adaptively regulated weight, Ma et al proposed an adaptive consensus control scheme with an adjustable convergence speed [27].…”

Section: Introductionmentioning

confidence: 99%

Fixed-Time, Robust and Fuzzy Adaptive Consensus Control with Event Trigger Mechanism Based on a Novel ZNN Scheme

Xiao,

Luo,

Ning

et al. 2023

Preprint

View full text Add to dashboard Cite

As a systematic approach, zeroing neural network (ZNN) is an elegant tool in control applications. However, the application of ZNNs in multi-agent systems still needs further research. Adaptive control schemes with adjustable convergence speed are important in practical application, but researchers mainly use explicit and direct rules to update the convergence parameter, which is less effective than using fuzzy logic system (FLS). In this study, combined with FLS, a novel event-triggered fuzzy adaptive ZNN (ET-FAZNN) model is proposed to solve the consensus problem in a fixed time. With a set of predefined fuzzy rules, the convergence rate is adaptively adjusted after an overall evaluation of the system state. We also boost computing efficiency by introducing the event-triggered mechanism. Specifically, we first present a detailed theoretical analysis to show that the novel ET-FAZNN model is fixed-time stable and robust. Then, we estimated the upper bounds of settling-time functions through a novel method based on the improper integral. Finally, four numerical experiments are presented to further verify the fixed-time convergence, adaptiveness, robustness, and the superior computing efficiency compared with conventional fuzzy adaptive ZNN.

show abstract

Speeding Up Velocity Consensus Control with Small World Communication Topology for Unmanned Aerial Vehicle Swarms

Cited by 6 publications

References 19 publications

Distributed Average Consensus Algorithms in d-Regular Bipartite Graphs: Comparative Study

Distributed Average Consensus Algorithms in d-Regular Bipartite Graphs: Comparative Study

Distributed Cooperative Jamming with Neighborhood Selection Strategy for Unmanned Aerial Vehicle Swarms

Fixed-Time, Robust and Fuzzy Adaptive Consensus Control with Event Trigger Mechanism Based on a Novel ZNN Scheme

Contact Info

Product

Resources

About