非线性离散系统的直接自适应神经网络控制器

对于一类非仿射离散时间系统,提出了一种新的自适应神经网络控制器。首先推导与原系统等价的仿射形式模型,由仿射模型推导控制律。控制律中采用一个神经网络,与传统的基于反馈线性化的自适应神经网络设计方法中采用两个神经网络相比,计算量大大减少且避免了控制器奇异问题。神经网络权值根据系统输入输出信号进行更新,另外σ项的引入,取消了为保证参数收敛持续激励的条件。系统的稳定性通过Lyapunov方法进行了分析,仿真实例验证了控制器的有效性。     

Method of neural network modulation recognition based on clustering and Polak-Ribiere algorithm

To improve the recognition rate of signal modulation recognition methods based on the clustering algorithm under the low SNR, a modulation recognition method is proposed. The characteristic parameter of the signal is extracted by using a clustering algorithm, the neural network is trained by using the algorithm of variable gradient correction （Polak-Ribiere） so as to enhance the rate of convergence, improve the performance of recognition under the low SNR and realize modulation recognition of the signal based on the modulation system of the constellation diagram. Simulation results show that the recognition rate based on this algorithm is enhanced over 30% compared with the methods that adopt clustering algorithm or neural network based on the back propagation algorithm alone under the low SNR. The recognition rate can reach 90% when the SNR is 4 dB, and the method is easy to be achieved so that it has a broad application prospect in the modulating recognition.     

Spiking neural P systems with anti-spikes and without annihilating priority as number acceptors

Spiking neural P systems with anti-spikes （ASN P systems） are variant forms of spiking neural P systems, which are inspired by inhibitory impulses/spikes or inhibitory synapses. The typical feature of ASN P systems is when a neuron contains both spikes and anti-spikes, spikes and anti-spikes wil immediately annihilate each other in a maximal way. In this paper, a restricted variant of ASN P systems, cal ed ASN P systems without anni-hilating priority, is considered, where the annihilating rule is used as the standard rule, i.e., it is not obligatory to use in the neuron associated with both spikes and anti-spikes. If the annihilating rule is used in a neuron, the annihilation wil consume one time unit. As a result, such systems using two categories of spiking rules （identified by （a, a） and （a,a^-）） can achieve Turing completeness as number accepting devices.     

Consensus algorithm for multiple quadrotor systems under fixed and switching topologies

The distributed leadless consensus problem for multiple quadrotor systems under fixed and switching topologies is investigated. The objective is to design protocols achieving consensus for networked quadrotors＇ positions and attitudes. Because the model of a quadrotor is a strong high-order nonlinear coupling system, the approach of feedback linearization is employed to transform the model into a group of four linear subsystems among which there is no coupling. Then, a consensus algorithm is proposed which consists of a local feedback controller and interactions from the finite neighbors under fixed undirected topologies. Especially, the problem of choosing the parameters in the consensus algo-rithm is also addressed, enlightened by the results of the robust control theory. Furthermore, it is proved that the proposed algo-rithm also guarantees the consensus under undirected switching topologies. Simulation results show the effectiveness of the pro- posed algorithm.     

LEARNING CAUSAL GRAPHS OF NONLINEAR STRUCTURAL VECTOR AUTOREGRESSIVE MODEL USING INFORMATION THEORY CRITERIA

Detection and clarification of cause-effect relationships among variables is an important problem in time series analysis. Traditional causality inference methods have a salient limitation that the model must be linear and with Gaussian noise. Although additive model regression can effectively infer the nonlinear causal relationships of additive nonlinear time series, it suffers from the limitation that contemporaneous causal relationships of variables must be linear and not always valid to test conditional independence relations. This paper provides a nonparametric method that employs both mutual information and conditional mutual information to identify causal structure of a class of nonlinear time series models, which extends the additive nonlinear times series to nonlinear structural vector autoregressive models. An algorithm is developed to learn the contemporaneous and the lagged causal relationships of variables. Simulations demonstrate the effectiveness of the nroosed method.     

Fast cross validation for regularized extreme learning machine

