### cs代写|复杂网络代写complex network代考|Consensus of linear CNSs with directed switching topologies

statistics-lab™ 为您的留学生涯保驾护航 在代写复杂网络complex network方面已经树立了自己的口碑, 保证靠谱, 高质且原创的统计Statistics代写服务。我们的专家在代写复杂网络complex network代写方面经验极为丰富，各种代写复杂网络complex network相关的作业也就用不着说。

• Statistical Inference 统计推断
• Statistical Computing 统计计算
• Advanced Probability Theory 高等概率论
• Advanced Mathematical Statistics 高等数理统计学
• (Generalized) Linear Models 广义线性模型
• Statistical Machine Learning 统计机器学习
• Longitudinal Data Analysis 纵向数据分析
• Foundations of Data Science 数据科学基础

## cs代写|复杂网络代写complex network代考|CONSENSUS OF LINEAR CNSS WITH DIRECTED SWITCHING TOPOLOGIES

In the past decade, the consensus problem of general linear CNSs has received a lot of attention $[76,146,162,185,186,224]$. Specifically, the consensus problem of linear CNSs under a directed fixed communication topology has been addressed in [76,224]. In [162], the robust consensus of linear CNSs with additive perturbations of the transfer matrices of the nominal dynamics was studied. In [163] and a number of subsequent papers, the robust consensus was analyzed from the viewpoint of the $\mathcal{H}_{\infty}$ control theory. Among other relevant references, we mention [146] where, while assuming that the open loop systems are Lyapunov stable, the consensus problem of linear CNSs with undirected switching topologies has been investigated. In the situation where the CNS is equipped with a leader and the topology of the system

belongs to the class of directed switching topologies, the consensus tracking problem has been studied in $[185,186]$. One feature of the results in these references is that the open loop agents’ dynamics do not have to be Lyapunov stable. Note that the presence of the leader in the CNSs considered in these references facilitate the derivations and the direct analyses of the consensus error system. However, when the open loop systems are not Lyapunov stable and/or there is no designated leader in the group, the consensus problem for linear CNSs with directed switching topologies remains challenging.

Motivated by the above discussion, this section aims to study the consensus problem for linear CNSs with directed switching topologies. Several aspects of the current study are worth mentioning. Firstly, some of the assumptions in the existing works are dismissed, e.g., the open loop dynamics of the agents do not have to be Lyapunov stable in this chapter. Furthermore, the CNSs under consideration are not required to have a leader. Compared with the consensus problems for linear CNSs with a designated leader, the point of difference here concerns the assumption on the system’s communication topology. In the previous work on the consensus tracking of linear CNSs such as [185], each possible augmented system graph was required to contain a directed spanning tree rooted at the leader. Compared with that work, the switching topologies in this section are allowed to have spanning trees rooted at different nodes. This is a significant relaxation of the previous conditions since it enables the system to be reconfigured if necessary (e.g., to allow different nodes to serve as the formation leader). This also has a potential to make the system more reliable.

## cs代写|复杂网络代写complex network代考|Problem formulation

Consider a CNS consists of $N$ agents that are labelled as agents $1, \ldots, N$. The dynamics of agent $i$ are described by
$$\dot{x}{i}(t)=A x{i}(t)+B u_{i}(t),$$
where $x_{i}(t) \in \mathbb{R}^{n}$ is the state, $u_{i}(t) \in \mathbb{R}^{m}$ is the control input, $A \in \mathbb{R}^{n \times n}$ and $B \in \mathbb{R}^{n \times m}$ are, respectively, the state matrix and control input matrix. It is assumed that the matrix pair $(A, B)$ is stabilizable. And it is assumed that the communication topology of the CNS under consideration switches dynamically over a graph set $\widehat{\mathcal{G}}$. where $\widehat{\mathcal{G}}=\left{\mathcal{G}^{1}, \ldots, \mathcal{G}^{\kappa}\right}, \kappa \geq 1$, denotes the set of all possible directed topologies.
Suppose that $\mathcal{G}(t) \in \widehat{\mathcal{G}}$ for all $t$. To describe the time-varying property of communication topology, assume that there exists an infinite sequence of non-overlapping time intervals $\left[t_{k}, t_{k+1}\right), k=0,1, \ldots .$ with $t_{0}=0,0<\tau_{m} \leq t_{k+1}-t_{k} \leq \tau_{M}<+\infty$, over which the communication topology is fixed. Here, $\tau_{M}>\tau_{m}>0$ and $\tau_{m}$ is called the dwell time. The introduction of the switching signal $\sigma(t):[0,+\infty) \mapsto{1, \ldots, \kappa}$ makes the communication topology of CNS (3.1) well defined at every time instant $t \geq 0$. For notational convenience, we will describe this communication topology using the time-varying graph $\mathcal{G}^{\sigma(t)}$.

