The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
The Belief Roadmap: Efficient Planning in Belief Space by Factoring the Covariance
Open accessAbstract
When a mobile agent does not know its position perfectly, incorporating the predicted uncertainty of future position estimates into the planning process can lead to substantially better motion performance. However, planning in the space of probabilistic position estimates, or belief space, can incur a substantial computational cost. In this paper, we show that planning in belief space can be performed efficiently for linear Gaussian systems by using a factored form of the covariance matrix. This factored form allows several prediction and measurement steps to be combined into a single linear transfer function, leading to very efficient posterior belief prediction during planning. We give a belief-space variant of the probabilistic roadmap algorithm called the belief roadmap (BRM) and show that the BRM can compute plans substantially faster than conventional belief space planning. We conclude with performance results for an agent using ultra-wide bandwidth radio beacons to localize and show that we can efficiently generate plans that avoid failures due to loss of accurate position estimation.
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
A New Approach to Linear Filtering and Prediction Problems
Kalman, R. E. (1960) · Journal of Basic Engineering · doi:10.1115/1.3662552 · Cited by 31,751
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Kavraki, L. E., Svestka, P., Latombe, J.-C., & Overmars, M. H. (1996) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.508439 · Cited by 6,343 · cited 4×
“In contrast, the motion planning community has realized considerable success in using stochastic search to find path s through high-dimensional configuration spaces with algorithms such as the Probabilistic Roadmap (PRM) (Kavraki et al., 1996) or Rapidly-Exploring Randomized Trees (RRT) (LaValle and Kuffner, 2001).”
BackgroundMethodInfluential
Cited by
Deliberation for autonomous robots: A survey
Ingrand, F., & Ghallab, M. (2017) · Artificial Intelligence · doi:10.1016/j.artint.2014.11.003 · Cited by 309
Indelman, V., Carlone, L., & Dellaert, F. (2015) · The International Journal of Robotics Research · doi:10.1177/0278364914561102 · Cited by 154
Patil, S., Kahn, G., Laskey, M., Schulman, J., Goldberg, K., & Abbeel, P. (2015) · Springer Tracts in Advanced Robotics · doi:10.1007/978-3-319-16595-0_30 · Cited by 72
MPTP: Motion-Planning-Aware Task Planning for Navigation in Belief Space
Thomas, A., Mastrogiovanni, F., & Baglietto, M. (2021) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2021.103786 · Cited by 21
Fast minimum uncertainty search on a graph map representation
Carrillo, H., Latif, Y., Neira, J., & Castellanos, J. A. (2012) · 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2012.6385927 · Cited by 20
Metadata
- Authors
- Prentice, S., & Roy, N.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2009-07-21
- Volume
- 28
- Issue
- 11-12
- Pages
- 1448-1465
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W2053833381
- Cited by
- 269
- References
- 2
- FWCI
- 14.29
- 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: The Belief Roadmap: Efficient Planning in Belief Space by Factoring the Covariance. https://app.cochat.ai/papers/10.1177/0278364909341659
- The paper
- Prentice, S., & Roy, N. (2009). The Belief Roadmap: Efficient Planning in Belief Space by Factoring the Covariance. The International Journal of Robotics Research. https://doi.org/10.1177/0278364909341659
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.