This article addresses a resilient exponential distributed convex optimization problem for a heterogeneous linear multiagent system under Denial-of-Service (DoS) attacks over random digraphs. The random digraphs are caused by unreliable… Click to show full abstract
This article addresses a resilient exponential distributed convex optimization problem for a heterogeneous linear multiagent system under Denial-of-Service (DoS) attacks over random digraphs. The random digraphs are caused by unreliable networks and the DoS attacks, allowed to occur aperiodically, refer to an interruption of the communication channels carried out by the intelligent adversaries. In contrast to many existing distributed convex optimization works over a perfect communication network, the global optimal solution might not be sought under the adverse influences that result in performance degradations or even failures of optimization algorithms. The aforementioned setting poses certain technical challenges to optimization algorithm design and exponential convergence analysis. In this work, several resilient algorithms are presented such that a team of agents minimizes a sum of local nonquadratic cost functions in a safe and reliable manner with the global exponential convergence. Numerical simulation results are further presented to validate the effectiveness of the proposed distributed approaches.
               
Click one of the above tabs to view related content.