Recent advances on filtering and control for nonlinear stochastic complex systems with incomplete information: A survey

This Article is provided by the Brunel Open Access Publishing Fund - Copyright @ 2012 Hindawi PublishingSome recent advances on the filtering and control problems for nonlinear stochastic complex systems with incomplete information are surveyed. The incomplete information under consideration mainly includes missing measurements, randomly varying sensor delays, signal quantization, sensor saturations, and signal sampling. With such incomplete information, the developments on various filtering and control issues are reviewed in great detail. In particular, the addressed nonlinear stochastic complex systems are so comprehensive that they include conventional nonlinear stochastic systems, different kinds of complex networks, and a large class of sensor networks. The corresponding filtering and control technologies for such nonlinear stochastic complex systems are then discussed. Subsequently, some latest results on the filtering and control problems for the complex systems with incomplete information are given. Finally, conclusions are drawn and several possible future research directions are pointed out.This work was supported in part by the National Natural Science Foundation of China under Grant nos. 61134009, 61104125, 61028008, 61174136, 60974030, and 61074129, the Qing Lan Project of Jiangsu Province of China, the Project sponsored by SRF for ROCS of SEM of China, the Engineering and Physical Sciences Research Council EPSRC of the UK under Grant GR/S27658/01, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany

Finding structures in information networks using the affinity network

This thesis proposes a novel graphical model for inference called the Affinity Network,which displays the closeness between pairs of variables and is an alternative to Bayesian Networks and Dependency Networks. The Affinity Network shares some similarities with Bayesian Networks and Dependency Networks but avoids their heuristic and stochastic graph construction algorithms by using a message passing scheme. A comparison with the above two instances of graphical models is given for sparse discrete and continuous medical data and data taken from the UCI machine learning repository. The experimental study reveals that the Affinity Network graphs tend to be more accurate on the basis of an exhaustive search with the small datasets. Moreover, the graph construction algorithm is faster than the other two methods with huge datasets. The Affinity Network is also applied to data produced by a synchronised system. A detailed analysis and numerical investigation into this dynamical system is provided and it is shown that the Affinity Network can be used to characterise its emergent behaviour even in the presence of noise

An Overview of Recent Progress in the Study of Distributed Multi-agent Coordination

This article reviews some main results and progress in distributed multi-agent coordination, focusing on papers published in major control systems and robotics journals since 2006. Distributed coordination of multiple vehicles, including unmanned aerial vehicles, unmanned ground vehicles and unmanned underwater vehicles, has been a very active research subject studied extensively by the systems and control community. The recent results in this area are categorized into several directions, such as consensus, formation control, optimization, task assignment, and estimation. After the review, a short discussion section is included to summarize the existing research and to propose several promising research directions along with some open problems that are deemed important for further investigations

Synchronization Control for Discrete-Time-Delayed Dynamical Networks with Switching Topology under Actuator Saturations

10.13039/501100001809-National Natural Science Foundation of China (Grant Number: 61773156, 61873148, 61673141 and 61933007); 10.13039/501100018551-Program for Science and Technology Innovation Talents in the Universities of Henan Province of China (Grant Number: 19HASTIT028); 10.13039/501100010029-Research Fund for the Taishan Scholar Project of Shandong Province of China; 10.13039/501100000288-Royal Society of the U.K.; 10.13039/100005156-Alexander von Humboldt Foundation of Germany

Synchronization of inertial memristive neural networks with time-varying delays via static or dynamic event-triggered control

Funding Information: This work was supported in part by the National Natural Science Foundation of China under Grant 61971185, the Major Research Project of the National Natural Science Foundation of China under Grant 91964108 and the Open Fund Project of Key Laboratory in Hunan Universities under Grant 18K010. Publisher Copyright: © 2020 Elsevier B.V.This paper investigates the synchronization problem of inertial memristive neural networks (IMNNs) with time-varying delays via event-triggered control (ETC) scheme and state feedback controller for the first time. First, two types of state feedback controllers are designed; the first type of controller is added to the transformational first-order system, and the second type of controller is added to the original second-order system. Next, based on each feedback controller, static event-triggered control (SETC) condition and dynamic event-triggered control (DETC) condition are presented to significantly reduce the update times of controller and decrease the computing cost. Then, some sufficient conditions are given such that synchronization of IMNNs with time-varying delays can be achieved under ETC schemes. Finally, a numerical simulation and some data analyses are given to verify the validity of the proposed results.Peer reviewe

Reservoir Computing with Connected Magnetic Nanoring Ensembles

