Planning in the continuous domain: A generalized belief space approach for autonomous navigation in unknown environments
Open accessThe DOI matches its Crossref record; 56 of the 56 references it cites were found in a registry or an index.
Abstract
We investigate the problem of planning under uncertainty, with application to mobile robotics. We propose a probabilistic framework in which the robot bases its decisions on the generalized belief, which is a probabilistic description of its own state and of external variables of interest. The approach naturally leads to a dual-layer architecture: an inner estimation layer, which performs inference to predict the outcome of possible decisions; and an outer decisional layer which is in charge of deciding the best action to undertake. Decision making is entrusted to a model predictive control (MPC) scheme. The formulation is valid for general cost functions and does not discretize the state or control space, enabling planning in continuous domain. Moreover, it allows to relax the assumption of maximum likelihood observations: predicted measurements are treated as random variables, and binary random variables are used to model the event that a measurement is actually taken by the robot. We successfully apply our approach to the problem of uncertainty-constrained exploration, in which the robot has to perform tasks in an unknown environment, while maintaining localization uncertainty within given bounds. We present an extensive numerical analysis of the proposed approach and compare it against related work. In practice, our planning approach produces smooth and natural trajectories and is able to impose soft upper bounds on the uncertainty. Finally, we exploit the results of this analysis to identify current limitations and show that the proposed framework can accommodate several desirable extensions.
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
Thrun, S. (2002) · Communications of the ACM · doi:10.1145/504729.504754 · Cited by 7,994 · cited 1×
“55) in (Thrun et al., 2005)), and allows rewriting (18) as: p (X k+l, k+1:k+l|Zk, Uk 1, Zk+1:k+l, uk:k+l 1) / p (X k+l, k+1:k+l, Zk+1:k+l|Zk, Uk 1, uk:k+l 1) .”
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 · cited 2×
“While POMDP are intractable in general (Kaelbling et al., 1998), it is of practical interest to devise problem-specific solutions or approximations (e.g. locally optimal plans) that trade-off optimality for computational efficiency.”
BackgroundG2o: A general framework for graph optimization
Kummerle, R., Grisetti, G., Strasdat, H., Konolige, K., & Burgard, W. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5979949 · Cited by 1,982 · cited 2×
“…techniques for simultaneous localization and mapping (SLAM) allow fast solution of medium–large scenarios (Kaess et al., 2008; Konolige et al., 2010; Kümmerle et al., 2011; Kaess et al., 1Faculty of Aerospace Engineering, Technion - Israel Institute of Technology, Haifa 32000, Israel 2Institute…”
MethodMonte-Carlo Planning in Large POMDPs
Silver, D., & Veness, J. (2010) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1,408
1987 american control conference
(1987) · IEEE Control Systems Magazine · doi:10.1109/mcs.1987.1105260 · Cited by 1,402
iSAM2: Incremental smoothing and mapping using the Bayes tree
Kaess, M., Johannsson, H., Roberts, R., Ila, V., Leonard, J. J., & Dellaert, F. (2012) · The International Journal of Robotics Research · doi:10.1177/0278364911430419 · Cited by 1,362 · cited 1×
“State-of-the-art techniques for localization and mapping (SLAM ) allow fast solution of medium-large scenarios (Kaess et al., 2012; Konolige et al., 2010; Kümmerle et al., 2011; Kaess et al., 2008), using efficient nonlinear optimization techniques, that exploit the structure of the underlying problem.”
MethodSelf-citationiSAM: Incremental Smoothing and Mapping
Kaess, M., Ranganathan, A., & Dellaert, F. (2008) · IEEE Transactions on Robotics · doi:10.1109/tro.2008.2006706 · Cited by 1,076 · cited 2×
“State-of-the-art techniques for simultaneous localization and mapping (SLAM) allow fast solution of medium–large scenarios (Kaess et al., 2008; Konolige et al., 2010; Kümmerle et al., 2011; Kaess et al., 1Faculty of Aerospace Engineering, Technion - Israel Institute of Technology, Haifa 32000,…”
MethodSelf-citation2021 IEEE International Conference on Robotics and Automation (ICRA)
(2021) · doi:10.1109/icra48506.2021 · Cited by 1,039
Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI 2010)
Adams, R. P., Dahl, G. E., & Murray, I. (2010) · Cited by 966
Information Gain-based Exploration Using Rao-Blackwellized Particle Filters
Stachniss, C., Grisetti, G., & Burgard, W. (2005) · Robotics: Science and Systems I · doi:10.15607/rss.2005.i.009 · Cited by 542 · cited 1×
“Examples of this effort are the work of Stachniss et al. (2004, 2005), Blanco et al. (2008), and Du et al. (2011), in which particle filters are used as the estimation engine.”
MethodValue-Function Approximations for Partially Observable Markov Decision Processes
Hauskrecht, M. (2000) · Journal of Artificial Intelligence Research · doi:10.1613/jair.678 · Cited by 527 · cited 1×
“We remark that the GBS is nothing more than a standard belief space over a larger state (Hauskrecht, 2000), and we use this terminology to make explicit the fact that our state space also includes the world state.”
MethodReal-time monocular SLAM: Why filter?
Strasdat, H., Montiel, J. M. M., & Davison, A. J. (2010) · 2010 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2010.5509636 · Cited by 475 · cited 1×
“We keep past poses as part of the state vector since it entails sparsity, making the optimization problem underlying MAP estimation (Section 4.2) more efficient (Strasdat et al., 2010).”
Influential2010 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2010)
Nakao, M. (2011) · Journal of the Robotics Society of Japan · doi:10.7210/jrsj.29.443a2 · Cited by 409
Efficient Sparse Pose Adjustment for 2D mapping
Konolige, K., Grisetti, G., Kümmerle, R., Burgard, W., Limketkai, B., & Vincent, R. (2010) · 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2010.5649043 · Cited by 395 · cited 2×
“State-of-the-art techniques for simultaneous localization and mapping (SLAM) allow fast solution of medium–large scenarios (Kaess et al., 2008; Konolige et al., 2010; Kümmerle et al., 2011; Kaess et al., 1Faculty of Aerospace Engineering, Technion - Israel Institute of Technology, Haifa 32000,…”
MethodJournal of Artificial Intelligence Research (JAIR)
Minton, S. (1993) · Cited by 331
Integrated task and motion planning in belief space
Kaelbling, L. P., & Lozano-Pérez, T. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913484072 · Cited by 328 · cited 1×
“For instance, Kaelbling and Lozano-Pérez (2011, 2012, 2013) propose an approach based on hierarchical goal regression for mobile manipulation.”
BackgroundAdvances in Neural Information Processing Systems 23 (NIPS 2010)
Seth, S., Park, I. M., Brockmeier, A. J., Semework, M., Choi, J. S., Francis, J. T., & Príncipe, J. C. (2010) · Cited by 318
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 · cited 12×
“An even simpler observation model, commonly used in motion planning (e.g. Van Den Berg et al., 2012) involves only the current robot state xi at each time ti and is a particular case of the general model (3).”
InfluentialBelief 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 4×
“Platt et al. (2010) apply linear quadratic regulation (LQR) to compute locally optimal policies.”
BackgroundMethodInfluentialThe Belief Roadmap: Efficient Planning in Belief Space by Factoring the Covariance
Prentice, S., & Roy, N. (2009) · The International Journal of Robotics Research · doi:10.1177/0278364909341659 · Cited by 269 · cited 2×
“We note that while modeling the belief by a single Gaussian is common (see e.g. Prentice and Roy, 2009; Platt et al., 2010; Van Den Berg et al., 2012), it may be not sufficiently descriptive in certain problem domains (e.g. contact, locomotion), in which case mixture of Gaussians is a better…”
BackgroundMethodKaess, M., Johannsson, H., Roberts, R., Ila, V., Leonard, J., & Dellaert, F. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5979641 · Cited by 267
Self-citationEfficient Informative Sensing using Multiple Robots
Singh, A., Krause, A., Guestrin, C., & Kaiser, W. J. (2009) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2674 · Cited by 255 · cited 2×
“A greedy strategy for informative path planning is proposed by Singh et al. (2009), while a branch-and-bound approach is proposed by Binney and Sukhatme (2012).”
MethodEfficient Informative Sensing using Multiple Robots
Singh, A., Krause, A., Guestrin, C., & Kaiser, W. J. (2010) · Cited by 245
Global A-Optimal Robot Exploration in SLAM
Sim, R., & Roy, N. (2006) · Proceedings of the 2005 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2005.1570193 · Cited by 238 · cited 4×
“Sim and Roy (2005) propose A-optimal strategies for solving the active SLAM problem.”
BackgroundInfluentialMartinez-Cantin, R., de Freitas, N., Brochu, E., Castellanos, J., & Doucet, A. (2009) · Autonomous Robots · doi:10.1007/s10514-009-9130-2 · Cited by 217
Branch and bound for informative path planning
Binney, J., & Sukhatme, G. S. (2012) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2012.6224902 · Cited by 174 · cited 1×
“A greedy strategy for informative path planning is proposed by Singh et al. (2009), while a branch-and-bound approach is proposed by Binney and Sukhatme (2012).”
MethodCovariance recovery from a square root information matrix for data association
Kaess, M., & Dellaert, F. (2009) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2009.06.008 · Cited by 160 · cited 1×
“However, computational complexity of this operation can be greatly reduced by enforcing appropriate variable ordering, eliminating the current robot pose last (Kaess and Dellaert, 2009; Kaess et al., 2011).”
BackgroundSelf-citationObservability analysis and active control for airborne SLAM
Bryson, M., & Sukkarieh, S. (2008) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2008.4517003 · Cited by 159 · cited 2×
“, 2007) and Bryson and Sukkarieh (Bryson and Sukkarieh, 2008) investigate planning techniques in conjunction with the use of EKF for estimation.”
MethodExploration with active loop-closing for FastSLAM
Stachniss, C., Hahnel, D., & Burgard, W. (2005) · 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566) · doi:10.1109/iros.2004.1389609 · Cited by 152 · cited 1×
“Examples of this effort are the work of Stachniss et al. (2004, 2005), Blanco et al. (2008), and Du et al. (2011), in which particle filters are used as the estimation engine.”
MethodOn the comparison of uncertainty criteria for active SLAM
Carrillo, H., Reid, I., & Castellanos, J. A. (2012) · 2012 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2012.6224890 · Cited by 144 · cited 2×
“Carrillo et al. (2012) provide an analysis of the uncertainty metrics used in EKF-based planning.”
MethodActive Policy Learning for Robot Planning and Exploration under Uncertainty
Martinez-Cantin, R., de Freitas, N., Doucet, A., & Castellanos, J. (2007) · Robotics: Science and Systems III · doi:10.15607/rss.2007.iii.041 · Cited by 140
Robotics: Science and Systems (RSS) 2020
Nanayakkara, T., Barfoot, T., & Howard, T. M. (2021) · The International Journal of Robotics Research · doi:10.1177/02783649211052346 · Cited by 139
ROBOTICS AND AUTONOMOUS SYSTEMS
Parsons, S. (2013) · Cited by 125
Active SLAM using Model Predictive Control and Attractor based Exploration
Leung, C., Huang, S., & Dissanayake, G. (2006) · 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2006.282530 · Cited by 112 · cited 2×
“(Leung et al., 2006) propose an approach in which the MPC strategy is associated with a heuristic based on global attractors.”
MethodIntegrated perception and planning in the continuous space: A POMDP approach
Bai, H., Hsu, D., & Lee, W. S. (2014) · The International Journal of Robotics Research · doi:10.1177/0278364914528255 · Cited by 108 · cited 12×
“(2004, 2005), Blanco et al. (2008), and Du et al. (2011), in which particle filters are used as the estimation engine. The basic idea, in this case, is to identify potential targets in the scenario (e.g. boundaries of unexplored regions, or loop closure opportunities), and to compute a path to each of those targets; t…”
BackgroundMethodResultInfluentialSampling-based Motion Planning for Robotic Information Gathering
Hollinger, G. A., & Sukhatme, G. S. (2013) · Robotics: Science and Systems · doi:10.15607/rss.2013.ix.051 · Cited by 100 · cited 1×
“Hollinger and Sukhatme (2013) propose more efficient algorithms, based on rapidly-exploring random trees and probabilistic roadmaps.”
BackgroundExpectation-Maximization as lower bound maximization
Minka, T. P. (1998) · Cited by 88
Valencia, R., Valls Miro, J., Dissanayake, G., & Andrade-Cetto, J. (2012) · 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2012.6385637 · Cited by 86
Multi-Step Look-Ahead Trajectory Planning in SLAM: Possibility and Necessity
Huang, S., Kwok, N. M., Dissanayake, G., Ha, Q. P., & Fang, G. (2006) · Proceedings of the 2005 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2005.1570261 · Cited by 81 · cited 2×
“(Huang et al., 2005) propose a model predictive control (MPC) strategy, associated with EKF-SLAM.”
MethodPerception-driven navigation: Active visual SLAM for robotic area coverage
Kim, A., & Eustice, R. M. (2013) · 2013 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2013.6631022 · Cited by 79 · cited 9×
“This is conceptually similar to the Bernoulli random variables used by Kim and Eustice (2013) to model the probability of making camera observations based on saliency values.”
BackgroundMethodInfluentialPlanning Reliable Paths With Pose SLAM
Valencia, R., Morta, M., Andrade-Cetto, J., & Porta, J. M. (2013) · IEEE Transactions on Robotics · doi:10.1109/tro.2013.2257577 · Cited by 75 · cited 3×
“Modeling obstacles is possible within our framework, and we refer the interested reader to Van Den Berg et al. (2012) and the references therein.”
BackgroundMethodPatil, 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 · cited 1×
“The computation can be further improved by resorting to automatic differentiation which can be used to calculate exact gradients without numerical differentiation (Sommer et al., 2013; Patil et al., 2014).”
MethodA Novel Measure of Uncertainty for Mobile Robot SLAM with Rao—Blackwellized Particle Filters
Blanco, J. L., Fernández-Madrigal, J. A., & Gonzalez, J. (2008) · The International Journal of Robotics Research · doi:10.1177/0278364907082610 · Cited by 69 · cited 1×
“Examples of this effort are the work of Stachniss et al. (2004, 2005), Blanco et al. (2008), and Du et al. (2011), in which particle filters are used as the estimation engine.”
MethodRobotics: Science and Systems (RSS)
Lepora, N. F., Martínez-Hernández, U., & Prescott, T. J. (2013) · Cited by 59
A Scalable Method for Solving High-Dimensional Continuous POMDPs Using Local ApproximationPreprint
Erez, T., & Smart, W. D. (2010) · arXiv (Cornell University) · doi:10.7936/k7mw2fbd · Cited by 54
Unifying perception, estimation and action for mobile manipulation via belief space planning
Kaelbling, L. P., & Lozano‐Pérez, T. (2012) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2012.6225237 · Cited by 41 · cited 1×
“For instance, Kaelbling and Lozano-Pérez (2011, 2012, 2013) propose an approach based on hierarchical goal regression for mobile manipulation.”
BackgroundMulti-robot active SLAM with relative entropy optimization
Kontitsis, M., Theodorou, E. A., & Todorov, E. V. (2013) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2013.6580252 · Cited by 38 · cited 1×
“Kontitsis et al. (2013) propose a sampling-based approach to solve a constrained optimization problem in which constraints correspond to state dynamics, while the objective function rewards uncertainty reduction and goal attainment.”
BackgroundA comparative study on active SLAM and autonomous exploration with Particle Filters
Du, J., Carlone, L., Ng, M. K., Bona, B., & Indri, M. (2011) · IEEE/ASME International Conference on Advanced Intelligent Mechatronics · doi:10.1109/aim.2011.6027142 · Cited by 26 · cited 2×
“Examples of this effort are the work of Stachniss et al. (2004, 2005), Blanco et al. (2008), and Du et al. (2011), in which particle filters are used as the estimation engine.”
MethodSelf-citationConsistent unscented incremental smoothing for multi-robot cooperative target tracking
Huang, G. P., Kaess, M., & Leonard, J. J. (2014) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2014.08.007 · Cited by 24 · cited 1×
“Although conceptually, dynamically changing environments can also be supported within a smoothing formulation (see, e.g., Huang et al., 2014), in practice it would lead to a huge state space.”
BackgroundPlanning under uncertainty in the continuous domain: A generalized belief space approach
Indelman, V., Carlone, L., & Dellaert, F. (2014) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2014.6907858 · Cited by 22 · cited 1×
“The present paper is an extension of the work presented by Indelman et al. (2013) and Indelman et al. (2014).”
MethodSelf-citationPre-image Backchaining in Belief Space for Mobile Manipulation
Kaelbling, L. P., & Lozano‐Pérez, T. (2016) · Springer tracts in advanced robotics · doi:10.1007/978-3-319-29363-9_22 · Cited by 19 · cited 1×
“For instance, Kaelbling and Lozano-Pérez (2011, 2012, 2013) propose an approach based on hierarchical goal regression for mobile manipulation.”
BackgroundAutomatic Differentiation on Differentiable Manifolds as a Tool for Robotics
Sommer, H., Pradalier, C., & Furgale, P. (2016) · Springer tracts in advanced robotics · doi:10.1007/978-3-319-28872-7_29 · Cited by 19 · cited 1×
“The computation can be further improved by resorting to automatic differentiation which can be used to calculate exact gradients without numerical differentiation (Sommer et al., 2013; Patil et al., 2014).”
MethodUncertainty-constrained robot exploration: A mixed-integer linear programming approach
Carlone, L., & Lyons, D. J. (2014) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2014.6906997 · Cited by 17 · cited 2×
“Future work also includes investigation of the relation to the mixed-integer formulation of Carlone and Lyons (2014), in which the planner is guaranteed to produce collision-free trajectories.”
BackgroundSelf-citationTowards Planning in Generalized Belief Space
Indelman, V., Carlone, L., & Dellaert, F. (2016) · Springer tracts in advanced robotics · doi:10.1007/978-3-319-28872-7_34 · Cited by 17 · cited 1×
“The present paper is an extension of the work presented by Indelman et al. (2013) and Indelman et al. (2014).”
MethodSelf-citationNext Best View Estimation With Eye In Hand Camera
Potthast, C., & Sukhatme, G. S. (2011) · Cited by 11
Research works printed but not linked: 2
- Kümmerle, R., Grisetti, G., Strasdat, H., Konolige, K., and Burgard, W. (2011). g2o: A general framework for graph optimization. In Proc. of the IEEE Int. Conf. on Robotics and Automation (ICRA) , Shanghai, China.
- Toussaint, M. (2009). Pros and cons of truncated gaussian ep in the context of approximate inference control. In NIPS-Workshop on Probabilistic Approaches for Robotics and Control , volume 21.
Cited by
Past, Present, and Future of Simultaneous Localization and Mapping: Toward the Robust-Perception Age
Cadena, C., Carlone, L., Carrillo, H., Latif, Y., Scaramuzza, D., Neira, J., Reid, I., & Leonard, J. J. (2016) · IEEE Transactions on Robotics · doi:10.1109/tro.2016.2624754 · Cited by 3,596
“Recent works [250] and [116] have proposed approaches for continuous-space planning under uncertainty that can be used for active SLAM; currently these approaches can only guarantee convergence to locally optimal policies.”
Self-citationPast, present, and future of simultaneous localization and mapping: Toward the robust-perception age
Cadena, C., Carlone, L., Carrillo, H., Latif, Y., Scaramuzza, D., Neira, J., Reid, I. D., & Leonard, J. J. (2016) · Zurich Open Repository and Archive (University of Zurich) · doi:10.5167/uzh-138892 · Cited by 3,048
Self-citationA Survey on Active Simultaneous Localization and Mapping: State of the Art and New Frontiers
Placed, J. A., Strader, J., Carrillo, H., Atanasov, N., Indelman, V., Carlone, L., & Castellanos, J. A. (2023) · IEEE Transactions on Robotics · doi:10.1109/tro.2023.3248510 · Cited by 332
“Index Terms—Active perception, active simultaneous localization and mapping (SLAM), autonomous robotic exploration, belief-space planning (BSP), deep reinforcement learning (DRL), next best view, optimality criteria.”
BackgroundMethodInfluentialSelf-citationPartially Observable Markov Decision Processes in Robotics: A Survey
Lauri, M., Hsu, D., & Pajarinen, J. (2023) · IEEE Transactions on Robotics · doi:10.1109/tro.2022.3200138 · Cited by 188
“A two-layer used in [67].”
Active Mapping and Robot Exploration: A Survey
Lluvia, I., Lazkano, E., & Ansuategi, A. (2021) · Sensors · doi:10.3390/s21072445 · Cited by 201
“Thus, the ability to foresee the effect of each individual action is a key point in the decision-making process [162].”
Background
Metadata
- Authors
- Indelman, V., Carlone, L., & Dellaert, F.
- Affiliations
- Technion – Israel Institute of Technology (IL)
- Georgia Institute of Technology (US)
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2015-05-18
- Volume
- 34
- Issue
- 7
- Pages
- 849-882
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W1826354755
- Cited by
- 154
- References
- 56
- Citations by year
- 2026: 6 · 2025: 7 · 2024: 7 · 2023: 10 · 2022: 18 · 2021: 19 · 2020: 12 · 2019: 17 · 2018: 15 · 2017: 20 · 2016: 17 · 2015: 6
- FWCI
- 16.79
- Type
- journal article
- Language
- en
- Open access
- green
- hdl.handle.net
- Licence
- journals.sagepub.com/page/policies/text-and-data-mining-license (tdm)
- Locations
- The International Journal of Robotics Research (publishedVersion)
- SMARTech Repository (Georgia Institute of Technology) (submittedVersion)
- Funders
- National Science Foundation (W911NF-08-2-0004)
- Topics
- Physical Sciences › Engineering › Control and Systems Engineering › Robotic Path Planning Algorithms
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Robotics and Sensor-Based Localization
- Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
- Keywords
- planning under uncertainty, autonomous navigation, mobile robots, model predictive control, continuous state spaces, probabilistic inference, unknown environments, localization uncertainty, measurement uncertainty, decision-making
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
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.