A method for fast 1-fold cross validation is proposed for the regularized extreme learning machine （RELM）. The computational time of fast l-fold cross validation increases as the fold number decreases, which is opposite to that of naive 1-fold cross validation. As opposed to naive l-fold cross validation, fast l-fold cross validation takes the advantage in terms of computational time, especially for the large fold number such as l 〉 20. To corroborate the efficacy and feasibility of fast l-fold cross validation, experiments on five benchmark regression data sets are evaluated.     

Survey on nonlinear reconfigurable flight control

An overview on nonlinear reconfigurable flight control approaches that have been demonstrated in flight-test or highfidelity simulation is presented. Various approaches for reconfigurable flight control systems are considered, including nonlinear dynamic inversion, parameter identification and neural network technologies, backstepping and model predictive control approaches. The recent research work, flight tests, and potential strength and weakness of each approach are discussed objectively in order to give readers and researchers some reference. Finally, possible future directions and open problems in this area are addressed.     

Nonlinear autopilot design for interceptors with tail fins and pulse thrusters via θ-D approach

The missile autopilot for an interceptor with tail fins and pulse thrusters is designed via the θ-D approach. The nonlin- ear dynamic model of the pitch and yaw motion of the missile is transformed into a linear-like structure with state-dependent coef- ficient （SDC） matrices. Based on the linear-like structure, a θ-D feedback controller is designed to steer the missile to track refer- ence acceleration commands. A sufficient condition that ensures the asymptotic stability of the tracking system is given based on Lyapunov＇s theorem. Numerical results show that the proposed autopilot achieves good tracking performance and the closed-loop tracking system is asymptotically stable.     

IUKF neural network modeling for FOG temperature drift

A novel neural network based on iterated unscented Kalman filter （IUKF） algorithm is established to model and com- pensate for the fiber optic gyro （FOG） bias drift caused by temperature. In the network, FOG temperature and its gradient are set as input and the FOG bias drift is set as the expected output. A 2-5-1 network trained with IUKF algorithm is established. The IUKF algorithm is developed on the basis of the unscented Kalman filter （UKF）. The weight and bias vectors of the hidden layer are set as the state of the UKF and its process and measurement equations are deduced according to the network architecture. To solve the unavoidable estimation deviation of the mean and covariance of the states in the UKF algorithm, iterative computation is introduced into the UKF after the measurement update. While the measure- ment noise R is extended into the state vectors before iteration in order to meet the statistic orthogonality of estimate and mea- surement noise. The IUKF algorithm can provide the optimized estimation for the neural network because of its state expansion and iteration. Temperature rise （-20-20℃） and drop （70-20℃） tests for FOG are carried out in an attemperator. The temperature drift model is built with neural network, and it is trained respectively with BP, UKF and IUKF algorithms. The results prove that the proposed model has higher precision compared with the back- propagation （BP） and UKF network models.     

Chain-type wireless sensor network node scheduling strategy

In order to reduce power consumption of sensor nodes and extend network survival time in the wireless sensor network （WSN）, sensor nodes are scheduled in an active or dormant mode. A chain-type WSN is fundamental y different from other types of WSNs, in which the sensor nodes are deployed along elongated geographic areas and form a chain-type network topo-logy structure. This paper investigates the node scheduling prob-lem in the chain-type WSN. Firstly, a node dormant scheduling mode is analyzed theoretical y from geographic coverage, and then three neighboring nodes scheduling criteria are proposed. Sec-ondly, a hybrid coverage scheduling algorithm and dead areas are presented. Final y, node scheduling in mine tunnel WSN with uniform deployment （UD）, non-uniform deployment （NUD） and op-timal distribution point spacing （ODS） is simulated. The results show that the node scheduling with UD and NUD, especial y NUD, can effectively extend the network survival time. Therefore, a strat-egy of adding a few mobile nodes which activate the network in dead areas is proposed, which can further extend the network survival time by balancing the energy consumption of nodes.     

ROBUST CONSENSUS FOR MULTI-AGENT SYSTEMS OVER UNBALANCED DIRECTED NETWORKS

