Distributed and robust resource allocation algorithms for multi-agent systems via discrete-time iterations

This paper proposes two novel nonlinear discrete-time distributed algorithms to solve a class of resource allocation problems. The proposed algorithms allow an interconnected group of agents to collectively minimize a global cost function subject to equality and inequality constraints. Under some te...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2015 54th IEEE Conference on Decision and Control (CDC) s. 1390 - 1395
Hlavní autori: Ramirez-Llanos, Eduardo, Martinez, Sonia
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.12.2015
Predmet:
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract This paper proposes two novel nonlinear discrete-time distributed algorithms to solve a class of resource allocation problems. The proposed algorithms allow an interconnected group of agents to collectively minimize a global cost function subject to equality and inequality constraints. Under some technical conditions, we show that the algorithms converge to the solution in a practical way as long as the stepsize chosen is sufficiently small. Of particular interest is that the proposed algorithms are designed to be robust so that temporary errors in communication or computation do not change their convergence to a neighborhood around the equilibrium, and to this end, agents do not require global knowledge of total resources in the network or any specific procedure for initialization. The convergence of the algorithms is established via second-order convexity theory together with nonsmooth Lyapunov analysis. To illustrate the applicability of our strategies, we study a virus mitigation problem over computer and human networks.
AbstractList This paper proposes two novel nonlinear discrete-time distributed algorithms to solve a class of resource allocation problems. The proposed algorithms allow an interconnected group of agents to collectively minimize a global cost function subject to equality and inequality constraints. Under some technical conditions, we show that the algorithms converge to the solution in a practical way as long as the stepsize chosen is sufficiently small. Of particular interest is that the proposed algorithms are designed to be robust so that temporary errors in communication or computation do not change their convergence to a neighborhood around the equilibrium, and to this end, agents do not require global knowledge of total resources in the network or any specific procedure for initialization. The convergence of the algorithms is established via second-order convexity theory together with nonsmooth Lyapunov analysis. To illustrate the applicability of our strategies, we study a virus mitigation problem over computer and human networks.
Author Martinez, Sonia
Ramirez-Llanos, Eduardo
Author_xml – sequence: 1
  givenname: Eduardo
  surname: Ramirez-Llanos
  fullname: Ramirez-Llanos, Eduardo
  email: ejr003@ucsd.edu
  organization: Dept. of Mech. & Aerosp. Eng., Univ. of California, San Diego, La Jolla, CA, USA
– sequence: 2
  givenname: Sonia
  surname: Martinez
  fullname: Martinez, Sonia
  email: soniamd@ucsd.edu
  organization: Dept. of Mech. & Aerosp. Eng., Univ. of California, San Diego, La Jolla, CA, USA
BookMark eNotj01LxDAURSPowhndC27yB1rz2TZL6agjDLjR9ZA0L-OTtpEkFebfO-is7uHCuXBX5HKOMxByx1nNOTMP_aavBeO6bhUTiukLsuKqNabtuqa7Jl8bzCWhWwp4amdPU3RLLjRBjksagNpxjIMtGOcTHmLC8jllGmKi0zIWrOwB5kLzMRc49T9oqcc8JChQFZyAYoH0p-cbchXsmOH2nGvy8fz03m-r3dvLa_-4q1CwrlRadkwZD1IIbk_QMgPOamNsE3QDXqjgHTM-ONkMUjrVKK-DByu74Ewr5Zrc_-8iAOy_E042Hffn-_IXDVJXIA
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/CDC.2015.7402405
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 1479978868
9781479978861
9781479978847
1479978841
EndPage 1395
ExternalDocumentID 7402405
Genre orig-research
GroupedDBID 6IE
6IH
CBEJK
RIE
RIO
ID FETCH-LOGICAL-i208t-538049de3221a49d709eba599a6f56ed24fdb09dfb36c33b464d5fdea38fb9733
IEDL.DBID RIE
ISICitedReferencesCount 8
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000381554501090&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Thu Jun 29 18:36:03 EDT 2023
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i208t-538049de3221a49d709eba599a6f56ed24fdb09dfb36c33b464d5fdea38fb9733
PageCount 6
ParticipantIDs ieee_primary_7402405
PublicationCentury 2000
PublicationDate 20151201
PublicationDateYYYYMMDD 2015-12-01
PublicationDate_xml – month: 12
  year: 2015
  text: 20151201
  day: 01
