一阶多智能体系统的一致性分析

研究一阶连续多智能体系统的一致性问题,其中每个智能体只能在一系列离散时刻上获得其相对邻居的状态信息,并且每个智能体的保持器的周期和采样器的周期是不同的.通过分析多智能体系统的稳定性,获得了一致性成立的充要条件,该条件揭示了交流拓扑、控制器增益、采样器的周期和保持器的周期的关系.最后,提供一个仿真例子以说明理论结果的有效性.     

具有时延和无时延加权多智能体系统一致性

针对存在全局可达节点有向加权图的静态网络,研究了在控制算法中引入不同权重的当前状态和时延状态时多智能体系统一致性问题.通过采用频域控制理论中广义Nyquist准则和Gerschgorin圆盘定理,证明了系统渐近稳定收敛到一致性的充分条件,提出一种改进系统实现一致性的最大时延上界方法;最后通过数值仿真验证了结论的正确性.     

具有领导者的非线性分数阶多智能体系统的一致性分析

研究了利用非线性分数阶模型描述的具有领导者的多智能体系统的一致性问题.基于智能体之间的通讯拓扑图,设计了系统的控制协议和相应的控制增益矩阵.利用广义Gronwall不等式和分数阶微分方程的稳定性理论,得到了多智能体系统达到一致的充分条件.最后,数值仿真结果显示了理论结果的有效性.     

具有非对称通信时滞和切换拓扑的高阶多智能体系统的一致性

研究具有切换有向拓扑和非对称时变时滞的高阶多智能体系统的一致性问题.通过引入正交线性变换和Lyapunov-Krasovskii泛函方法,依据线性矩阵不等式给出了系统解决一致性问题的充分条件以及可容许时变时滞的上界估计.其主要贡献是基于Lyapunov方程和代数不等式建立了协议参数的显性设计,该参数设计形式简单且易于计算,并保证了所给充分条件中线性矩阵不等式的可解性,使得高阶多智能体系统的一致性在切换有向拓扑下对非对称时变时滞是鲁棒的.     

不确定二阶多智能体系统的鲁棒最优一致

针对不确定二阶多智能体系统,研究了其鲁棒最优一致性问题.首先,基于每个智能体所获得的邻居信息,设计了一个使多智能体系统达到一致的控制协议.其次,研究了多智能体系统的最优一致性问题,给出了系统在满足一定性能指标下达到一致的条件.再次,基于该条件,利用Schur补引理和线性矩阵不等式技术,给出了不确定系统达到鲁棒最优一致的条件.最后,通过仿真验证了所得结果的可行性.     

基于邻居的多智能体系统的多组一致性

针对二阶领导跟随的多智能体系统的组一致性问题,分别就智能体具有线性和非线性两种动态特性情况,在邻域分布式控制下,提出了领导跟随的控制协议.首先,根据设计的控制协议,基于代数和图论相关知识,可以将多智能体系统组一致性问题转化为误差系统的稳定性问题.然后,利用Lyapunov稳定性理论等知识可以得到保证线性和非线性二阶多智...     

一类四阶偏微分多智能体系统的一致性控制

研究一类四阶偏微分多智能体系统的一致性控制问题,该类系统中的每个智能体是由四阶偏微分方程构建而成.针对系统的特点,通过构建合适空间上的Lyapunov泛函,得到分布式反馈控制律.当该反馈控制律作用于系统时,系统状态变量的一致性误差于L2(0,l)×L2(0,l)空间内收敛到零.最后,通过仿真算例验证了方法的有效性.     

基于二部图的多智能体系统加权分组一致性北大核心CSCD

针对拓扑结构为二部图的多智能体系统,设计了由当前状态和时延状态不同权重构成的控制算法,通过采用频域控制理论中广义Nyquist准则和Gerschgorin圆盘定理,给出了多智能体系统实现加权分组一致性的充分条件.提出多智能体时延最大上界与权重参数具有单调递减函数关系,为改进加权分组一致性的最大时延上界提供了可行方法.最后通过数值仿真验证了结论的正确性.     

带有时滞的离散多智能体系统的H_∞一致性问题

考虑带有时滞的离散多智能体系统的H_∞一致性问题,采用增广系统法将原系统转换成为一个不带时滞的降阶系统.通过利用李雅普诺夫稳定性理论研究降阶系统的稳定性,得到多智能体系统达到H_∞一致的线性矩阵不等式形式的条件.最后,仿真结果验证理论结果的有效性.     

异质分数阶非线性多智能体系统的预设时间一致性北大核心CSCD

