Asynchronous network formation in unknown unbounded environments

Selim Engin, Volkan Isler

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we study the Online Network Formation Problem (ONFP) for a mobile multi-robot system. Consider a group of robots with a bounded communication range operating in a large open area. One of the robots has a piece of information which has to be propagated to all other robots. What strategy should the robots pursue to disseminate the information to the rest of the robots as quickly as possible? The initial locations of the robots are unknown to each other, therefore the problem must be solved in an online fashion. For this problem, we present an algorithm whose competitive ratio is O(H \cdot\max\{M,\ \sqrt{MH}\}) for arbitrary robot deployments, where M is the largest edge length in the Euclidean minimum spanning tree on the initial robot configuration and H is the height of the tree. We also study the case when the robot initial positions are chosen uniformly at random and improve the ratio to O(M). Finally, we present simulation results to validate the performance in larger scales and demonstrate our algorithm using three robots in a field experiment.

Original languageEnglish (US)
Title of host publication2019 International Conference on Robotics and Automation, ICRA 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2011-2017
Number of pages7
ISBN (Electronic)9781538660263
DOIs
StatePublished - May 2019
Event2019 International Conference on Robotics and Automation, ICRA 2019 - Montreal, Canada
Duration: May 20 2019May 24 2019

Publication series

NameProceedings - IEEE International Conference on Robotics and Automation
Volume2019-May
ISSN (Print)1050-4729

Conference

Conference2019 International Conference on Robotics and Automation, ICRA 2019
CountryCanada
CityMontreal
Period5/20/195/24/19

Fingerprint

Robots
Communication

Cite this

Engin, S., & Isler, V. (2019). Asynchronous network formation in unknown unbounded environments. In 2019 International Conference on Robotics and Automation, ICRA 2019 (pp. 2011-2017). [8794031] (Proceedings - IEEE International Conference on Robotics and Automation; Vol. 2019-May). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICRA.2019.8794031

Asynchronous network formation in unknown unbounded environments. / Engin, Selim; Isler, Volkan.

2019 International Conference on Robotics and Automation, ICRA 2019. Institute of Electrical and Electronics Engineers Inc., 2019. p. 2011-2017 8794031 (Proceedings - IEEE International Conference on Robotics and Automation; Vol. 2019-May).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Engin, S & Isler, V 2019, Asynchronous network formation in unknown unbounded environments. in 2019 International Conference on Robotics and Automation, ICRA 2019., 8794031, Proceedings - IEEE International Conference on Robotics and Automation, vol. 2019-May, Institute of Electrical and Electronics Engineers Inc., pp. 2011-2017, 2019 International Conference on Robotics and Automation, ICRA 2019, Montreal, Canada, 5/20/19. https://doi.org/10.1109/ICRA.2019.8794031
Engin S, Isler V. Asynchronous network formation in unknown unbounded environments. In 2019 International Conference on Robotics and Automation, ICRA 2019. Institute of Electrical and Electronics Engineers Inc. 2019. p. 2011-2017. 8794031. (Proceedings - IEEE International Conference on Robotics and Automation). https://doi.org/10.1109/ICRA.2019.8794031
Engin, Selim ; Isler, Volkan. / Asynchronous network formation in unknown unbounded environments. 2019 International Conference on Robotics and Automation, ICRA 2019. Institute of Electrical and Electronics Engineers Inc., 2019. pp. 2011-2017 (Proceedings - IEEE International Conference on Robotics and Automation).
@inproceedings{5e72866374554896a99bacd803035693,
title = "Asynchronous network formation in unknown unbounded environments",
abstract = "In this paper, we study the Online Network Formation Problem (ONFP) for a mobile multi-robot system. Consider a group of robots with a bounded communication range operating in a large open area. One of the robots has a piece of information which has to be propagated to all other robots. What strategy should the robots pursue to disseminate the information to the rest of the robots as quickly as possible? The initial locations of the robots are unknown to each other, therefore the problem must be solved in an online fashion. For this problem, we present an algorithm whose competitive ratio is O(H \cdot\max\{M,\ \sqrt{MH}\}) for arbitrary robot deployments, where M is the largest edge length in the Euclidean minimum spanning tree on the initial robot configuration and H is the height of the tree. We also study the case when the robot initial positions are chosen uniformly at random and improve the ratio to O(M). Finally, we present simulation results to validate the performance in larger scales and demonstrate our algorithm using three robots in a field experiment.",
author = "Selim Engin and Volkan Isler",
year = "2019",
month = "5",
doi = "10.1109/ICRA.2019.8794031",
language = "English (US)",
series = "Proceedings - IEEE International Conference on Robotics and Automation",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "2011--2017",
booktitle = "2019 International Conference on Robotics and Automation, ICRA 2019",

}

TY - GEN

T1 - Asynchronous network formation in unknown unbounded environments

AU - Engin, Selim

AU - Isler, Volkan

PY - 2019/5

Y1 - 2019/5

N2 - In this paper, we study the Online Network Formation Problem (ONFP) for a mobile multi-robot system. Consider a group of robots with a bounded communication range operating in a large open area. One of the robots has a piece of information which has to be propagated to all other robots. What strategy should the robots pursue to disseminate the information to the rest of the robots as quickly as possible? The initial locations of the robots are unknown to each other, therefore the problem must be solved in an online fashion. For this problem, we present an algorithm whose competitive ratio is O(H \cdot\max\{M,\ \sqrt{MH}\}) for arbitrary robot deployments, where M is the largest edge length in the Euclidean minimum spanning tree on the initial robot configuration and H is the height of the tree. We also study the case when the robot initial positions are chosen uniformly at random and improve the ratio to O(M). Finally, we present simulation results to validate the performance in larger scales and demonstrate our algorithm using three robots in a field experiment.

AB - In this paper, we study the Online Network Formation Problem (ONFP) for a mobile multi-robot system. Consider a group of robots with a bounded communication range operating in a large open area. One of the robots has a piece of information which has to be propagated to all other robots. What strategy should the robots pursue to disseminate the information to the rest of the robots as quickly as possible? The initial locations of the robots are unknown to each other, therefore the problem must be solved in an online fashion. For this problem, we present an algorithm whose competitive ratio is O(H \cdot\max\{M,\ \sqrt{MH}\}) for arbitrary robot deployments, where M is the largest edge length in the Euclidean minimum spanning tree on the initial robot configuration and H is the height of the tree. We also study the case when the robot initial positions are chosen uniformly at random and improve the ratio to O(M). Finally, we present simulation results to validate the performance in larger scales and demonstrate our algorithm using three robots in a field experiment.

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

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

U2 - 10.1109/ICRA.2019.8794031

DO - 10.1109/ICRA.2019.8794031

M3 - Conference contribution

AN - SCOPUS:85071432436

T3 - Proceedings - IEEE International Conference on Robotics and Automation

SP - 2011

EP - 2017

BT - 2019 International Conference on Robotics and Automation, ICRA 2019

PB - Institute of Electrical and Electronics Engineers Inc.

ER -