The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On the Optimal Robot Routing Problem in Wireless Sensor Networks
Abstract
Given a set of sparsely distributed sensors in the Euclidean plane, a mobile robot is required to visit all sensors to download the data and finally return to its base. The effective range of each sensor is specified by a disk, and the robot must at least reach the boundary to start communication. The primary goal of optimization in this scenario is to minimize the traveling distance by the robot. This problem can be regarded as a special case of the traveling salesman problem with neighborhoods (TSPN), which is known to be NP-hard. In this paper, we present a novel TSPN algorithm for this class of TSPN, which can yield significantly improved results compared to the latest approximation algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Cited by
Spatiotemporal Data Mining: A Computational Perspective
Shekhar, S., Jiang, Z., Ali, R., Eftelioglu, E., Tang, X., Gunturi, V., & Zhou, X. (2015) · ISPRS International Journal of Geo-Information · doi:10.3390/ijgi4042306 · Cited by 206
Metadata
- Authors
- Yuan, B., Orlowska, M., & Sadiq, S.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2007-09
- Volume
- 19
- Issue
- 9
- Pages
- 1252-1261
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2117257995
- Cited by
- 270
- References
- 1
- FWCI
- 19.17
- Type
- journal article
- 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: On the Optimal Robot Routing Problem in Wireless Sensor Networks. https://app.cochat.ai/papers/10.1109/tkde.2007.1062
- The paper
- Yuan, B., Orlowska, M., & Sadiq, S. (2007). On the Optimal Robot Routing Problem in Wireless Sensor Networks. IEEE Transactions on Knowledge and Data Engineering. https://doi.org/10.1109/tkde.2007.1062
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.