该文研究了一类异质分数阶非线性多智能体系统的预设时间一致性问题.设计了一类基于时变函数的预设时间分数阶积分控制器,将分数阶非线性多智能体系统转化为一阶非线性多智能体系统.然后综合利用整数阶Lyapunov函数法和预设时间控制技术,分别实现了具有连通无向图和具有含生成树有向图的多智能体系统的精确预设时间一致性控制.该预设时间可以通过时变函数预先设定,且不依赖于系统初始值和参数.最后,用实例验证了理论结果的有效性.     

Zero-Sum Stochastic Games with Partial Information

We study a zero-sum stochastic game on a Borel state space where the state of the game is not known to the players. Both players take their decisions based on an observation process. We transform this into an equivalent problem with complete information. Then, we establish the existence of a value and optimal strategies for both players.     

基于累积共识贡献的不确定语言共识决策方法

针对不确定加型语言偏好信息下的群决策问题,提出一种基于累积共识贡献的自适应式语言共识决策方法。首先,将不确定加型语言偏好转化为不确定二元语义偏好,定义个体一致度与个体共识偏度,并利用它们构建确定专家初始权重的优化模型;然后,利用不确定二元语义的可能度构造集结模糊评价矩阵以及方案的集结群体偏好,提出专家累积共识贡献测度和群体共识测度,通过对拥有较少合作的专家权重进行惩罚让群体自适应地达成共识,无需强迫专家修改其观点,提出一种群体共识决策方法对方案排序择优。最后,通过一个算例说明方法的可行性和有效性。     

Leader-following exponential consensus of general linear multi-agent systems via event-triggered control with combinational measurements

In this paper, the leader-following exponential consensus problem of general linear multi-agent systems via event-triggered control is considered. By using the combinational measurements, two classes of event triggers are designed, one depends on continuous communications between the agents, the other avoids continuous communications. For such two classes of event triggers, the exponential consensus as well as the convergence rates of the controlled multi-agent systems are studied, respectively, by employing the M-matrix theory, algebraic graph theory and the Lyapunov method.     

Top-Down Fuzzy Decision Making with Partial Preference Information

This paper proposes a multi-stage decision procedure to cope with a hierarchical multiple objective decision environment in which the upper-level DM only provides partial preference information and the lower-level DM is fuzzy about the tradeoff questions such that to achieve substantially more than or equal to some values is delivered to maximize the objectives. Therefore, the procedure consists of two levels, a upper-level and a lower-level. The main idea is that after the upper-level provides partial preference information to the lower-level as a guideline of decision, the lower-level DM determines a satisfactory solution from the reduced non-dominated set in the framework of multi-objective fuzzy programs.     

具非线性扩散系数的中立双曲型偏微分方程系统解的振动定理

考虑一类具非线性扩散系数的中立双曲型偏微分方程系统解的振动性.利用Green公式和Riccati变换,获得了该方程组在两类不同边值条件下振动的若干充分条件.     

具有连续时滞的中立型双曲偏微分方程系统解的振动性

研究了一类具有连续时滞变量的非线性中立型双曲型偏微分方程系统,解的振动性.获得了该方程组在Robin边值条件和Dirichlet边值条件下解振动的充分条件.     

Canonical State Representations and Hilbert Functions of Multidimensional Systems

A basic and substantial theorem of one-dimensional systems theory, due to R. Kalman, says that an arbitrary input/output behavior with proper transfer matrix admits an observable state representation which, in particular, is a realization of the transfer matrix. The state equations have the characteristic property that any local, better temporal, state at time zero and any input give rise to a unique global state or trajectory of the system or, in other terms, that the global state is the unique solution of a suitable Cauchy problem. With an adaption of this state property to the multidimensional situation or rather its algebraic counter-part we prove that any behavior governed by a linear system of partial differential or difference equations with constant coefficients is isomorphic to a canonical state behavior which is constructed by means of Gröbner bases. In contrast to the one-dimensional situation, to J.C. Willems’ multidimensional state space models and and to J.F. Pommaret’s modified Spencer form the canonical state behavior is not necessarily a first order system. Further first order models are due E. Zerz. As a by-product of the state space construction we derive a new variant of the algorithms for the computation of the Hilbert function of finitely generated polynomial modules or behaviors. J.F. Pommaret, J. Wood and P. Rocha discussed the Hilbert polynomial in the systems theoretic context. The theorems of this paper are constructive and have been implemented in MAPLE in the two-dimensional case and demonstrated in a simple, but instructive example. A two-page example also gives the complete proof of Kalman’s one-dimensional theorem mentioned above. We believe that for this standard case the algorithms of the present paper compare well with their various competitors from the literature.