Abstract

Recent tremendous progress in electronics, complexity theory and network science provides new opportunities for intellectual control of complex large-scale systems operating in turbulent environment via networks of interconnected miniature devices, serving as actuators, sensors and data processors. Actual dynamics of the resulting control systems are too sophisticated to be examined controlled by traditional methods, which primarily deal with ordinary differential equations. However, their complexity can be dramatically reduced by fast processes, organizing the elementary units of the system (called agents) into relatively small number of clusters. The clusters emerge and deteriorate in response to changes in the environment, and the processes of their formation and destruction are very short in time. During the periods of the clusters’ existence, the system’s dynamics is essentially low-dimensional due to synchronization between the agents in each cluster. An enormously complicated system is thus reduced to a finite-dimensional model with time-varying structure of the state vector. The low-dimensionality of the reduced model allows to control it by using classical methods, e.g. model-predictive or adaptive control. This philosophy of complex systems control is illustrated on an experimental setup, called the “airplane with feathers”. The wings of this airplane are equipped with arrays of microsensors, microcomputers, and microactuators (“feathers”). The feathers self-organize into clusters by using a multi-agent consensus protocol; the aim of this coordination is to reduce the perturbing forces, affecting the airplane in a turbulent flow.

Highlights

  • 1 Introduction Whereas interconnected systems have been studied for many decades, recently it has been realized that many of them are governed by similar principles and obey similar mathematical models and can be examined by the same methods

  • Models of fluid dynamics and continuum mechanics [Batchelor, 1967, Mase, 1967] describe the evolution of density and velocity of flows, where individual particles are replaced by indistinguishable infinitesimal elements of the flow

  • We start with consensus algorithms, based on the principle of iterative averaging

Read more

Summary

Introduction

Whereas interconnected systems have been studied for many decades, recently it has been realized that many of them are governed by similar principles and obey similar mathematical models and can be examined by the same methods. It should be noted that structural and statistical properties of complex graphs, representing e.g. large-scale power grids or human relations in social groups, lead to a number of difficult problems on the borderline between statistical physics and graph theory [Watts and Strogatz, 1998, Barabasi and Albert, 1999, Barabasi et al, 2000, Albert and Barabasi, 2002, Newman, 2003] Many problems in this area has, been anticipated by extensive studies in social network analysis [Wasserman and Faust, 1994, Freeman, 2004]. The most intriguing problems are concerned with dynamics over complex networks

Synchronization and Consensus
Clusters and Control of Networks
Consensus via Iterative Averaging
Synchronization of Agents with High-Order and Nonlinear Dynamics
Synchronization among
Consensus-preserving Control and Slow-Fast Dynamics in Networks
Conclusion and Future Work

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.