Synchronization of complex dynamical networks with random coupling delay and actuator faults
R Sakthivel1, R Sakthivel2, Faris Alzahrani3
1Department of Mathematics, Anna University-Regional Campus, Coimbatore 641046, Tamil Nadu, India.
ISA Transactions
|April 17, 2019
Summary
This study presents a robust controller for synchronizing complex dynamical networks with random delays and actuator faults. The proposed method ensures network synchronization and passivity performance despite system uncertainties.
Area of Science:
- Control Systems Engineering
- Network Science
- Dynamical Systems Theory
Background:
- Complex dynamical networks are susceptible to synchronization issues due to coupling delays and actuator faults.
- Markovian jump systems introduce stochasticity, complicating stability and synchronization analysis.
- Ensuring robust performance in the presence of uncertainties is critical for network reliability.
Purpose of the Study:
- To develop a robust state feedback controller for Markovian jump neutral complex dynamical networks (NCDNs).
- To achieve global asymptotic synchronization and guarantee output strict passivity performance under coupling delays and actuator faults.
- To address random fluctuations using a Bernoulli distribution for coupling delays.
Main Methods:
- Utilizing a Lyapunov-Krasovskii functional and Wirtinger-based integral inequality.
- Developing an actuator fault model to account for system failures.
- Formulating synchronization conditions as linear matrix inequalities (LMIs).
Main Results:
- Sufficient conditions for robust synchronization and passivity were established.
- The proposed controller effectively synchronizes NCDNs despite actuator failures and stochastic delays.
- Numerical examples, including a Lorenz chaotic system, validate the controller's efficacy.
Conclusions:
- The developed control scheme provides a robust solution for synchronizing complex dynamical networks with uncertainties.
- The methodology ensures both synchronization and passivity, crucial for secure and reliable network operations.
- The LMI-based approach offers a computationally tractable method for controller design.
Related Concept Videos
01:18Fault Types
412
When analyzing a single line-to-ground fault from phase A to ground at a three-phase bus, it is important to consider the fault impedance. This impedance is zero for a bolted fault, equal to the arc impedance for an arcing fault, and represents the total fault impedance for a transmission-line insulator flashover. To derive sequence and phase currents, fault conditions are translated from the phase domain to the sequence domain.
For line-to-line faults occurring between phases B and C, the...
For line-to-line faults occurring between phases B and C, the...
412
02:26Protein Networks
4.5K
An organism can have thousands of different proteins, and these proteins must cooperate to ensure the health of an organism. Proteins bind to other proteins and form complexes to carry out their functions. Many proteins interact with multiple other proteins creating a complex network of protein interactions.
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
4.5K
01:04Random Error
9.2K
Random or indeterminate errors originate from various uncontrollable variables, such as variations in environmental conditions, instrument imperfections, or the inherent variability of the phenomena being measured. Usually, these errors cannot be predicted, estimated, or characterized because their direction and magnitude often vary in magnitude and direction even during consecutive measurements. As a result, they are difficult to eliminate. However, the aggregate effect of these errors can be...
9.2K
01:09Random Variables
17.6K
A random variable is a single numerical value that indicates the outcome of a procedure. The concept of random variables is fundamental to the probability theory and was introduced by a Russian mathematician, Pafnuty Chebyshev, in the mid-nineteenth century.
Uppercase letters such as X or Y denote a random variable. Lowercase letters like x or y denote the value of a random variable. If X is a random variable, then X is written in words, and x is given as a number.
For example, let X = the...
Uppercase letters such as X or Y denote a random variable. Lowercase letters like x or y denote the value of a random variable. If X is a random variable, then X is written in words, and x is given as a number.
For example, let X = the...
17.6K
01:13Randomized Experiments
8.9K
The randomization process involves assigning study participants randomly to experimental or control groups based on their probability of being equally assigned. Randomization is meant to eliminate selection bias and balance known and unknown confounding factors so that the control group is similar to the treatment group as much as possible. A computer program and a random number generator can be used to assign participants to groups in a way that minimizes bias.
Simple randomization
Simple...
Simple randomization
Simple...
8.9K
02:18Network Covalent Solids
16.1K
Network covalent solids contain a three-dimensional network of covalently bonded atoms as found in the crystal structures of nonmetals like diamond, graphite, silicon, and some covalent compounds, such as silicon dioxide (sand) and silicon carbide (carborundum, the abrasive on sandpaper). Many minerals have networks of covalent bonds.
To break or to melt a covalent network solid, covalent bonds must be broken. Because covalent bonds are relatively strong, covalent network solids are typically...
To break or to melt a covalent network solid, covalent bonds must be broken. Because covalent bonds are relatively strong, covalent network solids are typically...
16.1K