Search

With fast developments in communication technologies, a large number of practical systems adopt the networked control structure. For this structure, the fading problem is an emerging issue among other network problems. It has not been extensively investigated how to guarantee superior control performance in the presence of unknown fading channels. This article presents a learning strategy for gradually improving the tracking performance. To this end, an iterative estimation mechanism is first introduced to provide necessary statistical information such that the biased signals after transmission can be corrected before being utilized. Then, learning control algorithms incorporating with a decreasing step-size sequence are designed for both output and input fading cases. The convergence in both mean-square and almost-sure senses of the proposed schemes is strictly proved under mild conditions. Illustrative simulations verify the effectiveness of the entire learning framework. [ABSTRACT FROM AUTHOR]

In this study, the stability of a hierarchical network with delayed output is discussed by applying a kind of optimal periodic control. To reduce the number of the nodes of the original hierarchical network, an aggregation algorithm is first presented to take some nodes with the same information as an aggregated node. Furthermore, the stability of the original hierarchical network can be guaranteed by the optimal periodic control of the aggregated hierarchical network. Then, an optimal control scheme is proposed to reduce the bandwidth waste in information transmission. In the control scheme, the time sequence is separated into two parts: the deterministic segment and the dynamic segment. With the optimal control scheme, two targets are achieved: 1) the outputs of the original and aggregated hierarchical system are both asymptotically stable and 2) the nodes with slow convergent rate can catch up with the convergence speeds of other nodes. [ABSTRACT FROM AUTHOR]

A novel data-driven learning control scheme is proposed for unknown systems with unknown fading sensor channels. The fading randomness is modeled by multiplicative and additive random variables subject to certain unknown distributions. In this scheme, we propose an error transmission mode and an iterative gradient estimation method. Unlike the conventional transmission mode where the output is directly transmitted back to the controller, in the error transmission mode, we send the desired reference to the plant such that tracking errors can be calculated locally and then transmitted back through the fading channel. Using the faded tracking error data only, the gradient for updating input is iteratively estimated by a random difference technique along the iteration axis. This gradient acts as the updating term of the control signal; therefore, information on the system and the fading channel is no longer required. The proposed scheme is proved effective in tracking the desired reference under random fading communication environments. Theoretical results are verified by simulations. [ABSTRACT FROM AUTHOR]

While neural adaptive control is widely used for dealing with continuous- or discrete-time dynamical systems, less is known about its mechanism and performance in hybrid dynamical systems. This article develops analytical tools to investigate the neural adaptive tracking control of the hybrid Markovian switching networks with heterogeneous nonlinear dynamics and randomly switched topologies. A gradient-descent adaptation law built on neural networks (NNs) is presented for efficient distributed adaptive control. It is shown that the proposed control scheme can guarantee a stable closed-loop error system for any positive control gain and tuning gain. The tracking error is demonstrated to be practically uniformly exponentially stable with a threshold in the mean-square sense. This study further reveals how the topological structure affects the NN function, by measuring the influence of the switched topologies on the learning performance. [ABSTRACT FROM AUTHOR]

In this brief, sustaining and intermittent run-to-run controllers are designed to achieve the stability of singular discrete-time neural networks with state-dependent coefficients. The controllers are designed for two reasons: 1) it is very difficult and almost impossible to only measure thein situfeedback information for the controllers and 2) the controllers may not always exist at any time. The stability is then established for singular discrete-time neural networks with state-dependent coefficients. Finally, numerical simulations are shown to illustrate the usefulness of the obtained criteria. [ABSTRACT FROM AUTHOR]

The resource allocation problem is studied and reformulated by a distributed interior point method via a $\theta$ -logarithmic barrier. By the facilitation of the graph Laplacian, a fully distributed continuous-time multiagent system is developed for solving the problem. Specifically, to avoid high singularity of the $\theta$ -logarithmic barrier at boundary, an adaptive parameter switching strategy is introduced into this dynamical multiagent system. The convergence rate of the distributed algorithm is obtained. Moreover, a novel distributed primal–dual dynamical multiagent system is designed in a smart grid scenario to seek the saddle point of dynamical economic dispatch, which coincides with the optimal solution. The dual decomposition technique is applied to transform the optimization problem into easily solvable resource allocation subproblems with local inequality constraints. The good performance of the new dynamical systems is, respectively, verified by a numerical example and the IEEE six-bus test system-based simulations. [ABSTRACT FROM AUTHOR]

This brief investigates the quantized iterative learning problem for digital networks with time-varying topologies. The information is first encoded as symbolic data and then transmitted. After the data are received, a decoder is used by the receiver to get an estimate of the sender’s state. Iterative learning quantized communication is considered in the process of encoding and decoding. A sufficient condition is then presented to achieve the consensus tracking problem in a finite interval using the quantized iterative learning controllers. Finally, simulation results are given to illustrate the usefulness of the developed criterion. [ABSTRACT FROM PUBLISHER]