The concept of in-materia computing uses the natural complexity of material systems to perform computational operations naturally as part of the system’s inherent response to input stimuli. However, to implement a material system for computation effectively, the physical response of the system must be understood and exploited under a suitable computational framework. This thesis explores the application of arrays of interconnected magnetic nanorings for computation under the framework of reservoir computing. By using a combination of experimental and simulation techniques, the work presented here aims to explore and understand the response of the nanoring arrays, exploit their interesting dynamic properties for computation, and expand upon the computational power achievable with the system. Firstly, the implementation of a phenomenological model of the nanoring arrays is described, then validated against a range of experimental data covering the static, dynamic, and microstate response of the nanoring arrays with good agreement. This model then serves as a testbed for establishing a suitable paradigm for computing with the nanorings and exploring the computational properties of different regimes of response, ending with a proof-of-concept demonstration of reservoir computing with the nanorings on a benchmark spoken digit recognition task. Next, the findings made in simulation are used to inform the development of an experimental demonstration of computation. This involved the creation of experimental apparatus to apply stimuli to the nanorings via rotating magnetic fields, and to measure the evolving anisotropic magnetoresistance of the device. Interesting dynamic properties of the system’s resistance response are identified and paired with specific reservoir architectures that leverages them to provide different computational properties, evidenced by state-of-the art performances in a range of standard tasks. Finally, the changes in physical behaviour due to manipulations of the array’s lattice structure are explored at the microstate level as well as their macroscale response. Computational properties of the different arrangements are evaluated, and lack of microstate resolution in the readout mechanism is attributed to the subtlety of the differences. However, the additional computational power available when different arrangements are combined shows promising scalability for devices of the nanoring arrays

Synchronization of complex dynamical networks with fractional order

Complex dynamical networks (CDN) can be applied to many areas in real world, from medicine, biology, Internet to sociology. Study on CDNs has drawn great attention in recent years. Nodes in a CDN can be modelled as systems represented by differential equations. Study has shown that fractional order differential equations (DF) can better represent some real world systems than integer-order DFs. This research work focuses on synchronization in fractional CDNs.  A literature review on CDNs with fractional order has summarized the latest works in this area.  Fractional chaotic systems are studied in our initial investigation.  Fractional calculus is introduced and the relevant fundamentals to model, describe and analyse dynamical networks are presented. It is shown that the structure and topological characteristics of a network can have a big impact on its synchronizability. Synchronizability and its various interpretations in dynamical networks are studied. To synchronize a CDN efficiently, controllers are generally needed. Controller design is one of the main tasks in this research. Our first design is a new sliding mode control to synchronize a dynamical network with two nodes. Its stability has been proven and verified by simulations.  Its convergence speed outperforms Vaidyanathan's scheme, a well-recognized scheme in this area. The design can be generalized to CDNs with more nodes.  As many applications can be modelled as CDNs with node clustering, a different sliding mode control is designed for cluster synchronization of a CDN with fractional order. Its stability is proven by using Lyapunov method. Its convergence and efficiency is shown in a simulation. Besides these nonlinear methods mentioned, linear control is also studied intensively for the synchronization.  A novel linear method for synchronization of fractional CDNs using a new fractional Proportional-Integral (PI) pinning control is proposed.  Its stability is proven and the synchronization criteria are obtained. The criteria have been simplified using two corollaries so the right value for the variables can be easily assigned. The proposed method is compared with the conventional linear method which uses Proportional (P) controller. In the comparison, the mean squared error function is used. The function measures the average of the squared errors and it is an instant indicator of the synchronization efficiency. A numerical simulation is repeated 100 times to obtain the averages over these runs. Each simulation has different random initial values for both controllers. The average of the errors in all the 100 simulations is obtained and the area under the function curve is defined as an overall performance index (OPI), which indicates the controller's overall performance. In control, small overshoot is always desired. In our work, the error variation is also used as a measure.  The maximum variation from the average of 100 simulations is calculated and compared for both methods. With all the statistical comparisons, it is clear that with the same power consumption, the proposed method outperforms the conventional one and achieves faster and smoother synchronization. Communication constraints exist in most real world CDNs. Communication constraints and their impact on control and synchronization of CDNs with fractional order are investigated in our study. A new adaptive method for synchronizing fractional CDN with disturbance and uncertainty is designed. Its stability is proven and its synchronization criteria are obtained for both fractional CDN with known and unknown parameters. Random disturbance is also included in both cases. Our results show that the new method is efficient in synchronizing CDNs with presence of both disturbance and uncertainty

The Kuramoto model in complex networks

181 pages, 48 figures. In Press, Accepted Manuscript, Physics Reports 2015 Acknowledgments We are indebted with B. Sonnenschein, E. R. dos Santos, P. Schultz, C. Grabow, M. Ha and C. Choi for insightful and helpful discussions. T.P. acknowledges FAPESP (No. 2012/22160-7 and No. 2015/02486-3) and IRTG 1740. P.J. thanks founding from the China Scholarship Council (CSC). F.A.R. acknowledges CNPq (Grant No. 305940/2010-4) and FAPESP (Grants No. 2011/50761-2 and No. 2013/26416-9) for financial support. J.K. would like to acknowledge IRTG 1740 (DFG and FAPESP).Peer reviewedPreprin