Consensus control of multi-agent systems is an innovative paradigm for the development of intelligent distributed systems.This has fascinated numerous scientific groups for their promising applications as they have th...Consensus control of multi-agent systems is an innovative paradigm for the development of intelligent distributed systems.This has fascinated numerous scientific groups for their promising applications as they have the freedom to achieve their local and global goals and make their own decisions.Network communication topologies based on graph and matrix theory are widely used in a various real-time applications ranging from software agents to robotics.Therefore,while sustaining the significance of both directed and undirected graphs,this research emphases on the demonstration of a distributed average consensus algorithm.It uses the harmonic mean in the domain of multi-agent systems with directed and undirected graphs under static topologies based on a control input scheme.The proposed agreement protocol focuses on achieving a constant consensus on directional and undirected graphs using the exchange of information between neighbors to update their status values and to be able to calculate the total number of agents that contribute to the communication network at the same time.The proposed method is implemented for the identical networks that are considered under the directional and non-directional communication links.Two different scenarios are simulated and it is concluded that the undirected approach has an advantage over directed graph communication in terms of processing time and the total number of iterations required to achieve convergence.The same network parameters are introduced for both orientations of the communication graphs.In addition,the results of the simulation and the calculation of various matrices are provided at the end to validate the effectiveness of the proposed algorithm to achieve consensus.展开更多
Network reconfiguration is of theoretical and practical significance to guarantee safe and economical operation of distribution system.In this paper,based on all spanning trees of undirected graph,a novel genetic algo...Network reconfiguration is of theoretical and practical significance to guarantee safe and economical operation of distribution system.In this paper,based on all spanning trees of undirected graph,a novel genetic algorithm for electric distribution network reconfiguration is proposed.Above all,all spanning trees of simplified graph of distribution network are found.Tie branches are obtained with spanning tree subtracted from simplified graph.There is one and only one switch open on each tie branch.Decimal identity number of open switch on each tie branch is taken as the optimization variable.Therefore,the length of chromosome is very short.Each spanning tree corresponds to one subpopulation.Gene operations of each subpopulation are implemented with parallel computing method.Individuals of offspring after gene operation automatically meet with radial and connected constraints for distribution network operation.Disadvantages of conventional genetic algorithm for network reconfiguration that a large amount of unfeasible solutions are created after crossover and mutation,which result in very low searching efficiency,are completely overcome.High calculation speed and superior capability of the proposed method are validated by two test cases.展开更多
This communique introduces a simple technique,which enables the Laplacian-like matrix of a directed graph to be diagonalisable.Thus many results on multi-agent systems over undirected graphs can be extended to directe...This communique introduces a simple technique,which enables the Laplacian-like matrix of a directed graph to be diagonalisable.Thus many results on multi-agent systems over undirected graphs can be extended to directed graphs.As an example,we show how to make this extension of a popular Automatica paper.展开更多
The undirected power graph <i>P</i>(<i>Z<sub>n</sub></i>) of a finite group <i>Z<sub>n</sub></i> is the graph with vertex set G and two distinct vertices u a...The undirected power graph <i>P</i>(<i>Z<sub>n</sub></i>) of a finite group <i>Z<sub>n</sub></i> is the graph with vertex set G and two distinct vertices u and v are adjacent if and only if <i>u</i> ≠ <i>v</i> and <img src="Edit_3b1df203-9ff2-4c13-93d1-4bba568eae54.png" width="40" height="20" alt="" /> or <img src="Edit_094c8f88-deb6-4f41-825a-ba91c0306ae8.png" width="40" height="20" alt="" />. The Wiener index <i>W</i>(<i>P</i>(<i>Z<sub>n</sub></i>)) of an undirected power graph <i>P</i>(<i>Z<sub>n</sub></i>) is defined to be sum <img src="Edit_348337df-b9c2-480d-9713-ec299a6fcd4e.png" width="110" height="25" alt="" /> of distances between all unordered pair of vertices in <i>P</i>(<i>Z<sub>n</sub></i>). Similarly, the edge-Wiener index <i>W<sub>e</sub></i>(<i>P</i>(<i>Z<sub>n</sub></i>)) of <i>P</i>(<i>Z<sub>n</sub></i>) is defined to be the sum <img src="Edit_e9b89765-f71e-4865-a0c5-c688710ff0c6.png" width="60" height="25" alt="" /> of distances between all unordered pairs of edges in <i>P</i>(<i>Z<sub>n</sub></i>). In this paper, we concentrate on the wiener index of a power graph <img src="Edit_dff0cd99-eb11-4123-a437-78cbbd8ebf96.png" width="40" height="20" alt="" />, <i>P</i>(<i>Z<sub>pq</sub></i>) and <i>P</i>(<i>Z<sub>p</sub></i>). Firstly, we obtain new results on the wiener index and edge-wiener index of power graph <i>P</i>(<i>Z<sub>n</sub></i>), using <i>m,n</i> and Euler function. Also, we obtain an equivalence between the edge-wiener index and wiener index of a power graph of <i>Z<sub>n</sub></i>.展开更多
In this paper,a cooperative adaptive control of leader-following uncertain nonlinear multiagent systems is proposed.The communication network is weighted undirected graph with fixed topology.The uncertain nonlinear mo...In this paper,a cooperative adaptive control of leader-following uncertain nonlinear multiagent systems is proposed.The communication network is weighted undirected graph with fixed topology.The uncertain nonlinear model for each agent is a higher-order integrator with unknown nonlinear functions,unknown disturbances and unknown input actuators.Meanwhile,the gains of input actuators are unknown nonlinear functions with unknown sign.Two most common behaviors of input actuators in practical applications are hysteresis and dead-zone.In this paper,backlash-like hysteresis and dead-zone are used to model the input actuators.Using universal approximation theorem proved for neural networks,the unknown nonlinear functions are tackled.The unknown weights of neural networks are derived by proposing appropriate adaptive laws.To cope with modeling errors and disturbances an adaptive robust structure is proposed.Considering Lyapunov synthesis approach not only all the adaptive laws are derived but also it is proved that the closed-loop network is cooperatively semi-globally uniformly ultimately bounded(CSUUB).In order to investigate the effectiveness of the proposed method,it is applied to agents modeled with highly nonlinear mathematical equations and inverted pendulums.Simulation results demonstrate the effectiveness and applicability of the proposed method in dealing with both numerical and practical multi-agent systems.展开更多
文摘Consensus control of multi-agent systems is an innovative paradigm for the development of intelligent distributed systems.This has fascinated numerous scientific groups for their promising applications as they have the freedom to achieve their local and global goals and make their own decisions.Network communication topologies based on graph and matrix theory are widely used in a various real-time applications ranging from software agents to robotics.Therefore,while sustaining the significance of both directed and undirected graphs,this research emphases on the demonstration of a distributed average consensus algorithm.It uses the harmonic mean in the domain of multi-agent systems with directed and undirected graphs under static topologies based on a control input scheme.The proposed agreement protocol focuses on achieving a constant consensus on directional and undirected graphs using the exchange of information between neighbors to update their status values and to be able to calculate the total number of agents that contribute to the communication network at the same time.The proposed method is implemented for the identical networks that are considered under the directional and non-directional communication links.Two different scenarios are simulated and it is concluded that the undirected approach has an advantage over directed graph communication in terms of processing time and the total number of iterations required to achieve convergence.The same network parameters are introduced for both orientations of the communication graphs.In addition,the results of the simulation and the calculation of various matrices are provided at the end to validate the effectiveness of the proposed algorithm to achieve consensus.
文摘Network reconfiguration is of theoretical and practical significance to guarantee safe and economical operation of distribution system.In this paper,based on all spanning trees of undirected graph,a novel genetic algorithm for electric distribution network reconfiguration is proposed.Above all,all spanning trees of simplified graph of distribution network are found.Tie branches are obtained with spanning tree subtracted from simplified graph.There is one and only one switch open on each tie branch.Decimal identity number of open switch on each tie branch is taken as the optimization variable.Therefore,the length of chromosome is very short.Each spanning tree corresponds to one subpopulation.Gene operations of each subpopulation are implemented with parallel computing method.Individuals of offspring after gene operation automatically meet with radial and connected constraints for distribution network operation.Disadvantages of conventional genetic algorithm for network reconfiguration that a large amount of unfeasible solutions are created after crossover and mutation,which result in very low searching efficiency,are completely overcome.High calculation speed and superior capability of the proposed method are validated by two test cases.
基金the National Natural Science Foundation of China(61603314 and 61773322).
文摘This communique introduces a simple technique,which enables the Laplacian-like matrix of a directed graph to be diagonalisable.Thus many results on multi-agent systems over undirected graphs can be extended to directed graphs.As an example,we show how to make this extension of a popular Automatica paper.
文摘The undirected power graph <i>P</i>(<i>Z<sub>n</sub></i>) of a finite group <i>Z<sub>n</sub></i> is the graph with vertex set G and two distinct vertices u and v are adjacent if and only if <i>u</i> ≠ <i>v</i> and <img src="Edit_3b1df203-9ff2-4c13-93d1-4bba568eae54.png" width="40" height="20" alt="" /> or <img src="Edit_094c8f88-deb6-4f41-825a-ba91c0306ae8.png" width="40" height="20" alt="" />. The Wiener index <i>W</i>(<i>P</i>(<i>Z<sub>n</sub></i>)) of an undirected power graph <i>P</i>(<i>Z<sub>n</sub></i>) is defined to be sum <img src="Edit_348337df-b9c2-480d-9713-ec299a6fcd4e.png" width="110" height="25" alt="" /> of distances between all unordered pair of vertices in <i>P</i>(<i>Z<sub>n</sub></i>). Similarly, the edge-Wiener index <i>W<sub>e</sub></i>(<i>P</i>(<i>Z<sub>n</sub></i>)) of <i>P</i>(<i>Z<sub>n</sub></i>) is defined to be the sum <img src="Edit_e9b89765-f71e-4865-a0c5-c688710ff0c6.png" width="60" height="25" alt="" /> of distances between all unordered pairs of edges in <i>P</i>(<i>Z<sub>n</sub></i>). In this paper, we concentrate on the wiener index of a power graph <img src="Edit_dff0cd99-eb11-4123-a437-78cbbd8ebf96.png" width="40" height="20" alt="" />, <i>P</i>(<i>Z<sub>pq</sub></i>) and <i>P</i>(<i>Z<sub>p</sub></i>). Firstly, we obtain new results on the wiener index and edge-wiener index of power graph <i>P</i>(<i>Z<sub>n</sub></i>), using <i>m,n</i> and Euler function. Also, we obtain an equivalence between the edge-wiener index and wiener index of a power graph of <i>Z<sub>n</sub></i>.
文摘In this paper,a cooperative adaptive control of leader-following uncertain nonlinear multiagent systems is proposed.The communication network is weighted undirected graph with fixed topology.The uncertain nonlinear model for each agent is a higher-order integrator with unknown nonlinear functions,unknown disturbances and unknown input actuators.Meanwhile,the gains of input actuators are unknown nonlinear functions with unknown sign.Two most common behaviors of input actuators in practical applications are hysteresis and dead-zone.In this paper,backlash-like hysteresis and dead-zone are used to model the input actuators.Using universal approximation theorem proved for neural networks,the unknown nonlinear functions are tackled.The unknown weights of neural networks are derived by proposing appropriate adaptive laws.To cope with modeling errors and disturbances an adaptive robust structure is proposed.Considering Lyapunov synthesis approach not only all the adaptive laws are derived but also it is proved that the closed-loop network is cooperatively semi-globally uniformly ultimately bounded(CSUUB).In order to investigate the effectiveness of the proposed method,it is applied to agents modeled with highly nonlinear mathematical equations and inverted pendulums.Simulation results demonstrate the effectiveness and applicability of the proposed method in dealing with both numerical and practical multi-agent systems.