PublicationDecade 2010
PublicationTitle 2015 54th IEEE Conference on Decision and Control (CDC)
PublicationTitleAbbrev CDC
PublicationYear 2015
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.6241435
Snippet This paper proposes two novel nonlinear discrete-time distributed algorithms to solve a class of resource allocation problems. The proposed algorithms allow an...
SourceID ieee
SourceType Publisher
StartPage 1390
SubjectTerms Algorithm design and analysis
Convergence
Cost function
Resource management
Robustness
Stability analysis
Title Distributed and robust resource allocation algorithms for multi-agent systems via discrete-time iterations
URI https://ieeexplore.ieee.org/document/7402405
WOSCitedRecordID wos000381554501090&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED61FQMToBbxlgdG3KZxYsdzS8VUdQCpW-XHGYpEg_Lo78dOQhESC9vJchTpbNnnu_u-D-Den4rCx8WOpshimnAtqTQRUm4z47jwn6FuxCbEcpmt13LVg4cDFgYRm-YzHAezqeXb3NQhVTYRSWDkSvvQF4K3WK3vymMkJ7P5LLRqpeNu2i-9lOa6WJz870enMPrB3ZHV4UY5gx7uhvA-D9y2QZYKLfHvflLkui4rUnSJdxJK523izZuvuX_tv32UxAejpOkWpCqgp0hL2VyS_VaRAMUtfLRMg7I8aYmVw_Ybwcvi8Xn2RDuFBLqNo6yi_rTyEb71bo6nyhsikqhVKqXiLuVo48RZHUnrNOOGMZ3wxKbOomKZ01Iwdg6DXb7DCyCZsEZznmiGPDFxpiSXNuI21FG109NLGAY_bT5bEoxN56Krv4ev4TgsRdv3cQODqqjxFo7MvtqWxV2zcl9gM5_Z
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFH5BNNGTGjD-tgePFsbadesZJBiRcMCEG1nXV8UEZrbB32-7TYyJF28vTZclr037-t77vg_g3p6KoY2LDQ2Q-ZQLJalMPKRCR4kRof0MVSk2EU4m0Xwupw142GFhELFsPsOOM8tavk6TjUuVdUPuGLmCPdgPOPe9Cq31XXv0ZLc_6LtmraBTT_ylmFJeGMPj__3qBNo_yDsy3d0pp9DAdQs-Bo7d1glToSb25U-yVG3ygmR16p244nmVerPmW2rf---rnNhwlJT9gjR2-ClSkTbnZLuMiQPjZjZepk5bnlTUym4DtuF1-Djrj2itkUCXvhcV1J5XNsbX1tF-L7ZG6ElUcSBlLEwgUPvcaOVJbRQTCWOKC64DozFmkVEyZOwMmut0jedAolAnSgiuGAqe-FEshdSe0K6SqozqXUDL-WnxWdFgLGoXXf49fAeHo9nLeDF-mjxfwZFblqoL5BqaRbbBGzhItsUyz27LVfwC2h2jIA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2015+54th+IEEE+Conference+on+Decision+and+Control+%28CDC%29&rft.atitle=Distributed+and+robust+resource+allocation+algorithms+for+multi-agent+systems+via+discrete-time+iterations&rft.au=Ramirez-Llanos%2C+Eduardo&rft.au=Martinez%2C+Sonia&rft.date=2015-12-01&rft.pub=IEEE&rft.spage=1390&rft.epage=1395&rft_id=info:doi/10.1109%2FCDC.2015.7402405&rft.externalDocID=7402405