The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Efficient Multi-robot Search for a Moving Target
Open accessAbstract
This paper examines the problem of locating a mobile, non-adversarial target in an indoor environment using multiple robotic searchers. One way to formulate this problem is to assume a known environment and choose searcher paths most likely to intersect with the path taken by the target. We refer to this as the multi-robot efficient search path planning (MESPP) problem. Such path planning prob lems are NP-hard, and optimal solutions typically scale exponentially in the number of searchers. We present an approximation al gorithm that utilizes finite-horizon planning and implicit coordination to achieve linear scalability in the number of searchers. We prove that solving the MESPP problem requires maximizing a non-decreasing, submodular objective function, which leads to theoretical bounds on the performance of our approximation algorithm. We extend our analysis by considering the scenario where searchers are given noisy non-line-of-sight ranging measurements to the target. For this scenario, we derive and integrate online Bayesian measurement updating into our framework. We demonstrate the performance of our framework in two large-scale simulated environments, and we further validate our results using data from a novel ultra-wideband ranging sensor. Finally, we provide an analysis that demonstrates the relationship between MESPP and the intuitive average capture time metric. Results show that our proposed linearly scalable approximation algorithm generates searcher paths that are competitive with those generated by exponential algorithms.
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
Finding approximate POMDP solutions through belief compression
Roy, N., Gordon, G., & Thrun, S. (2005) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1496 · Cited by 254
Cited by
A Survey and Analysis of Multi-Robot Coordination
Yan, Z., Jouandeau, N., & Cherif, A. A. (2013) · International Journal of Advanced Robotic Systems · doi:10.5772/57313 · Cited by 647
Search and pursuit-evasion in mobile robotics: A survey
Chung, T. H., Hollinger, G. A., & Isler, V. (2011) · Autonomous Robots · doi:10.1007/s10514-011-9241-4 · Cited by 535
Self-citationSampling-based robotic information gathering algorithms
Hollinger, G. A., & Sukhatme, G. S. (2014) · The International Journal of Robotics Research · doi:10.1177/0278364914533443 · Cited by 334
Self-citationMulti-robot target detection and tracking: taxonomy and survey
Robin, C., & Lacroix, S. (2016) · Autonomous Robots · doi:10.1007/s10514-015-9491-7 · Cited by 290
Metadata
- Authors
- Hollinger, G., Singh, S., Djugash, J., & Kehagias, A.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2009-02
- Volume
- 28
- Issue
- 2
- Pages
- 201-219
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W2087421501
- Cited by
- 158
- References
- 1
- FWCI
- 8.80
- Type
- journal article
- Language
- en
- Open access
- green
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: Efficient Multi-robot Search for a Moving Target. https://app.cochat.ai/papers/10.1177/0278364908099853
- The paper
- Hollinger, G., Singh, S., Djugash, J., & Kehagias, A. (2009). Efficient Multi-robot Search for a Moving Target. The International Journal of Robotics Research. https://doi.org/10.1177/0278364908099853
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.