Standard

Self-Deployment of Mobile Robotic Networks: An Algorithm for Decentralized Sweep Boundary Coverage. / Semakova, Anna A.; Ovchinnikov, Kirill S.; Matveev, Alexey S.

в: Robotica, Том 35, № 9, 2017, стр. 1816-1844.

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

Harvard

APA

Vancouver

Author

BibTeX

@article{5a74a300af5c4a46bab048ec6cae2197,
title = "Self-Deployment of Mobile Robotic Networks: An Algorithm for Decentralized Sweep Boundary Coverage",
abstract = "Several nonholonomic Dubins-car like robots travel over paths with bounded curvatures in a plane that contains an a priori unknown region. The robots are anonymous to one another and do not use communication facilities. Any of them has access to the current minimum distance to the region and can determine the relative positions and orientations of the other robots within a finite and given visibility range. We present a distributed navigation and guidance strategy under which every robot autonomously converges to the desired minimum distance to the region with always respecting a given safety margin, the robots do not collide with one another and do not get into clusters, and the entire team ultimately sweeps over the respective equidistant curve at a speed exceeding a given threshold, thus forming a kind of a sweeping barrier at the perimeter of the region. Moreover, this strategy provides effective sub-uniform distribution of the robots over the equidistant curve. Mathematically rigorous justification of th",
keywords = "Robot navigation, Sensor-based control, Multi-agent systems, Decentralized control, Sweep barrier coverage",
author = "Semakova, {Anna A.} and Ovchinnikov, {Kirill S.} and Matveev, {Alexey S.}",
year = "2017",
doi = "10.1017/S0263574716000539",
language = "English",
volume = "35",
pages = " 1816--1844",
journal = "Robotica",
issn = "0263-5747",
publisher = "Cambridge University Press",
number = "9",

}

RIS

TY - JOUR

T1 - Self-Deployment of Mobile Robotic Networks: An Algorithm for Decentralized Sweep Boundary Coverage

AU - Semakova, Anna A.

AU - Ovchinnikov, Kirill S.

AU - Matveev, Alexey S.

PY - 2017

Y1 - 2017

N2 - Several nonholonomic Dubins-car like robots travel over paths with bounded curvatures in a plane that contains an a priori unknown region. The robots are anonymous to one another and do not use communication facilities. Any of them has access to the current minimum distance to the region and can determine the relative positions and orientations of the other robots within a finite and given visibility range. We present a distributed navigation and guidance strategy under which every robot autonomously converges to the desired minimum distance to the region with always respecting a given safety margin, the robots do not collide with one another and do not get into clusters, and the entire team ultimately sweeps over the respective equidistant curve at a speed exceeding a given threshold, thus forming a kind of a sweeping barrier at the perimeter of the region. Moreover, this strategy provides effective sub-uniform distribution of the robots over the equidistant curve. Mathematically rigorous justification of th

AB - Several nonholonomic Dubins-car like robots travel over paths with bounded curvatures in a plane that contains an a priori unknown region. The robots are anonymous to one another and do not use communication facilities. Any of them has access to the current minimum distance to the region and can determine the relative positions and orientations of the other robots within a finite and given visibility range. We present a distributed navigation and guidance strategy under which every robot autonomously converges to the desired minimum distance to the region with always respecting a given safety margin, the robots do not collide with one another and do not get into clusters, and the entire team ultimately sweeps over the respective equidistant curve at a speed exceeding a given threshold, thus forming a kind of a sweeping barrier at the perimeter of the region. Moreover, this strategy provides effective sub-uniform distribution of the robots over the equidistant curve. Mathematically rigorous justification of th

KW - Robot navigation

KW - Sensor-based control

KW - Multi-agent systems

KW - Decentralized control

KW - Sweep barrier coverage

U2 - 10.1017/S0263574716000539

DO - 10.1017/S0263574716000539

M3 - Article

VL - 35

SP - 1816

EP - 1844

JO - Robotica

JF - Robotica

SN - 0263-5747

IS - 9

ER -

ID: 7612499