2014 American Control Conference 2014
DOI: 10.1109/acc.2014.6859190
|View full text |Cite
|
Sign up to set email alerts
|

Dispatch of distributed generators under local-information constraints

Abstract: Distributed optimization problems are generally described as the minimization of a global objective function in a system, where each agent can get information only from a neighborhood defined by a network topology. To solve this problem, we present a local strategy based on population dynamics (i.e., the local replicator equation (LRE)), to define functions and tasks assigned to each node in a system represented by a connected graph. To show the application of the proposed strategy, we implement the LRE to sol… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
21
0
1

Year Published

2015
2015
2019
2019

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 28 publications
(22 citation statements)
references
References 18 publications
0
21
0
1
Order By: Relevance
“…On the other hand, the coverage of the total demand is respected because the set ∆ is also invariant under the distributed replicator dynamics equation. This property has been proved in [71] using some topological properties of the connected graphs to show that iṗ i = 0 when p(0) ∈ ∆. With this property, it is ensured that the demanded power P D is supplied by the DGs in the dispatch process.…”
Section: Distributed Replicator Dynamics For Optimal Dispatchmentioning
confidence: 98%
See 2 more Smart Citations
“…On the other hand, the coverage of the total demand is respected because the set ∆ is also invariant under the distributed replicator dynamics equation. This property has been proved in [71] using some topological properties of the connected graphs to show that iṗ i = 0 when p(0) ∈ ∆. With this property, it is ensured that the demanded power P D is supplied by the DGs in the dispatch process.…”
Section: Distributed Replicator Dynamics For Optimal Dispatchmentioning
confidence: 98%
“…The main stability result has been recently presented in [71] as a proposition, which states the general payoff functions conditions to guarantee the convergence of the method.…”
Section: Distributed Replicator Dynamics For Optimal Dispatchmentioning
confidence: 99%
See 1 more Smart Citation
“…Evolutionary game dynamics has been successfully applied as a tool to solve NP-hard combinatorial optimization problems [16], [17]. Recently, in the energy and power systems domain, authors of [18], [19] introduced an approach for distributed optimal dispatch of distributed generators under communication infrastructure constraints.…”
Section: Introductionmentioning
confidence: 99%
“…In [8], the authors developed a distributed algorithm that is resilient against potential packet drops and applied the algorithm to DER coordination. In [9], a strategy based on the local replicator equation was presented for economic dispatch of DGs. Other algorithms that can be applied to the DER coordination include the leaderfollower consensus algorithm [10], two-level incremental cost consensus algorithm [11], distributed algorithm based on the consensus and bisection method [12], and minimum-time consensus algorithm [13], just to name a few.…”
Section: Introductionmentioning
confidence: 99%