2018 IEEE Conference on Decision and Control (CDC) 2018
DOI: 10.1109/cdc.2018.8619295
|View full text |Cite
|
Sign up to set email alerts
|

Distributed Continuous-time Resource Allocation with Time-varying Resources under Quadratic Cost Functions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
16
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 24 publications
(16 citation statements)
references
References 17 publications
0
16
0
Order By: Relevance
“…It is known that the most current works about the distributed resource allocation problem are based on discrete‐time multi‐agent systems. However, with the development of cyber‐physical systems and the well‐developed continuous‐time control techniques, the continuous‐time distributed optimization algorithms have attracted much attention recently [20–27]. Moreover, the continuous‐time multi‐agent systems correspond to the steepest descent direction of the local cost function.…”
Section: Introductionmentioning
confidence: 99%
“…It is known that the most current works about the distributed resource allocation problem are based on discrete‐time multi‐agent systems. However, with the development of cyber‐physical systems and the well‐developed continuous‐time control techniques, the continuous‐time distributed optimization algorithms have attracted much attention recently [20–27]. Moreover, the continuous‐time multi‐agent systems correspond to the steepest descent direction of the local cost function.…”
Section: Introductionmentioning
confidence: 99%
“…Nonetheless, the results in the above literature focus on the time-invariant loads, but the time-varying loads are commonly encountered in many practical applications. There are few results on time-varying loads [22][23][24]. The authors of [22] presented a distributed coordination algorithm which was able to track time-varying loads.…”
Section: Introductionmentioning
confidence: 99%
“…Penalty functions are often used to deal with inequality constraints by incorporating the inequality constraints into the objective function. To deal with the local allocation feasibility constraint and gain access to the gradient based minimization techniques, a smooth penalty function p i : R → R is used to punish the violation on the constraint y ≤ 0 [136]…”
Section: With Local Allocation Feasibility Constraint Under Strongly Convex Objective Functionsmentioning
confidence: 99%
“…Since the problem in (5.1) is convex and the constraints are linear, the optimal values of the Lagrange multipliers are bounded [15]. If κ > max{α * i , β * i } for i = 1, ..., n and t ≥ 0, the following condition hold [136] f…”
Section: Distributed Ra With Time-varying Resourcesmentioning
confidence: 99%
See 1 more Smart Citation