2018
DOI: 10.1002/rnc.4233
|View full text |Cite
|
Sign up to set email alerts
|

Distributed optimal resource allocation of second‐order multiagent systems

Abstract: Summary In this paper, the resource allocation problems of multiagent systems are investigated. Different from the well‐studied resource allocation problems, the dynamics of agents are taken into account in our problem, which results that the problem could not be solved by most of existing resource allocation algorithms. Here, the agents are in the form of second‐order dynamics, which causes the difficulties in designing and analyzing distributed resource allocation algorithms. Based on gradient descent and st… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
25
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 56 publications
(26 citation statements)
references
References 38 publications
0
25
0
Order By: Relevance
“…where Remark 5. When the w i is an identity matrix, the problem (14) is simplified to the resource allocation problem. 29 The allocation decisions are made to minimize the sum of all the agents' local objective functions while satisfying both the global network resource constraint and the local allocation feasibility constraints.…”
Section: Problem Formulationmentioning
confidence: 99%
See 2 more Smart Citations
“…where Remark 5. When the w i is an identity matrix, the problem (14) is simplified to the resource allocation problem. 29 The allocation decisions are made to minimize the sum of all the agents' local objective functions while satisfying both the global network resource constraint and the local allocation feasibility constraints.…”
Section: Problem Formulationmentioning
confidence: 99%
“…As mentioned above, the resource allocation problem can be viewed as distributed optimization with equality constraints. Compared with the existing optimal resource allocation, 14,29,39 the proposed proximal-gradient algorithm is not only smooth but can solve the NSO for second-order multiagent systems. This section is divided into two parts: first, smooth proximal-gradient algorithm is proposed for nonsmooth resource allocation problem of single-integrator multiagent systems.…”
Section: Distributed Continuous-time Algorithm Based On Proximal Opermentioning
confidence: 99%
See 1 more Smart Citation
“…In terms analysis of migration can be found connection with simulations of the process of architecture and development of tourism with help multiagent systems (Bai 2013). Other suitable examples of using multi-agent systems can be found in (Yang et al 2019), (Deng et al 2018), (Valbuena et al 2008), and (Charnley et al 2019).…”
Section: Germanymentioning
confidence: 99%
“…In terms analysis of migration can be found connection with simulations of the process of architecture and development of tourism with help multiagent systems [19]. Other suitable examples of using multi-agent systems and simulation can be found in [20], [21], [22], [23].…”
Section: Current State Of Knowledgementioning
confidence: 99%