2019
DOI: 10.1007/s10462-019-09695-7
|View full text |Cite
|
Sign up to set email alerts
|

Multi-agent system for microgrids: design, optimization and performance

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
19
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 48 publications
(19 citation statements)
references
References 127 publications
0
19
0
Order By: Relevance
“…• Locally storage of user's energy information and decision-making will protect consumer's privacy and alleviate network usage, and therefore the communication bandwidth requirement will be more relaxed. 37 As an optimization problem, the nature of MGDC requires distributed optimization unlike the conventional form, which is used in MGCC. Generally, distributed optimization techniques can be categorized into four main divisions.…”
Section: Distributed Emsmentioning
confidence: 99%
“…• Locally storage of user's energy information and decision-making will protect consumer's privacy and alleviate network usage, and therefore the communication bandwidth requirement will be more relaxed. 37 As an optimization problem, the nature of MGDC requires distributed optimization unlike the conventional form, which is used in MGCC. Generally, distributed optimization techniques can be categorized into four main divisions.…”
Section: Distributed Emsmentioning
confidence: 99%
“…Contrarily, having a relatively small number of agents results in a faster convergence and a lower system latency. 27 Some references use MAS in order to improve the reactive power sharing. The improvement occurs through the interaction between the primary and the secondary control by using an additional variable in the consensus, 17 an adaptive virtual impedance, 18 and an adaptive droop gain event-triggered.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Besides, conventional mathematical modelling schemes are usually used for solving static problems, and in the case of dynamic problems, it is necessary to remodel once the problems change [10]. Accordingly, the conventional modelling method has some limitations and cannot fit the solution of such problems [11].…”
Section: Complex External Situationmentioning
confidence: 99%
“…e reusable resource conflict coordination mechanism can be used by multiple decision-making agents simultaneously to generate repeated resource conflicts. For these resource conflicts, the tasks exhibiting higher priority are reserved and the tasks with lower priorities are coordinated (1) Procedure MA-HTN (s, T, D) (2) set s, initial state (3) set T, initial task set (4) set D, domain (5) initial operator ActionID � 0 (6) set P � the empty plan (7) T 0 ⟵ t belongs to T : no other task in T is constrained to precede t (8) loop (9) if T is empty then return P (10) nondeterministically choose any t in T 0 (11) if t is a primitive task then (12) choose a ground instance a for t with the smallest cost among the available resources (13) ActionID � ActionID + 1 (14) opmessage(a) � (ID, Resourceused(a), st(a), et(a), cost(a)) (15) sendlist ⟵ opmessage(a) (16) send opmessage(a) to the other planners (17) if receivelist ≠ ∅ : (18) ResourceID � Resourceused(a) (19) conflict actions a′ ⟵ a′ belongs to the extopmessages of receivelist : (20) has Resource(a′) � ResourceusedID and has the smallest st(a′) (21) and duration(st, et) is overlapped with duration(st′, et′)}, then (22) if st < st′ (23) delete the rest extopmessage in receivelist (24) Resourcestate(r) � i, Resourcest(r) � st, Resourceet(r) � et (25) delete T in T 0 and add a into P (26) else if st > st′ (27) delete opmessage(a) in sendlist (28) Resourcestate(r) � i′, Resourcest(r) � st′, Resourceet(r) � et′ (29) Backtrack (30) else delete T in T 0 and add a into P (31) if t is a nonprimitive task then (32) choose a method to decompose t into subtasks t 1 , t 2 , . .…”
Section: Coordination Mechanism Of Local Conflicts For the Contradicmentioning
confidence: 99%