In this paper, a distributed consensus protocol is proposed for discrete-time single-integer multi-agent systems with measurement noises under general fixed directed topologies, The time-varying control gains satisfying the stochastic approximation conditions are introduced to attenuate noises, thus the closed-loop multi-agent system is intrinsically a linear time-varying stochastic difference system. Then the mean square consensus convergence analysis is developed based on the Lyapunov technique, and the construction of the Lyapunov function especially does not require the typical balanced network topology condition assumed for the existence of quadratic Lyapunov function. Thus, the proposed consensus protocol can be applicable to more general networked multi-agent systems, particularly when the bidirectional and/or balanced information exchanges between agents are not required. Under the proposed protocol, it is proved that the state of each agent converges in mean square to a common random variable whose mathematical expectation is the weighted average of agents＇ initial state values; meanwhile, the random variable＇s variance is bounded.     

Adaptive link layer security architecture for telecommand communications in space networks

Impressive advances in space technology are enabling complex missions, with potentially significant and long term impacts on human life and activities. In the vision of future space exploration, communication links among planets, satel ites, spacecrafts and crewed vehicles wil be designed according to a new paradigm, known as the disruption tolerant networking. In this scenario, space channel peculiarities impose a massive reengineering of many of the protocols usually adopted in terrestrial networks; among them, security solutions are to be deeply reviewed, and tailored to the specific space requirements. Security is to be provided not only to the payload data exchanged on the network, but also to the telecommands sent to a spacecraft, along possibly differentiated paths. Starting from the secure space telecommand design developed by the Consultative Committee for Space Data Systems as a response to agency-based requirements, an adaptive link layer security architecture is proposed to address some of the chal enges for future space networks. Based on the analysis of the communication environment and the error diffusion properties of the authentication algorithms, a suitable mechanism is proposed to classify frame retransmission requests on the basis of the originating event （error or security attack） and reduce the impact of security operations. An adaptive algorithm to optimize the space control protocol, based on estimates of the time varying space channel, is also presented. The simulation results clearly demonstrate that the proposed architecture is feasible and efficient, especially when facing malicious attacks against frame transmission.     

NETWORK ANALYSIS OF TERRORIST ACTIVITIES

This paper uses an extensive network approach to "East Turkistan" activities by building both the one-mode and the bipartite networks for these activities.In the one-mode network,centrality analysis and spectrum analysis are used to describe the importance of each vertex.On this basis,two types of core vertices——The center of communities and the intermediary vertices among communities— are distinguished.The weighted extreme optimization(WEO) algorithm is also applied to detect communities in the one-mode network.In the "terrorist-terrorist organization" bipartite network,the authors adopt centrality analysis as well as clustering analysis based on the original bipartite network in order to calculate the importance of each vertex,and apply the edge clustering coefficient algorithm to detect the communities.The comparative and empirical analysis indicates that this research has been proved to be an effective way to identify the core members,key organizations,and communities in the network of "East Turkistan" terrorist activity.The results can provide a scientific basis for the analysis of "East Turkistan" terrorist activity,and thus provide decision support for the real work of "anti-terrorism".     

多入多出非仿射系统的径向基网络逆控制方法

针对多入多出非仿射非线性系统, 提出了一种径向基网络补偿逆模型误差的自适应控制方法. 将难以求逆的非仿射项分解为可逆部分和不可逆部分, 可逆部分作为理想逆来近似系统的直接逆, 逆模型误差用径向基网络的自适应控制信号补偿, 网络权值利用不可逆部分非仿射信息更新, 应用均值理论和Lyapunov函数证明了自适应控制律的稳定性. 仿真结果验证了该方法的有效性.     

Best-retransmission count selection for environment optimization over wireless heterogeneous networks

This paper proposes an environment-aware best- retransmission count selected optimization control scheme over IEEE 802.11 multi-hop wireless networks. The proposed scheme predicts the wireless resources by using statistical channel state and provides maximum retransmission count optimization based on wireless channel environment state to improve the packet delivery success ratio. The media access control （MAC） layer selects the best-retransmission count by perceiving the types of packet loss in wireless link and using the wireless channel charac- teristics and environment information, and adjusts the packet for- warding adaptively aiming at improving the packet retransmission probability. Simulation results show that the best-retransmission count selected scheme achieves a higher packet successful delivery percentage and a lower packet collision probability than the corresponding traditional MAC transmission control protocols.     

Flocking of multi-robot systems with connectivity maintenance on directed graphs