Within the context of CNSs, only relative information among neighboring agents can be used for coordination. For each agent $i$, the following distributed consensus

protocol is proposed
$$u_{i}(t)=\alpha K \sum_{j=1}^{N} a_{i j}^{\sigma(t)}\left[x_{j}(t)-x_{i}(t)\right], \quad i=1, \ldots, N,$$
where $\alpha>0$ represents the coupling strength, $K \in \mathbb{R}^{m \times n}$ is the feedback gain matrix to be designed, and $\mathcal{A}^{\sigma(t)}=\left[a_{i j}^{\sigma(t)}\right]{N \times N}$ is the adjacency matrix of graph $\mathcal{G}^{\sigma(t)}$. Then, it follows from (3.1) and (3.2) that $$\dot{x}{i}(t)=A x_{i}(t)+\alpha B K \sum_{j=1}^{N} a_{i j}^{\sigma(t)}\left[x_{j}(t)-x_{i}(t)\right],$$
where $i=1, \ldots, N$.
Let $x(t)=\left[x_{1}^{T}(t), \ldots, x_{N}^{T}(t)\right]^{T}$, it thus follows from (3.3) that
$$\dot{x}(t)=\left[\left(I_{N} \otimes A\right)-\alpha\left(\mathcal{L}^{\sigma(t)} \otimes B K\right)\right] x(t),$$
where $\mathcal{L}^{\sigma(t)}$ is the Laplacian matrix of communication topology $\mathcal{G}^{\sigma(t)}$.
Before concluding this section, the following assumption is presented which will be used in the derivation of the main results.

## cs代写|复杂网络代写complex network代考|Numerical simulations

Consider the CNS (3.3) consisting of five agents, whose topology switches between the graphs $\mathcal{G}^{1}$ and $\mathcal{G}^{2}$ shown in Figure 3.1. For convenience, the weight of each edge is 1. Each agent represents a vertical take-off and landing (VTOL) aircraft. According to [109], the dynamics of the $i$ th VTOL aircraft for a typical loading and

flight condition at the air speed of $135 \mathrm{kt}$ can be described by the system (3.1), with $x_{i}(t)=\left[x_{i 1}(t), x_{i 2}(t), x_{i 3}(t), x_{i 4}(t)\right]^{T} \in \mathbb{R}^{4}$,
$$A=\left[\begin{array}{cccc} -0.0366 & 0.0271 & 0.0188 & -0.4555 \ 0.0482 & -1.01 & 0.0024 & -4.0208 \ 0.1002 & 0.3681 & -0.707 & 1.420 \ 0.0 & 0.0 & 1.0 & 0.0 \end{array}\right], B=\left[\begin{array}{cc} 0.4422 & 0.1761 \ 3.5446 & -7.5922 \ -5.52 & 4.49 \ 0.0 & 0.0 \end{array}\right] \text {, }$$
where the state variables are defined as: $x_{i 1}(t)$ is the horizontal velocity, $x_{i 2}(t)$ is the vertical velocity, $x_{i 3}(t)$ is the pitch rate, and $x_{i 4}(t)$ is the pitch angle [109]. It can be seen from Figure $3.1$ that $\mathcal{G}^{1}$ contains a directed spanning tree with node 2 as the leader, while $\mathcal{G}^{2}$ contains a directed spanning tree rooted at node $5 .$
The transformed Laplacian matrices $\widehat{\mathcal{L}}^{1}, \widehat{\mathcal{L}}^{2}$ in this example are
$$\widehat{\mathcal{L}}^{1}=\left[\begin{array}{cccc} 1 & 0 & 0 & 0 \ 0 & 1 & 0 & 0 \ 0 & 0 & 1 & 0 \ -1 & 1 & 0 & 1 \end{array}\right], \quad \widehat{\mathcal{L}}^{2}=\left[\begin{array}{cccc} 1 & 0 & 0 & 0 \ 0 & 1 & 0 & 0 \ -1 & 0 & 1 & 0 \ 0 & 0 & 0 & 1 \end{array}\right]$$
Set $c_{1}=c_{2}=0.5$. Solving the LMI (3.8) gives that $\bar{\lambda}{\max }=2.5612$, where $\bar{\lambda}{\max }$ is defined in Corollary 3.1. Let $\beta=3$, solving LMI (3.9) gives that
$$K=\left[\begin{array}{cccc} 5.8206 & 0.2978 & -0.2615 & -2.7967 \ -1.1646 & -0.4522 & 0.0530 & 2.0420 \end{array}\right] \text {. }$$
Set $\alpha=4.1>2 / c_{0}=4.0$. Then, according to Corollary $3.1$, one knows that consensus in the closed-loop CNS (3.3) can be achieved if the dwell time $\tau_{m}>0.3135 \mathrm{~s}$. In simulations, let the topology switches between graph $\mathcal{G}^{1}$ and $\mathcal{G}^{2}$ every $0.32 \mathrm{~s}$. The state trajectories of the closed-loop CNS (3.3) are shown in Figs. $3.2$ and 3.3. The evolution of $|e(t)|$ is shown in Figure 3.4, which confirms that the CNS (3.3) achieves consensus.

