没有合适的资源?快使用搜索试试~ 我知道了~
高阶线性时不变群系统的时变输出阵形控制
0 下载量 78 浏览量
2021-03-18
16:28:38
上传
评论
收藏 724KB PDF 举报
温馨提示
群体系统的编队控制由于其在各个领域的潜在应用而受到了科学界的广泛关注。在实际应用中,每个代理的动力学可能是高阶的,只需要所有代理的输出即可实现随时间变化的编队。因此,本文着重研究具有定向交互拓扑的高阶线性时不变群系统的时变输出形成控制问题。基于相邻代理的相对输出,提出了一种通用的输出形成协议。使用基于共识的方法,为群体系统实现时变输出形式提供了必要和充分的条件。给出了输出形式参考函数的显式表达式。对于集群系统而言,理想的输出形式是否可行是一个关键问题。基于局部稳定性理论,推导了产出形成可行性的充要条件。分别提出了扩展可行的时变输出形式集的方法和设计群体系统实现时变输出形式的协议的算法。最后,通过数值模拟证明了理论结果。
资源推荐
资源详情
资源评论
Time-varying output formation control for high-order linear
time-invariant swarm systems
q
Xiwang Dong
a,b
, Zongying Shi
b
, Geng Lu
b
, Yisheng Zhong
b,
⇑
a
School of Automation Science and Electronic Engineering, Science and Technology on Aircraft Control Laboratory, Beihang University, Beijing 100191, PR China
b
Department of Automation, TNlist, Tsinghua University, Beijing 100084, PR China
article info
Article history:
Received 4 December 2013
Received in revised form 21 November 2014
Accepted 30 November 2014
Available online 6 December 2014
Keywords:
Time-varying formation
Output formation
Formation feasibility
High-order
Swarm system
abstract
Formation control of swarm systems has gained considerable attention from scientific
communities due to its potential applications in various areas. In practical applications,
the dynamics of each agent may be of high order and only the outputs of all agents are
required to achieve time-varying formations. Therefore, this paper focuses on time-varying
output formation control problems for high-order linear time-invariant swarm systems
with directed interaction topologies. A general output formation protocol is proposed
based on the relative outputs of neighboring agents. Necessary and sufficient conditions
for swarm systems to achieve time-varying output formations are presented using a con-
sensus based approach. An explicit expression of the output formation reference function is
given. For a swarm system, whether or not a desired output formation is feasible is a crucial
problem. Based on partial stability theory, necessary and sufficient conditions for output
formation feasibility are derived. Approaches to expand the feasible time-varying output
formation set and an algorithm to design the protocol for swarm systems to achieve
time-varying output formation are presented respectively. Finally, theoretical results are
demonstrated by numerical simulations.
Ó 2014 Elsevier Inc. All rights reserved.
1. Introduction
The past decades have witnessed the increasing research interest in cooperative control of swarm systems. It has been
revealed that cooperative control of swarm systems has broad applications in various areas, such as flocking [25,30], consen-
sus [12,24] and formation control [8,10]. Although individual agent can be used to accomplish various tasks, great benefits
including high efficiency, low cost and easy maintenance, just to name a few, can be achieved by having a group of agents
work in formation. To achieve formation control, many approaches have been proposed in robotics community, such as lea-
der–follower [4], virtual structure [17] and behavior [1] based approaches. However, Beard et al. [2] pointed out that leader–
follower, behavior and virtual structure based formation control approaches have their own weaknesses. For example, lea-
der–follower approaches lack robustness due to the existence of the leader, and behavior approaches are difficult to analyze
mathematically, etc.
Recently, consensus problems for linear time-invariant (LTI) swarm systems have been investigated extensively, and lots of
results have been obtained for first-order, second-order and high-order LTI swarm systems [5,13,14,18–20,22,26,28,32,33].
http://dx.doi.org/10.1016/j.ins.2014.11.047
0020-0255/Ó 2014 Elsevier Inc. All rights reserved.
q
This work was supported by the National Natural Science Foundation of China and the Fundamental Research Funds for the Central Universities under
Grants 61374034, 61210012, 61174067, 61333011 and YWF-14-RSC-101.
⇑
Corresponding author. Tel.: +86 10 62772573.
E-mail address: zys-dau@mail.tsinghua.edu.cn (Y. Zhong).
Information Sciences 298 (2015) 36–52
Contents lists available at ScienceDirect
Information Sciences
journal homepage: www.elsevier.com/locate/ins
Consensus requires that the states/outputs of agents reach an agreement. With the development of consensus theory, more and
more researchers realized that consensus approaches can be used to deal with formation control problems. Ren [29] applied a
consensus protocol to formation control of second-order swarm systems and showed that leader–follower, behavior and vir-
tual structure based approaches in the literature can be unified in the general framework of consensus based approach, and the
weaknesses of the these approaches can be overcome. Therefore it is significant to study the formation control problem for
swarm systems using the consensus based approach.
Based on the consensus strategy, Chen and Tian [3] proposed a formation controller for second-order swarm systems
using the backstepping approach. Finite-time consensus protocols were applied to study the formation control problems
of first-order and second-order swarm systems in [35,7]. Xie and Wang [36] transformed formation control problems for sec-
ond-order swarm systems with undirected interaction topologies into consensus problems, and revealed that if the interac-
tion topologies are connected then the desired formations can be achieved. Using consensus based approaches, Lafferriere
et al. [16] studied formation control problems for swarm systems with a special high-order LTI model which can be regarded
as a series of second-order models. Lin et al. [21] addressed formation feasibility problems for first-order swarm systems
with undirected interaction topologies. Formation problems for general high-order LTI swarm systems were considered
by Ma and Zhang [23]. Dong et al. [6] proposed necessary and sufficient conditions for high-order LTI swarm systems with
time delays to achieve time-varying state formations.
The authors in [3,6,7,16,21,23,29,35,36] only discussed state formation problems. In many practical applications, each
agent can only obtain output information of its neighbors rather than state information, and only the outputs of all agents
are required to achieve predefined formations. Output formation stability problems for general high-order LTI swarm sys-
tems were investigated by Fax and Murray [8]. Based on the work of [8], Porfiri et al. [27] studied output formation and
tracking stability problems for general high-order LTI swarm systems. However, both [8,27] only addressed output formation
stability problems and did not consider the output formation feasibility problems. For a swarm system, whether or not a
given output formation is feasible is a crucial problem. In addition, the formations in [8,16,23,27] are assumed to be
time-invariant, which means that those results cannot be used to deal with time-varying formation problems. To the best
of our knowledge, time-varying output formation and formation feasibility problems for general high-order LTI swarm sys-
tems are still open.
In the current paper, time-varying output formation analysis and design problems, and output formation feasibility prob-
lems for general high-order LTI swarm systems with directed interaction topologies are studied respectively. A consensus
based output formation protocol is presented firstly. Then output formation problems are transformed into output consensus
problems. Necessary and sufficient conditions for high-order LTI swarm systems to achieve time-varying output formation
are proposed and an explicit expression of the time-varying output formation reference function is given. Moreover, neces-
sary and sufficient conditions for output formation feasibility are derived based on partial stability theory, where the feasible
time-varying output formation set can be expanded. Finally, an algorithm to design the protocol for swarm systems to
achieve time-varying output formation is proposed.
Compared with the existing work on formation control, the novel features of the current paper are threefold. Firstly, both
output formation analysis and feasibility problems for general high-order LTI swarm systems with directed interaction
topologies are investigated. In [3,7,21,29,35,36], the dynamics of each agent is of low order. Refs. [8,16,23,27] addressed for-
mation problems for high-order swarm systems, but they did not consider output formation feasibility problems. Secondly,
the output formation can be time-varying while the formations in [8,16,23,27] are time-invariant, and a description of the
feasible time-varying output formation set is also shown in the current paper. Thirdly, an explicit expression of the time-
varying output formation reference function is given. An algorithm to determine the gain matrices in the protocol for swarm
systems to achieve time-varying output formation is also presented. However, protocol design problems were not dealt with
in [8,27].
The rest of this paper is organized as follows. In Section 2, basic concepts and useful results on graph theory and partial
stability theory are introduced respectively, and the problem to be investigated is formulated. In Section 3, criteria for swarm
systems to achieve time-varying output formation are derived and an explicit expression of the time-varying output forma-
tion reference function is given. In Section 4, conditions for output formation feasibility and an algorithm to design the pro-
tocol are presented respectively. Numerical simulations are shown in Section 5. Finally, Section 6 concludes the whole work.
Throughout this paper, for simplicity of notation, let 0 be a zero matrix of appropriate size with zero vector and zero num-
ber as special cases. 1 denotes a column vector of appropriate size with 1 as its elements. I stands for an identity matrix with
appropriate dimension, and represents Kronecker product. Given any real matrix R and any k 2 C, let
K
R
¼ diagfR; Rg and
U
k
¼
ReðkÞI ImðkÞI
ImðkÞI ReðkÞI
:
2. Preliminaries and problem description
In this section, firstly, basic concepts and results on graph theory and partial stability theory are introduced respectively.
Then the problem description is given.
X. Dong et al. / Information Sciences 298 (2015) 36–52
37
2.1. Basic concepts and results on graph theory
A directed graph of order N can be denoted by G ¼fS; E; Wg, where S ¼fs
1
; s
2
; ...; s
N
g is the set of nodes,
E # fðs
i
; s
j
Þ : i – j; s
i
; s
j
2 Sg is the set of edges and W ¼½w
ij
2R
NN
is the adjacency matrix with nonnegative weights w
ij
.
An edge of G is represented by e
ij
¼ðs
i
; s
j
Þ. The set of neighbors of node s
i
is denoted by N
i
¼ s
j
2 S : ðs
j
; s
i
Þ2E
. The in-degree
of node s
i
is defined as deg
in
ðs
i
Þ¼
P
N
j¼1
w
ij
. The degree matrix of G is denoted by D ¼ diag deg
in
ðs
i
Þ; i ¼ 1; 2; ...; N
fg
. w
ji
> 0if
and only if e
ij
2 E and w
ii
¼ 0 for all i 2 1; 2; ...; N
fg
. The Laplacian matrix of G can be written as L ¼ D W.Adirected path
from node s
i
1
to s
i
l
is a sequence of ordered edges such that for k ¼ 1; 2; ...; l 1; ðs
i
k
; s
i
kþ1
Þ2E. A directed graph is said to have
a spanning tree if there exists at least one node having a directed path to all the other nodes. More details on graph theory can
be found in [9]. The following lemma is useful in analyzing time-varying output formation problems of swarm systems.
Lemma 1 [28]. Let L 2 R
NN
be the Laplacian matrix of a directed graph G, then
(i) L has at least one zero eigenvalue, and 1 is the associated eigenvector; that is, L1 ¼ 0;
(ii) If G has a spanning tree, then 0 is a simple eigenvalue of L, and all the other N 1 eigenvalues have positive real parts.
2.2. Basic concepts and results on partial stability theory
Consider the following system
_
^
xðtÞ¼
^
A
^
xðtÞ;
_
^
yðtÞ¼
^
CxðtÞ;
(
ð1Þ
where
^
xðtÞ
^
y
H
ðtÞ;
^
y
H
o
ðtÞ
H
and
^
A ¼
^
A
11
^
A
12
^
A
21
^
A
22
"#
;
^
C ¼ I 0
½:
Definition 1. System (1) is said to be asymptotically stable with respect to
^
yðtÞ if for any bounded initial state
^
xð0Þ; lim
t!1
^
yðtÞ¼0.
Based on the observability of system (1), the following result about partial stability can be obtained, which will be used to
prove the main results concerning the time-varying output formation.
Lemma 2 [33]. If ð
^
A
22
;
^
A
12
Þ is completely observable, then system (1) is asymptotically stable with respect to
^
yðtÞ if and only if
^
Ais
Hurwitz.
2.3. Problem description
Consider a swarm system consisting of N agents with an interaction topology represented by the directed graph G. For
i; j 2f1; 2; ...; Ng, agent i can be regarded as the node s
i
in G. The interaction from agent i to agent j and the corresponding
interaction strength can be denoted by the edge e
ij
and weight w
ji
respectively. It is assumed that G has a spanning tree. The
dynamics of agent i ði 2f1; 2; ...; NgÞ is described by
_
x
i
ðtÞ¼Ax
i
ðtÞþBu
i
ðtÞ;
y
i
ðtÞ¼Cx
i
ðtÞ;
ð2Þ
where x
i
ðtÞ2R
n
; u
i
ðtÞ2R
m
; y
i
ðtÞ2R
q
denote the state, control input and output of agent i respectively. It is assumed that
rankðCÞ¼q. It should be pointed out that the assumption that C is of full row rank means that the elements in the output
y
i
ðtÞ are independent of each other. If C is not of full row rank, then some of the elements in y
i
ðtÞ can be expressed as linear
combination of the others, hence involves no new information. In this case, those elements in y
i
ðtÞ which are linearly depen-
dent on others can be ignored.
A time-varying output formation is specified by a vector hðtÞ¼ h
T
1
ðtÞ; h
T
2
ðtÞ; ...; h
T
N
ðtÞ
hi
T
2 R
Nq
.
Definition 2. Swarm system (2) is said to achieve time-varying output formation hðtÞ if for any given bounded initial states,
there exists a vector-valued function rðtÞ2R
q
such that
lim
t!1
ðy
i
ðtÞh
i
ðtÞrðtÞÞ ¼ 0 ði ¼ 1; 2; ...; NÞ;
where rðtÞ is called an output formation reference function.
38 X. Dong et al. / Information Sciences 298 (2015) 36–52
剩余16页未读,继续阅读
资源评论
weixin_38641111
- 粉丝: 1
- 资源: 931
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
最新资源
- 基于 AT89C51 的电梯控制系统嵌入式系统实验详细文档+全部资料+高分项目+源码.zip
- 本科毕设-基于嵌入式arm的人脸识别智能门禁,包括代码、电路图,具体流程详细文档+全部资料+高分项目+源码.zip
- 毕设-基于WIFI车间设备监测与控制系统的研究)的主程序,采用Qt框架编写,以嵌入式ARM Linux系统作为软件运行平台详细文档+全部资料+高分项目+源码.zip
- 基于 react + koa, 开箱即用的 Material Design 风格博客系统..详细文档+全部资料+高分项目+源码.zip
- Project2.zip
- 用c++语言实现的各种算法源代码.zip
- 基于 u8g2 的单色 OLED 菜单 UI 框架。MiaoUI使用 C 语言实现,,适用于具有小型OLED屏幕的嵌入式设备。详细文档+全部资料+高分项目+源码
- 基于ARM的嵌入式小系统,在系统挂掉之后,提取现场的dump信息详细文档+全部资料+高分项目+源码.zip
- 基于Android基于WebView的嵌入式Youtube视频播放器,可识别多种Youtube分享视频的url详细文档+全部资料+高分项目+源码.zip
- 基于ARM-Linux的嵌入式视觉移动追踪系统,并通过Android APP进行无线控制详细文档+全部资料+高分项目+源码.zip
- 基于C++11,协作式调度物联网嵌入式操作系统详细文档+全部资料+高分项目+源码.zip
- 基于ARM架构Cortex-A8的IC卡嵌入式刷卡考勤系统详细文档+全部资料+高分项目+源码.zip
- 基于cc2530的嵌入式详细文档+全部资料+高分项目+源码.zip
- 基于ChatGPT的智能音箱嵌入式课程设计详细文档+全部资料+高分项目+源码.zip
- 基于Cortex-M内核的嵌入式操作系统,针对新手设计,简单易懂详细文档+全部资料+高分项目+源码.zip
- 基于contiki与ucGUI的嵌入式微操作系统例程详细文档+全部资料+高分项目+源码.zip
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功