This paper proposes a generalized Hopfield network for solving general constrained convex optimization problems. First, the existence and the uniqueness of solutions to the generalized Hopfield network in the Filippov sense are proved. Then, the Lie derivative is introduced to analyze the stability of the network using a differential inclusion. The optimality of the solution to the nonsmooth constrained optimization problems is shown to be guaranteed by the enhanced Fritz John conditions. The convergence rate of the generalized Hopfield network can be estimated by the second-order derivative of the energy function. The effectiveness of the proposed network is evaluated on several typical nonsmooth optimization problems and used to solve the hierarchical and distributed model predictive control four-tank benchmark. [ABSTRACT FROM AUTHOR]

This brief investigates the interval iterative learning problem for dynamic systems with hierarchical neural network (HNN)-structural output. The first objective is to design the output of a dynamic system with HNN structure. A sufficient condition is obtained to achieve the interval tracking in a finite interval by applying iterative learning control (ILC). Then, the saturated ILC is considered into the discussed system, and a less conservative criterion is obtained to achieve the tracking in a finite interval using a network structure decomposition technique. Finally, simulation results are given to illustrate the usefulness of the developed criteria. [ABSTRACT FROM AUTHOR]

This article works on the consensus problem of nonlinear multiagent systems (MASs) under directed graphs. Based on the local output information of neighboring agents, fully distributed adaptive attack-free protocols are designed, where speaking of attack-free protocol, we mean that the observer information transmission via communication channel is forbidden during the whole course. First, the fixed-time observer is introduced to estimate both the local state and the consensus error based on the local output and the relative output measurement among neighboring agents. Then, an observer-based protocol is generated by the consensus error estimation, where the adaptive gains are designed to estimate the unknown neural network constant weight matrix and the upper bound of the residual error vector. Furthermore, the fully distributed adaptive attack-free consensus protocol is proposed by introducing an extra adaptive gain to estimate the communication connectivity information. The proposed protocols are in essence attack-free since no observer information exchange among agents is undertaken during the whole process. Moreover, such a design structure takes the advantage of releasing communication burden. [ABSTRACT FROM AUTHOR]

This study investigates the problem of adaptive decentralized tracking control for a class of interconnected nonlinear systems with input quantization, unknown function, and time-delay, where the time-delay and interconnection terms are supposed to be bounded by some completely unknown functions. An adaptive decentralized tracking controller is constructed via the backstepping method and neural network technique, where a sliding-mode differentiator is presented to estimate the derivative of the virtual control law and reduce the complexity of the control scheme. On the basis of Lyapunov analysis scheme and graph theory, all the signals of the closed-loop system are uniformly ultimately bounded. Finally, an application example of an inverted pendulum system is given to demonstrate the effectiveness of the developed methods. [ABSTRACT FROM AUTHOR]

Many networked systems display some kind of dynamics behaving in a style with both continuous and impulsive communications. The cooperation behaviors of these networked systems with continuous connected or impulsive connected or both connected topologies of communications are important to understand. This paper is devoted to the synchronization of the networked system with continuous and impulsive hybrid communications, where each topology of communication mode is not connected in every moment. Two kind of structures, i.e., fixed structure and switching structures, are taken into consideration. A general concept of directed spanning tree (DST) is proposed to describe the connectivity of the networked system with hybrid communication modes. The suitable Lyapunov functions are constructed to analyze the synchronization stability. It is showed that for fixed topology having a jointly DST, the networked system with continuous and impulsive hybrid communication modes will achieve asymptotic synchronization if the feedback gain matrix and the average impulsive interval are properly selected. The results are then extended to the switching case where the graph has a frequently jointly DST. Some simple examples are then given to illustrate the derived synchronization criteria. [ABSTRACT FROM AUTHOR]

This paper studies the global pinning synchronization problem for a class of complex networks with switching directed topologies. The common assumption in the existing related literature that each possible network topology contains a directed spanning tree is removed in this paper. Using tools from $M$ -matrix theory and stability analysis of the switched nonlinear systems, a new kind of network topology-dependent multiple Lyapunov functions is proposed for analyzing the synchronization behavior of the whole network. It is theoretically shown that the global pinning synchronization in switched complex networks can be ensured if some nodes are appropriately pinned and the coupling is carefully selected. Interesting issues of how many and which nodes should be pinned for possibly realizing global synchronization are further addressed. Finally, some numerical simulations on coupled neural networks are provided to verify the theoretical results. [ABSTRACT FROM PUBLISHER]