You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Resilient Constrained Optimization in Multi-Agent Systems With Improved Guarantee on Approximation Bounds

Authors:

Mojtaba Kaheni, Elio Usai , Mauro Franceschelli

Publication Type:

Journal article

Venue:

IEEE Control Systems Letters

Abstract

This letter considers resilient decentralized constrained optimization in multi-agent systems where some agents due to cyberattacks become adversaries. We show that the proposed method is resilient despite the persistent influence of up to F anonymous adversaries in the complete graphs. Our approach provides a better approximation of the optimal solution than the current literature. If the agents’ objectives are 2F redundant, then the algorithm converges to the optimal solution. In addition to current literature, we consider a constrained optimization problem. Finally, we present numerical simulations to corroborate the theoretical analysis.

Bibtex

@article{Kaheni6783,
author = {Mojtaba Kaheni and Elio Usai and Mauro Franceschelli},
title = {Resilient Constrained Optimization in Multi-Agent Systems With Improved Guarantee on Approximation Bounds},
volume = {6},
pages = {2659--2664},
month = {May},
year = {2022},
journal = {IEEE Control Systems Letters},
url = {http://www.es.mdu.se/publications/6783-}
}