## cs代写|复杂网络代写complex network代考|Problem formulation

X˙一世(吨)=一个X一世(吨)+乙在一世(吨),

X˙一世(吨)=一个X一世(吨)+一个乙ķ∑j=1ñ一个一世jσ(吨)[Xj(吨)−X一世(吨)],

X˙(吨)=[(我ñ⊗一个)−一个(大号σ(吨)⊗乙ķ)]X(吨),

## 有限元方法代写

tatistics-lab作为专业的留学生服务机构，多年来已为美国、英国、加拿大、澳洲等留学热门地的学生提供专业的学术服务，包括但不限于Essay代写，Assignment代写，Dissertation代写，Report代写，小组作业代写，Proposal代写，Paper代写，Presentation代写，计算机作业代写，论文修改和润色，网课代做，exam代考等等。写作范围涵盖高中，本科，研究生等海外留学全阶段，辐射金融，经济学，会计学，审计学，管理学等全球99%专业科目。写作团队既有专业英语母语作者，也有海外名校硕博留学生，每位写作老师都拥有过硬的语言能力，专业的学科背景和学术写作经验。我们承诺100%原创，100%专业，100%准时，100%满意。

## MATLAB代写

MATLAB 是一种用于技术计算的高性能语言。它将计算、可视化和编程集成在一个易于使用的环境中，其中问题和解决方案以熟悉的数学符号表示。典型用途包括：数学和计算算法开发建模、仿真和原型制作数据分析、探索和可视化科学和工程图形应用程序开发，包括图形用户界面构建MATLAB 是一个交互式系统，其基本数据元素是一个不需要维度的数组。这使您可以解决许多技术计算问题，尤其是那些具有矩阵和向量公式的问题，而只需用 C 或 Fortran 等标量非交互式语言编写程序所需的时间的一小部分。MATLAB 名称代表矩阵实验室。MATLAB 最初的编写目的是提供对由 LINPACK 和 EISPACK 项目开发的矩阵软件的轻松访问，这两个项目共同代表了矩阵计算软件的最新技术。MATLAB 经过多年的发展，得到了许多用户的投入。在大学环境中，它是数学、工程和科学入门和高级课程的标准教学工具。在工业领域，MATLAB 是高效研究、开发和分析的首选工具。MATLAB 具有一系列称为工具箱的特定于应用程序的解决方案。对于大多数 MATLAB 用户来说非常重要，工具箱允许您学习应用专业技术。工具箱是 MATLAB 函数（M 文件）的综合集合，可扩展 MATLAB 环境以解决特定类别的问题。可用工具箱的领域包括信号处理、控制系统、神经网络、模糊逻辑、小波、仿真等。