Minimizing movement to establish the connectivity of randomly deployed robots

K. Selim Engin; Volkan I Isler

Minimizing movement to establish the connectivity of randomly deployed robots

K. Selim Engin, Volkan I Isler

Computer Science and Engineering

Research output: Contribution to journal › Conference article › peer-review

2 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 language	English (US)
Pages (from-to)	451-458
Number of pages	8
Journal	Proceedings International Conference on Automated Planning and Scheduling, ICAPS
Volume	2018-June
State	Published - Jan 1 2018
Event	28th International Conference on Automated Planning and Scheduling, ICAPS 2018 - Delft, Netherlands Duration: Jun 24 2018 → Jun 29 2018

OpenUrl availability

Full text

Cite this

@article{d88b15d19e2746a8adab99966a254b1b,

title = "Minimizing movement to establish the connectivity of randomly deployed robots",

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.",

author = "{Selim Engin}, K. and Isler, {Volkan I}",

year = "2018",

month = jan,

day = "1",

language = "English (US)",

volume = "2018-June",

pages = "451--458",

journal = "Proceedings International Conference on Automated Planning and Scheduling, ICAPS",

issn = "2334-0835",

note = "28th International Conference on Automated Planning and Scheduling, ICAPS 2018 ; Conference date: 24-06-2018 Through 29-06-2018",

}

TY - JOUR

T1 - Minimizing movement to establish the connectivity of randomly deployed robots

AU - Selim Engin, K.

AU - Isler, Volkan I

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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.

AB - 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.

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

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

M3 - Conference article

AN - SCOPUS:85054988669

SN - 2334-0835

VL - 2018-June

SP - 451

EP - 458

JO - Proceedings International Conference on Automated Planning and Scheduling, ICAPS

JF - Proceedings International Conference on Automated Planning and Scheduling, ICAPS

T2 - 28th International Conference on Automated Planning and Scheduling, ICAPS 2018

Y2 - 24 June 2018 through 29 June 2018

ER -

Minimizing movement to establish the connectivity of randomly deployed robots

Abstract

OpenUrl availability

Other files and links

Fingerprint

Cite this