Communication coverage for independently moving robots

Stephanie Gil, Dan Feldman, Daniela Rus

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

15 Citations (Scopus)

Abstract

We consider the task of providing communication coverage to a group of sensing robots (sensors) moving independently to collect data. We provide communication via controlled placement of router vehicles that relay messages from any sensor to any other sensor in the system under the assumptions of 1) no cooperation from the sensors, and 2) only sensor-router or router-router communication over a maximum distance of R is reliable. We provide a formal framework and design provable exact and approximate (faster) algorithms for finding optimal router vehicle locations that are updated according to sensor movement. Using vehicle limitations, such as bounded control effort and maximum velocities of the sensors, our algorithm approximates areas that each router can reach while preserving connectivity and returns an expiration time window over which these positions are guaranteed to maintain communication of the entire system. The expiration time is compared against computation time required to update positions as a decision variable for choosing either the exact or approximate solution for maintaining connectivity with the sensors on-line.

Original languageEnglish (US)
Title of host publication2012 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2012
Pages4865-4872
Number of pages8
DOIs
StatePublished - Dec 1 2012
Externally publishedYes
Event25th IEEE/RSJ International Conference on Robotics and Intelligent Systems, IROS 2012 - Vilamoura, Algarve, Portugal
Duration: Oct 7 2012Oct 12 2012

Other

Other25th IEEE/RSJ International Conference on Robotics and Intelligent Systems, IROS 2012
CountryPortugal
CityVilamoura, Algarve
Period10/7/1210/12/12

Fingerprint

Routers
Robots
Communication
Sensors

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Software
  • Computer Vision and Pattern Recognition
  • Computer Science Applications

Cite this

Gil, S., Feldman, D., & Rus, D. (2012). Communication coverage for independently moving robots. In 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2012 (pp. 4865-4872). [6386226] https://doi.org/10.1109/IROS.2012.6386226

Communication coverage for independently moving robots. / Gil, Stephanie; Feldman, Dan; Rus, Daniela.

2012 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2012. 2012. p. 4865-4872 6386226.

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

Gil, S, Feldman, D & Rus, D 2012, Communication coverage for independently moving robots. in 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2012., 6386226, pp. 4865-4872, 25th IEEE/RSJ International Conference on Robotics and Intelligent Systems, IROS 2012, Vilamoura, Algarve, Portugal, 10/7/12. https://doi.org/10.1109/IROS.2012.6386226
Gil S, Feldman D, Rus D. Communication coverage for independently moving robots. In 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2012. 2012. p. 4865-4872. 6386226 https://doi.org/10.1109/IROS.2012.6386226
Gil, Stephanie ; Feldman, Dan ; Rus, Daniela. / Communication coverage for independently moving robots. 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2012. 2012. pp. 4865-4872
@inproceedings{3bab2c3974a843b9969ef9ff08176614,
title = "Communication coverage for independently moving robots",
abstract = "We consider the task of providing communication coverage to a group of sensing robots (sensors) moving independently to collect data. We provide communication via controlled placement of router vehicles that relay messages from any sensor to any other sensor in the system under the assumptions of 1) no cooperation from the sensors, and 2) only sensor-router or router-router communication over a maximum distance of R is reliable. We provide a formal framework and design provable exact and approximate (faster) algorithms for finding optimal router vehicle locations that are updated according to sensor movement. Using vehicle limitations, such as bounded control effort and maximum velocities of the sensors, our algorithm approximates areas that each router can reach while preserving connectivity and returns an expiration time window over which these positions are guaranteed to maintain communication of the entire system. The expiration time is compared against computation time required to update positions as a decision variable for choosing either the exact or approximate solution for maintaining connectivity with the sensors on-line.",
author = "Stephanie Gil and Dan Feldman and Daniela Rus",
year = "2012",
month = "12",
day = "1",
doi = "10.1109/IROS.2012.6386226",
language = "English (US)",
isbn = "9781467317375",
pages = "4865--4872",
booktitle = "2012 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2012",

}

TY - GEN

T1 - Communication coverage for independently moving robots

AU - Gil, Stephanie

AU - Feldman, Dan

AU - Rus, Daniela

PY - 2012/12/1

Y1 - 2012/12/1

N2 - We consider the task of providing communication coverage to a group of sensing robots (sensors) moving independently to collect data. We provide communication via controlled placement of router vehicles that relay messages from any sensor to any other sensor in the system under the assumptions of 1) no cooperation from the sensors, and 2) only sensor-router or router-router communication over a maximum distance of R is reliable. We provide a formal framework and design provable exact and approximate (faster) algorithms for finding optimal router vehicle locations that are updated according to sensor movement. Using vehicle limitations, such as bounded control effort and maximum velocities of the sensors, our algorithm approximates areas that each router can reach while preserving connectivity and returns an expiration time window over which these positions are guaranteed to maintain communication of the entire system. The expiration time is compared against computation time required to update positions as a decision variable for choosing either the exact or approximate solution for maintaining connectivity with the sensors on-line.

AB - We consider the task of providing communication coverage to a group of sensing robots (sensors) moving independently to collect data. We provide communication via controlled placement of router vehicles that relay messages from any sensor to any other sensor in the system under the assumptions of 1) no cooperation from the sensors, and 2) only sensor-router or router-router communication over a maximum distance of R is reliable. We provide a formal framework and design provable exact and approximate (faster) algorithms for finding optimal router vehicle locations that are updated according to sensor movement. Using vehicle limitations, such as bounded control effort and maximum velocities of the sensors, our algorithm approximates areas that each router can reach while preserving connectivity and returns an expiration time window over which these positions are guaranteed to maintain communication of the entire system. The expiration time is compared against computation time required to update positions as a decision variable for choosing either the exact or approximate solution for maintaining connectivity with the sensors on-line.

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

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

U2 - 10.1109/IROS.2012.6386226

DO - 10.1109/IROS.2012.6386226

M3 - Conference contribution

SN - 9781467317375

SP - 4865

EP - 4872

BT - 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2012

ER -