Standard

Adjustment of Consensus Protocol Step-Size in a Network System with Different Task Priorities via SPSA-like Algorithm under the Cost Constraints. / Amelina, Natalia; Granichin, Oleg; Granichina, Olga; Ivanskiy, Yury; Jiang, Yuming.

в: IFAC-PapersOnLine, Том 51, № 23, 01.01.2018, стр. 100-105.

Результаты исследований: Научные публикации в периодических изданияхстатьяРецензирование

Harvard

APA

Vancouver

Author

Amelina, Natalia ; Granichin, Oleg ; Granichina, Olga ; Ivanskiy, Yury ; Jiang, Yuming. / Adjustment of Consensus Protocol Step-Size in a Network System with Different Task Priorities via SPSA-like Algorithm under the Cost Constraints. в: IFAC-PapersOnLine. 2018 ; Том 51, № 23. стр. 100-105.

BibTeX

@article{cb25d90973364ebbb0ed6ae959833019,
title = "Adjustment of Consensus Protocol Step-Size in a Network System with Different Task Priorities via SPSA-like Algorithm under the Cost Constraints",
abstract = "A multi-agent network system of different computing nodes processing tasks of different priority levels is considered. Agents exchange information about their states in presence of noise in communication channels in the system with switching topology. Load balancing problem in the network for each priority level is formulated as differentiated consensuses achievement problem and solved via local voting protocol. The stochastic approximation type algorithm is used to adjust step-size of proposed protocol for each priority level. Simulation example demonstrating step-size adjustment is provided.",
keywords = "Consensus achievement, Mult-Agent Systems, Stochastic Approximation",
author = "Natalia Amelina and Oleg Granichin and Olga Granichina and Yury Ivanskiy and Yuming Jiang",
year = "2018",
month = jan,
day = "1",
doi = "10.1016/j.ifacol.2018.12.018",
language = "English",
volume = "51",
pages = "100--105",
journal = "IFAC-PapersOnLine",
issn = "2405-8971",
publisher = "Elsevier",
number = "23",

}

RIS

TY - JOUR

T1 - Adjustment of Consensus Protocol Step-Size in a Network System with Different Task Priorities via SPSA-like Algorithm under the Cost Constraints

AU - Amelina, Natalia

AU - Granichin, Oleg

AU - Granichina, Olga

AU - Ivanskiy, Yury

AU - Jiang, Yuming

PY - 2018/1/1

Y1 - 2018/1/1

N2 - A multi-agent network system of different computing nodes processing tasks of different priority levels is considered. Agents exchange information about their states in presence of noise in communication channels in the system with switching topology. Load balancing problem in the network for each priority level is formulated as differentiated consensuses achievement problem and solved via local voting protocol. The stochastic approximation type algorithm is used to adjust step-size of proposed protocol for each priority level. Simulation example demonstrating step-size adjustment is provided.

AB - A multi-agent network system of different computing nodes processing tasks of different priority levels is considered. Agents exchange information about their states in presence of noise in communication channels in the system with switching topology. Load balancing problem in the network for each priority level is formulated as differentiated consensuses achievement problem and solved via local voting protocol. The stochastic approximation type algorithm is used to adjust step-size of proposed protocol for each priority level. Simulation example demonstrating step-size adjustment is provided.

KW - Consensus achievement

KW - Mult-Agent Systems

KW - Stochastic Approximation

UR - http://www.scopus.com/inward/record.url?scp=85058468037&partnerID=8YFLogxK

U2 - 10.1016/j.ifacol.2018.12.018

DO - 10.1016/j.ifacol.2018.12.018

M3 - Article

AN - SCOPUS:85058468037

VL - 51

SP - 100

EP - 105

JO - IFAC-PapersOnLine

JF - IFAC-PapersOnLine

SN - 2405-8971

IS - 23

ER -

ID: 35254299