K-robots clustering of moving sensors using coresets
We present an approach to position k servers (e.g. mobile robots) to provide a service to n independently moving clients; for example, in mobile ad-hoc networking applications where inter-agent distances need to be minimized, connectivity constraints exist between servers, and no a priori knowledge...
Main Authors: | Feldman, Dan (Contributor), Gil, Stephanie (Contributor), Knepper, Ross A. (Contributor), Julian, Brian John (Contributor), Rus, Daniela L. (Contributor) |
---|---|
Other Authors: | Lincoln Laboratory (Contributor), Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. School of Engineering (Contributor) |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers (IEEE),
2014-10-07T18:19:28Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Coresets for differentially private k-means clustering and applications to privacy in mobile sensor networks
by: Feldman, Dan, et al.
Published: (2021) -
Coresets for k-Segmentation of Streaming Data
by: Rosman, Guy, et al.
Published: (2016) -
An effective coreset compression algorithm for large scale sensor networks
by: Feldman, Dan, et al.
Published: (2012) -
On coresets for support vector machines
by: Tukan, Murad, et al.
Published: (2022) -
Visual precis generation using coresets
by: Paul, Rohan, et al.
Published: (2016)