The traditional consensus-based distributed economic dispatch strategy may lose system convergency and cause imbalanced power when facing an information attack on the individual power generation unit;thus, it is unabl...
详细信息
The traditional consensus-based distributed economic dispatch strategy may lose system convergency and cause imbalanced power when facing an information attack on the individual power generation unit;thus, it is unable to achieve the dispatching goal. Taking into consideration several kinds of attack behaviors that may exist in a distributed control system, this paper develops models of node attacks from the two aspects of action mode and deployment scope, and analyzes the influence of attack behaviors on the distributed economic dispatch system. Based on the idea of the w-msr algorithm that deletes the information received from nodes that may be attacked, a distributed security consensus-based economic dispatch strategy is synthetized with the incremental cost of the power generation unit as the consensus variable. Based on the graph robustness index, this paper gives its conditions along with its proof that the communication network topology of the system should be satisfied when adopting the w-msr algorithm. The simulation results of the IEEE-39 bus distribution network show that the strategy proposed in this paper can effectively counter various information attacks, enhancing both the security and economic efficiency of the distributed economic dispatch system. In addition, the (F + 1, F + 1)-robust graph is a necessary and sufficient condition to achieve the consensus of the dispatch strategy.
This article proposes the consensus tracking of multi-agent systems, in the presence of Byzantine agents and loss of connection between agents and the reference signal. The main purpose of this work is to steer a mult...
详细信息
This article proposes the consensus tracking of multi-agent systems, in the presence of Byzantine agents and loss of connection between agents and the reference signal. The main purpose of this work is to steer a multi-agent system to the desired reference, assuming that there are some agents which send incorrect information to the other agents, and the connection between the agents and the reference signal may lose. Using graph properties alongside the weighted-mean-subsequence-reduced (w-msr) algorithm led to a novel control method for multi-agent systems. with the aid of model predictive control (MPC), the agents reach the desired consensus with connection loss of reference signals, misbehaving agents in the system, and constraints on the input signals. Combining MPC with the w-msr algorithm results in an algorithm called reference-based-w-msr (RBw-msr), which has made the consensus point fixed according to a predetermined reference. A theorem is illustrated to guarantee the consensus with the interruption of reference signals and agents. The effectiveness of the proposed algorithm is illustrated via simulation results. This paper explores the application of MPC in multi-agent systems when there are several misbehaving agents in the system to prevent reaching a consensus. A new strategy, based on Graph and Control theory has been devised to address the problem of reaching a consensus in the presence of Byzantine agents while reference signals are ***
暂无评论