The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Rapidly-exploring Random Belief Trees for motion planning under uncertainty
Open accessAbstract
In this paper we address the problem of motion planning in the presence of state uncertainty, also known as planning in belief space. The work is motivated by planning domains involving nontrivial dynamics, spatially varying measurement properties, and obstacle constraints. To make the problem tractable, we restrict the motion plan to a nominal trajectory stabilized with a linear estimator and controller. This allows us to predict distributions over future states given a candidate nominal trajectory. Using these distributions to ensure a bounded probability of collision, the algorithm incrementally constructs a graph of trajectories through state space, while efficiently searching over candidate paths through the graph at each iteration. This process results in a search tree in belief space that provably converges to the optimal path. We analyze the algorithm theoretically and also provide simulation results demonstrating its utility for balancing information gathering to reduce uncertainty and finding low cost paths.
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
(1995) · Cited by 10,558
LaValle, S. M. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546877 · Cited by 5,211
LaValle, S. M. (2006) · Cited by 4,177
Planning and acting in partially observable stochastic domains
Kaelbling, L. P., Littman, M. L., & Cassandra, A. R. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(98)00023-x · Cited by 4,149
Randomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
Probabilistic Robotics (Intelligent Robotics and Autonomous Agents)
Thrun, S., Burgard, W., & Fox, D. (2005) · The MIT Press eBooks · Cited by 1,422
Trajectory generation and control for precise aggressive maneuvers with quadrotors
Mellinger, D., Michael, N., & Kumar, V. (2012) · The International Journal of Robotics Research · doi:10.1177/0278364911434236 · Cited by 884
Incremental Sampling-based Algorithms for Optimal Motion Planning
Karaman, S., & Frazzoli, E. (2010) · Robotics: Science and Systems VI · doi:10.15607/rss.2010.vi.034 · Cited by 680
Koenig, S., Likhachev, M. A., & Furcy, D. (2004) · Artificial Intelligence · doi:10.1016/j.artint.2003.12.001 · Cited by 662
Belief space planning assuming maximum likelihood observations
Platt, R., Tedrake, R., Kaelbling, L., & Lozano-Perez, T. (2010) · Robotics: Science and Systems VI · doi:10.15607/rss.2010.vi.037 · Cited by 298
Cited by
Path Planning with Modified a Star Algorithm for a Mobile Robot
Duchoň, F., Babinec, A., Kajan, M., Beňo, P., Florek, M., Fico, T., & Jurišica, L. (2014) · Procedia Engineering · doi:10.1016/j.proeng.2014.12.098 · Cited by 869
Sampling-Based Robot Motion Planning: A Review
Elbanhawi, M., & Simic, M. (2014) · IEEE Access · doi:10.1109/access.2014.2302442 · Cited by 786
Learning high-speed flight in the wild
Loquercio, A., Kaufmann, E., Ranftl, R., Müller, M., Koltun, V., & Scaramuzza, D. (2021) · Science Robotics · doi:10.1126/scirobotics.abg5810 · Cited by 375
Sampling-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
Motion planning under uncertainty using iterative local optimization in belief space
van den Berg, J., Patil, S., & Alterovitz, R. (2012) · The International Journal of Robotics Research · doi:10.1177/0278364912456319 · Cited by 299
Metadata
- Authors
- Bry, A., & Roy, N.
- Venue
- 2011 IEEE International Conference on Robotics and Automation
- Publisher
- IEEE
- Published
- 2011-05
- Pages
- 723-730
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2103052138
- Cited by
- 439
- References
- 20
- FWCI
- 14.11
- Type
- conference paper
- 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: Rapidly-exploring Random Belief Trees for motion planning under uncertainty. https://app.cochat.ai/papers/10.1109/icra.2011.5980508
- The paper
- Bry, A., & Roy, N. (2011). Rapidly-exploring Random Belief Trees for motion planning under uncertainty. 2011 IEEE International Conference on Robotics and Automation. https://doi.org/10.1109/icra.2011.5980508
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.