Controllability and observability of multi-agent systems with heterogeneous and switching topologies

ABSTRACT

This paper focuses on controllability and observability of multi-agent systems with heterogeneous and switching topologies, where the first- and the second-order information interaction topologies are different and switching. First, based on the controllable state set, a controllability criterion is obtained in terms of the controllability matrix corresponding to the switching sequence. Next, by virtue of the subspace sequence, two necessary and sufficient algebraic conditions are established for controllability in terms of the system matrices corresponding to all the possible topologies. Furthermore, controllability is considered from the graphic perspective. It is proved that the system is controllable if the union graph of all the possible topologies is controllable. With respect to observability, two sufficient and necessary conditions are derived by taking advantage of the system matrices and the corresponding invariant subspace, respectively. Finally, some simulation examples are worked out to illustrate the theoretical results.     

Intelligent Information‐Centric Networking routing scheme under imprecise information

Information‐Centric Networking (ICN) has been accepted to overcome some weaknesses of the current Internet architecture, showing that “what is being exchanged” is more important than “who are exchanging information.” Given the inadequate considerations on Quality of Service (QoS) and energy saving in ICN routing, we propose in this paper a routing algorithm to enhance the two aspects. At first, on one hand, Cauchy distribution is used as a fuzzy model to evaluate users' QoS requirements, such as bandwidth, delay, and error rate; on the other hand, we formulate energy saving problem to evaluate the green quality of routing algorithm. Then, we design a link selection approach by considering QoS and energy saving, which belongs to a multi‐objective decision problem resolved by intelligent drops algorithm. Finally, we implement the proposed algorithm and compare it with the famous adaptive forwarding mechanism in terms of some significant metrics, and the experimental results reveal that the proposed algorithm is more efficient.     

Defocusing image to pattern contact holes using attenuated phase shift masks

The patterning of contact holes by selecting out-of-focus image plane (defocus) using attenuated phase shift masks (APSM) has been studied. Defocus is found to enhance the image modulation at low partial coherence for contact holes with negative local average of mask function. Semi-dense holes up to 130 nm in 8% APSM have been printed by 0.5 μm defocus at a partial coherence of 0.31 using KrF scanner with highest numerical aperture of 0.68. However, these holes were closed with in-focus imaging. Defocus is also found to be beneficial for patterning the pitches that have extensive side lobes with in-focus imaging.     

30.4 nm光电成像系统分辨率的初步实验研究

本文基于微通道板MCP(Microchannel Plate)探测器件设计一套成像系统，用于对波长为30．4nm的极紫外EUV(Extreme Ultraviolet)光进行成像．结果获得了一宽度为3mm的狭缝的像，实验测得490μm的成像系统的空间分辨率，并分析了影响系统分辨率的各种因素及为提高系统分辨率所应采取的措施．     

局部设有钢筋砼电梯井墙的设计探讨

本文就局部设有钢筋砼电梯井的工程计算及理论分析，阐明分析了少墙的框剪结构的设计及注意问题。     

Adaptive motion control using neural network approximations

In this paper, we present a new adaptive technique for tracking control of mechanical systems in the presence of friction and periodic disturbances. Radial Basis Functions (RBFs) are used to compensate for the effects of nonlinearly occurring parameters in the friction and periodic disturbance model. Theoretical analysis, such as stability and transient performance, is provided. Furthermore, the performance of the adaptive RBF controller and its non-adaptive counterpart are compared.     

Topology preservation of template-based 6-subiteration reduction operations

Generally, a reduction operation (e.g., thinning and shrinking) on 3D binary images can be represented as a set of reduction templates where every object voxel of the image satisfying any template is turned to a background voxel. Generally, it is rather difficult, error-prone and time-consuming for verifying the topological soundness of a 3D parallel reduction operation. This paper proposes sufficient conditions of time complexity O(n) for verifying the topological soundness of 3D parallel 6-subiteration reduction operations of n templates where such a kind of 3D reduction operations is performed alternatively from the six orthogonal directions to turn object voxels to background voxels. By such sufficient conditions, the topology soundness of a 3D 6-subiteration parallel reduction operation can be verified by checking each and every of its templates.     

Control of discrete time nonlinear systems with a time-varying structure

In this paper, we present a control methodology for a class of discrete time nonlinear systems that depend on a possibly exogenous scheduling variable. This class of systems consists of an interpolation of nonlinear dynamic equations in strict feedback form, and it may represent systems with a time-varying nonlinear structure. Moreover, this class of systems is able to represent some cases of gain scheduling control, Takagi-Sugeno fuzzy systems, as well as input-output realizations of nonlinear systems which are approximated via localized linearizations. We present two control theorems, one using what we call a “global” approach (akin to traditional backstepping), and a “local” approach, our main result, where backstepping is again used but the control law is an interpolation of local control terms. An aircraft wing rock regulation problem with varying angle of attack is used to illustrate and compare the two approaches.     

Stability robustness of networked control systems with respect to packet loss

This paper is concerned with stability analysis of discrete-time networked control systems over a communication channel subject to packet loss whose behavior is modeled by an i.i.d Bernoulli process with a packet dropping probability bounded by a constant. A necessary and sufficient condition for stability is obtained. A packet dropping margin is introduced as a measure of stability robustness of a system against packet dropping, and a formula for it is derived. A design method is proposed for achieving a large margin subject to a constraint that the system has a set of prescribed nominal closed-loop poles.