2,312 publications from this institution
The global dynamical behavior of a classical power system consisting of n generators is studied in this paper. Existence and uniqueness of an invariant curve in 2n-dimensional space under suitable conditions are proved. The invariant curve is globally attracting so that the system behaves exactly as a one-dimensional system. Furthermore, a rotation number is defined in the power system and then, it is proved that each generator has one rotation number, but n rotation numbers for the n generators are all equal. Moreover, the rotation number is used to determine the dynamical behavior of the system, in the sense that if it is a rational number, an attractor of the system is composed of subharmonics while if an irrational number, the attractor is composed of horizontal curves. As a consequence the system has no chaotic motion under these conditions. Finally, numerical simulations are used to verify the theoretical analysis.
This paper concerns the consensus of discrete-time multi-agentsystems with linear or linearized dynamics. An observer-typeprotocol based on the relative outputs of neighboring agents isproposed. The consensus of such a multi-agent system with a directedcommunication topology can be cast into the stability of a set ofmatrices with the same low dimension as that of a single agent. Thenotion of discrete-time consensus region is then introduced andanalyzed. For neurally stable agents, it is shown that there existsan observer-type protocol having a bounded consensus region in theform of an open unit disk, provided that each agent is stabilizableand detectable. An algorithm is further presented to construct aprotocol to achieve consensus with respect to all the communicationtopologies containing a spanning tree. Moreover, for the case wherethe agents have no polesoutside the unit circle,an algorithm is proposed to construct a protocol having anorigin-centered disk of radius $\delta$ ($0<\delta<1$) as itsconsensus region. Finally, the consensus algorithms are applied tosolve formation control problems of multi-agent systems.
No abstract is provided for this article.
In this paper, we propose a Q-learning based deflection routing algorithm that may be employed to resolve contention in optical burst-switched networks. The main goal of deflection routing is to successfully deflect a burst based only on a limited knowledge that network nodes possess about their environment. Q-learning, one of the reinforcement learning algorithms, has been proposed in the past to help generate deflection decisions. The complexity of existing reinforcement learning-based deflection routing algorithms depends on the number of nodes in the network. The proposed algorithm scales well for larger networks because its complexity depends on the node degree rather than the network size. The algorithm is implemented using the ns-3 network simulator. Simulation results show that it has comparable performance to an existing reinforcement learning deflection routing scheme while having lower memory requirements.
<p>We present a direct solution to the problem of constructing a stochastic matrix with prescribed eigenspectrum, widely referred to as the stochastic inverse eigenvalue problem. The solution uses Markov state disaggregation to construct a Markov chain with stochastic transition matrix possessing the required eigenspectrum. Existing solutions that follow the same approach are limited to constructing matrices with real-valued eigenspectra only. The novel solution directly constructs matrices with complex-valued eigenspectra by applying a new disaggregation technique in tandem with a technique from a previous solution. Due to this generalization, the novel solution is able to successfully model physical systems from a larger family. Furthermore, the novel solution constructs the matrix in a finite and predetermined number of iterations, and without numerical approximation. The solution is demonstrated by deriving an expression for a set of 4 x 4 stochastic matrices sharing the same prescribed complex-valued eigenspectrum and indexed by a real parameter.</p>
No abstract is provided for this article.
In this paper, we consider the bifurcations and exact solutions in the symmetric [Formula: see text] triple-well model. By using the method of dynamical systems, we obtain bifurcations of the phase portraits of the corresponding planar dynamical system under different parameter conditions. Corresponding to some level curves, we derive possible exact explicit parametric representations of the smooth periodic solution, homoclinic solutions, as well as heteroclinic solutions.
This paper describes the design principle, tracking performance and stability analysis of a fuzzy proportional-integral (PI) plus a derivative (D) controller. First, the fuzzy PI+D controller is derived from the conventional continuous-time linear PI+D controller. Then, the fuzzification, control-rule base, and defuzzification in the design of the fuzzy controller are discussed in detail. The resulting controller is a discrete-time fuzzy version of the conventional PI+D controller, which has the same linear structure in the proportional, integral and derivative parts but has nonconstant gains: the proportional, integral and derivative gains are nonlinear functions of the input signals. The new fuzzy PI+D controller thus preserves the simple linear structure of its conventional counterpart yet enhances the self-tuning control capability. Computer simulation results have demonstrated the advantages of the fuzzy controller, particularly when the process to be controlled is nonlinear. After a brief stability analysis, where a simple and realistic sufficient condition for the bounded-input/bounded-output stability of the overall feedback control system was derived, several computer simulation results are shown to compare with the conventional PI+D controller. Computer simulation results have shown the new fuzzy controller indeed has satisfactory tracking performance.
This paper describes a simple method for calculating unstable periodic orbits (UPOs) and their control in piecewise-linear autonomous systems. The algorithm can be used to obtain any desired UPO embedded in a chaotic attractor, and the UPO can be stabilized by a simple state feedback control. A brief stability analysis of the controlled system is also given.
The transition from a non-chaotic state to a chaotic state is a commonly concerned issue in the study of coupled dynamical networks. In this work, we consider a network consisting of nodes that are in non-chaotic states with parameters in non-chaotic regions before they are coupled together. We show that if these non-chaotic nodes are linked together through a suitable structural topology, positive Lyapunov exponents of the coupled network can be generated by choosing a certain uniform coupling strength, and the threshold for this coupling strength is determined by the complexity of the network topology. Moreover, we show that topological effects of scale-free and random networks, which are two basic types of complex network models, can be visualized based on their topological sensitivity to random failures and intentional attacks. Our simulation results on a 1000-node scale-free network and a 1000-node random network of the Logistic maps have verified that, during the transition from non-chaotic to chaotic states, if the topology is more heterogenous then the coupling strength required to achieve the transition can be decreased.
This paper formulates the model and then studies its dynamics of a system of linearly and diffusively coupled identical delayed neural networks (DNNs), which is generalization of delayed Hopfied neural networks (DHNNs) and delayed cellular neural networks (DCNNs). In particularly, a simple yet generic sufficient condition for global synchronization of such coupled DNNs is derived based on the Lyapunov functional methods and Hermitian matrix theory. It is shown that global synchronization of coupled DNNs is ensured by a suitable design of the coupling matrix and the inner linking matrix. Furthermore, the result is applied to some typical chaotic neural networks. Finally, numerical simulations are presented to demonstrate the effectiveness of the approach.