Standard

АЛГОРИТМЫ РАЗМЕЩЕНИЯ МОБИЛЬНЫХ АГЕНТОВ НА ОТРЕЗКЕ В УСЛОВИЯХ КОММУНИКАЦИОННОГО ЗАПАЗДЫВАНИЯ И ПЕРЕКЛЮЧЕНИЙ СЕТЕВОЙ ТОПОЛОГИИ. / Александров, Александр Юрьевич; Андриянова, Наталья Романовна; Рузин, Сергей Борисович.

в: Известия Института математики и информатики Удмуртского государственного университета, Том 66, 20.11.2025, стр. 3-15.

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

Harvard

Александров, АЮ, Андриянова, НР & Рузин, СБ 2025, 'АЛГОРИТМЫ РАЗМЕЩЕНИЯ МОБИЛЬНЫХ АГЕНТОВ НА ОТРЕЗКЕ В УСЛОВИЯХ КОММУНИКАЦИОННОГО ЗАПАЗДЫВАНИЯ И ПЕРЕКЛЮЧЕНИЙ СЕТЕВОЙ ТОПОЛОГИИ', Известия Института математики и информатики Удмуртского государственного университета, Том. 66, стр. 3-15. https://doi.org/10.35634/2226-3594-2025-66-01

APA

Александров, А. Ю., Андриянова, Н. Р., & Рузин, С. Б. (2025). АЛГОРИТМЫ РАЗМЕЩЕНИЯ МОБИЛЬНЫХ АГЕНТОВ НА ОТРЕЗКЕ В УСЛОВИЯХ КОММУНИКАЦИОННОГО ЗАПАЗДЫВАНИЯ И ПЕРЕКЛЮЧЕНИЙ СЕТЕВОЙ ТОПОЛОГИИ. Известия Института математики и информатики Удмуртского государственного университета, 66, 3-15. https://doi.org/10.35634/2226-3594-2025-66-01

Vancouver

Александров АЮ, Андриянова НР, Рузин СБ. АЛГОРИТМЫ РАЗМЕЩЕНИЯ МОБИЛЬНЫХ АГЕНТОВ НА ОТРЕЗКЕ В УСЛОВИЯХ КОММУНИКАЦИОННОГО ЗАПАЗДЫВАНИЯ И ПЕРЕКЛЮЧЕНИЙ СЕТЕВОЙ ТОПОЛОГИИ. Известия Института математики и информатики Удмуртского государственного университета. 2025 Нояб. 20;66:3-15. https://doi.org/10.35634/2226-3594-2025-66-01

Author

Александров, Александр Юрьевич ; Андриянова, Наталья Романовна ; Рузин, Сергей Борисович. / АЛГОРИТМЫ РАЗМЕЩЕНИЯ МОБИЛЬНЫХ АГЕНТОВ НА ОТРЕЗКЕ В УСЛОВИЯХ КОММУНИКАЦИОННОГО ЗАПАЗДЫВАНИЯ И ПЕРЕКЛЮЧЕНИЙ СЕТЕВОЙ ТОПОЛОГИИ. в: Известия Института математики и информатики Удмуртского государственного университета. 2025 ; Том 66. стр. 3-15.

BibTeX

@article{1791e9179f3040cd929f09f9601f6a89,
title = "АЛГОРИТМЫ РАЗМЕЩЕНИЯ МОБИЛЬНЫХ АГЕНТОВ НА ОТРЕЗКЕ В УСЛОВИЯХ КОММУНИКАЦИОННОГО ЗАПАЗДЫВАНИЯ И ПЕРЕКЛЮЧЕНИЙ СЕТЕВОЙ ТОПОЛОГИИ",
abstract = "A group of mobile agents on a straight line is considered. First- and second-order integrators are used as agent models. Decentralized control protocols are proposed that provide both uniform and specified nonlinear uniform (uniform with respect to some function) deployment of agents on a straight-line segment. The construction of these protocols is based on information received by agents about the position of their neighbors, and this information comes not directly, but through auxiliary agents. In addition, there is a constant delay in signals from neighbors and communications between agents can be destroyed and restored at arbitrary instants of time. Using methods of positive systems theory and the Lyapunov–Krasovsky functional method, it is proved that the proposed control algorithms are robust with respect to communication delay and network topology switching.",
author = "Александров, {Александр Юрьевич} and Андриянова, {Наталья Романовна} and Рузин, {Сергей Борисович}",
year = "2025",
month = nov,
day = "20",
doi = "10.35634/2226-3594-2025-66-01",
language = "русский",
volume = "66",
pages = "3--15",
journal = "Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta",
issn = "2226-3594",
publisher = "Удмуртский государственный университет",

}

RIS

TY - JOUR

T1 - АЛГОРИТМЫ РАЗМЕЩЕНИЯ МОБИЛЬНЫХ АГЕНТОВ НА ОТРЕЗКЕ В УСЛОВИЯХ КОММУНИКАЦИОННОГО ЗАПАЗДЫВАНИЯ И ПЕРЕКЛЮЧЕНИЙ СЕТЕВОЙ ТОПОЛОГИИ

AU - Александров, Александр Юрьевич

AU - Андриянова, Наталья Романовна

AU - Рузин, Сергей Борисович

PY - 2025/11/20

Y1 - 2025/11/20

N2 - A group of mobile agents on a straight line is considered. First- and second-order integrators are used as agent models. Decentralized control protocols are proposed that provide both uniform and specified nonlinear uniform (uniform with respect to some function) deployment of agents on a straight-line segment. The construction of these protocols is based on information received by agents about the position of their neighbors, and this information comes not directly, but through auxiliary agents. In addition, there is a constant delay in signals from neighbors and communications between agents can be destroyed and restored at arbitrary instants of time. Using methods of positive systems theory and the Lyapunov–Krasovsky functional method, it is proved that the proposed control algorithms are robust with respect to communication delay and network topology switching.

AB - A group of mobile agents on a straight line is considered. First- and second-order integrators are used as agent models. Decentralized control protocols are proposed that provide both uniform and specified nonlinear uniform (uniform with respect to some function) deployment of agents on a straight-line segment. The construction of these protocols is based on information received by agents about the position of their neighbors, and this information comes not directly, but through auxiliary agents. In addition, there is a constant delay in signals from neighbors and communications between agents can be destroyed and restored at arbitrary instants of time. Using methods of positive systems theory and the Lyapunov–Krasovsky functional method, it is proved that the proposed control algorithms are robust with respect to communication delay and network topology switching.

UR - https://www.elibrary.ru/item.asp?id=83238867

UR - https://www.mendeley.com/catalogue/9690e340-58eb-31c9-95a5-254a1d72edfa/

U2 - 10.35634/2226-3594-2025-66-01

DO - 10.35634/2226-3594-2025-66-01

M3 - статья

VL - 66

SP - 3

EP - 15

JO - Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta

JF - Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta

SN - 2226-3594

ER -

ID: 144831564