Minimizing movement to establish the connectivity of randomly deployed robots

K. Selim Engin, Volkan I Isler

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations

Abstract

We study the following connectivity formation problem: Robots equipped with radio transmitters with a bounded communication range are scattered over a large area. They would like to relocate so as to form a connected network as soon as possible. Where should each robot move? We present an O(√n)-factor approximation algorithm for this problem when n robots are initially distributed uniformly at random in a bounded area. In addition to analytical proofs, we verify the performance of our algorithm through simulations.

Original languageEnglish (US)
Pages (from-to)451-458
Number of pages8
JournalProceedings International Conference on Automated Planning and Scheduling, ICAPS
Volume2018-June
StatePublished - Jan 1 2018
Event28th International Conference on Automated Planning and Scheduling, ICAPS 2018 - Delft, Netherlands
Duration: Jun 24 2018Jun 29 2018

Fingerprint

Dive into the research topics of 'Minimizing movement to establish the connectivity of randomly deployed robots'. Together they form a unique fingerprint.

Cite this