Analysis and design techniques for cooperative flocking of nonholonomic multi-robot systems with connectivity maintenance on directed graphs are presented. First, a set of bounded and smoothly distributed control protocols are devised via carefully designing a class of bounded artificial potential fields （APF） which could guarantee the connectivity maintenance, col ision avoidance and distance stabilization simultaneously during the system evolution. The connectivity of the underlying network can be preserved, and the desired stable flocking behavior can be achieved provided that the initial communication topology is strongly connected rather than undirected or balanced, which relaxes the constraints for group topology and extends the previous work to more generalized directed graphs. Furthermore, the proposed control algorithm is extended to solve the flocking problem with a virtual leader. In this case, it is shown that al robots can asymptotically move with the desired velocity and orientation even if there is only one informed robot in the team. Finally, nontrivial simulations and experiments are conducted to verify the effectiveness of the proposed algorithm.     

Image segmentation algorithm based on high-dimension fuzzy character and restrained clustering network

An image segmentation algorithm of the restrained fuzzy Kohonen clustering network （RFKCN） based on high- dimension fuzzy character is proposed. The algorithm includes two steps. The first step is the fuzzification of pixels in which two redundant images are built by fuzzy mean value and fuzzy median value. The second step is to construct a three-dimensional （3-D） feature vector of redundant images and their original images and cluster the feature vector through RFKCN, to realize image seg- mentation. The proposed algorithm fully takes into account not only gray distribution information of pixels, but also relevant information and fuzzy information among neighboring pixels in constructing 3- D character space. Based on the combination of competitiveness, redundancy and complementary of the information, the proposed algorithm improves the accuracy of clustering. Theoretical anal- yses and experimental results demonstrate that the proposed algorithm has a good segmentation performance.     

FBFN-based adaptive repetitive control of nonlinearly parameterized systems

An adaptive repetitive control scheme is presented for a class of nonlinearly parameterized systems based on the fuzzy basis function network （FBFN）. The parameters of the fuzzy rules are tuned with adaptive schemes. To attenuate chattering effectively, the discontinuous control term is approximated by an adaptive PI control structure. The bound of the discontinuous control term is assumed to be unknown and estimated by an adaptive mechanism. Based on the Lyapunov stability theory, an adaptive repetitive control law is proposed to guarantee the closed-loop stability and the tracking performance. By means of FBFNs, which avoid the nonlinear parameterization from entering into the adaptive repetitive control, the controller singularity problem is solved. The proposed approach does not require an exact structure of the system dynamics, and the proposed controller is utilized to control a model of permanent-magnet linear synchronous motor subject to significant disturbances and parameter uncertainties. The simulation results demonstrate the effectiveness of the proposed method.     

Composite nonlinear feedback control for output regulation problem of linear discrete-time systems with input saturation

Transient performance for output regulation problems of linear discrete-time systems with input saturation is addressed by using the composite nonlinear feedback（CNF） control technique. The regulator is designed to be an additive combination of a linear regulator part and a nonlinear feedback part. The linear regulator part solves the regulation problem independently which produces a quick output response but large oscillations. The nonlinear feedback part with well-tuned parameters is introduced to improve the transient performance by smoothing the oscillatory convergence. It is shown that the introduction of the nonlinear feedback part does not change the solvability conditions of the linear discrete-time output regulation problem. The effectiveness of transient improvement is illustrated by a numeric example.     

基于Kalman／UKF组合训练神经网络的初始对准方法

针对基于Unscented卡尔曼滤波(UKF)的神经网络训练学习方法存在的计算量大,实时性差的问题,提出了一种基于Kalman/UKF组合滤波原理的神经网络学习方法,该方法综合了Kalman滤波对线性系统和UKF对非线性系统的最优估计的优势,在保证神经网络权值估计精度的同时,有效降低了神经网络权值学习的计算量,提高了神经网络训练的实时性。最后将该利用方法训练的神经网络应用于惯性导航系统的非线性初始对准过程中,并进行了仿真研究。仿真结果表明利用提出的算法训练的神经网络与基于UKF训练的神经网络具有相同的对准精度和实时性,而提出的算法的有效降低了神经网络训练的计算量,提高了训练的运行效率,是解决惯性导航系统初始对准的一种有效和实用的方法。