Blind Swarms for Coverage in 2-D
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
We consider coverage problems in robot sensor networks with minimal sensing capabilities. In particular, we demonstrate that a “blind ” swarm of robots with no localization and only a weak form of distance estimation can rigorously determine coverage in a bounded planar domain of unknown size and shape. The methods we introduce come from algebraic topology. I. COVERAGE PROBLEMS Many of the potential applications of robot swarms require information about coverage in a given domain. For example, using a swarm of robot sensors for surveillance and security applications carries with it the charge to maximize, or, preferably, guarantee coverage. Such applications include networks of security cameras, mine field sweeping via networked robots [18], and oceanographic sampling [4]. In these contexts, each
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Zomorodian, A., & Carlsson, G. (2005) · Discrete & Computational Geometry · doi:10.1007/s00454-004-1146-y · Cited by 1,591
Existence of minimal models for varieties of log general type
Birkar, C., Cascini, P., Hacon, C., & McKernan, J. (2009) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-09-00649-3 · Cited by 1,278
Flip theorem and the existence of minimal models for 3-folds
Mori, S. (1988) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-1988-0924704-x · Cited by 313
Shokurov, V. V. (1996) · Journal of Mathematical Sciences · doi:10.1007/bf02362335 · Cited by 135
Cited by
Coverage in sensor networks via persistent homology
de Silva, V., & Ghrist, R. (2007) · Algebraic & Geometric Topology · doi:10.2140/agt.2007.7.339 · Cited by 422
“Figure 1 gives a fundamental class of examples for which the Rips complex fails to capture the Čech complex.”
BackgroundInfluentialSelf-citationThe theory of multidimensional persistence
Carlsson, G., & Zomorodian, A. (2007) · Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 · doi:10.1145/1247069.1247105 · Cited by 299
“This is the key reason for the current popularity of persistent homology for solving problems in diverse disciplines, such as shape description [4], denoising volumetric density data [13], detecting holes in sensor networks [6], and analyzing the structure of natural images [5].”
The Theory of Multidimensional Persistence
Carlsson, G., & Zomorodian, A. (2009) · Discrete & Computational Geometry · doi:10.1007/s00454-009-9176-0 · Cited by 270
Cang, Z., Mu, L., & Wei, G.-W. (2018) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005929 · Cited by 257
Persistent homology analysis of protein structure, flexibility, and folding
Xia, K., & Wei, G. (2014) · International Journal for Numerical Methods in Biomedical Engineering · doi:10.1002/cnm.2655 · Cited by 254
“It has been applied to a variety of domains, including image analysis [48–51], image retrieval [52], chaotic dynamics verification [53, 54], sensor network [55], complex network [56, 57], data analysis [58–62], computer vision [50], shape recognition [63], and computational biology [64–66].”
Background
Metadata
- Authors
- de Silva, V., Ghrist, R., & Muhammad, A.
- Venue
- Robotics: Science and Systems I
- Published
- 2005-06-08
- OpenAlex
- W95757166
- Cited by
- 78
- References
- 4
- FWCI
- 18.20
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Blind Swarms for Coverage in 2-D. https://app.cochat.ai/papers/10.15607/rss.2005.i.044
- The paper
- de Silva, V., Ghrist, R., & Muhammad, A. (2005). Blind Swarms for Coverage in 2-D. Robotics: Science and Systems I. https://doi.org/10.15607/rss.2005.i.044
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.