Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Multi-robot monitoring in dynamic environments with guaranteed currency of observations

Multi-robot monitoring in dynamic environments with guaranteed currency of observations

Thumbnail Image
Download
Name

Rus_Multi-robot monitoring.pdf

Size

552.91 KB

Format

Adobe PDF

Checksum (MD5)

6ff59b75e7fe57d47876b9f011adf225

Author(s)
Smith, Stephen L.
•
Rus, Daniela L.
Date Issued
February 2011
Journal
49th IEEE Conference on Decision and Control (CDC), 2010
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Smith, Stephen L., and Daniela Rus. “Multi-robot Monitoring in Dynamic Environments with Guaranteed Currency of Observations.” 49th IEEE Conference on Decision and Control (CDC), 2010. 514–521.
Version
Final published version
Abstract
In this paper we consider the problem of monitoring a known set of stationary features (or locations of interest) in an environment. To observe a feature, a robot must visit its location. Each feature changes over time, and we assume that the currency, or accuracy of an observation decays linearly with time. Thus, robots must repeatedly visit the features to update their observations. Each feature has a known rate of change, and so the frequency of visits to a feature should be proportional to its rate. The goal is to route the robots so as to minimize the maximum change of a feature between observations. We focus on the asymptotic regime of a large number of features distributed according to a probability density function. In this regime we determine a lower bound on the maximum change of a feature between visits, and develop a robot control policy that, with probability one, performs within a factor of two of the optimal. We also provide a single robot lower bound which holds outside of the asymptotic regime, and present a heuristic algorithm motivated by our asymptotic analysis.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
http://hdl.handle.net/1721.1/72579
DOI of Published Version
https://doi.org/10.1109/CDC.2010.5717132
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.