Active Policy Learning for Robot Planning and Exploration under Uncertainty
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
This paper proposes a simulation-based active policy learning algorithm for finite-horizon, partially-observed sequential decision processes.The algorithm is tested in the domain of robot navigation and exploration under uncertainty, where the expected cost is a function of the belief state (filtering distribution).This filtering distribution is in turn nonlinear and subject to discontinuities, which arise because constraints in the robot motion and control models.As a result, the expected cost is non-differentiable and very expensive to simulate.The new algorithm overcomes the first difficulty and reduces the number of simulations as follows.First, it assumes that we have carried out previous evaluations of the expected cost for different corresponding policy parameters.Second, it fits a Gaussian process (GP) regression model to these values, so as to approximate the expected cost as a function of the policy parameters.Third, it uses the GP predicted mean and variance to construct a statistical measure that determines which policy parameters should be used in the next simulation.The process is iterated using the new parameters and the newly gathered expected cost observation.Since the objective is to find the policy parameters that minimize the expected cost, this active learning approach effectively trades-off between exploration (where the GP variance is large) and exploitation (where the GP mean is low).In our experiments, a robot uses the proposed method to plan an optimal path for accomplishing a set of tasks, while maximizing the information about its pose and map estimates.These estimates are obtained with a standard filter for SLAM.Upon gathering new observations, the robot updates the state estimates and is able to replan a new path in the spirit of openloop feedback control.
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
Gaussian Processes for Machine Learning
Rasmussen, C. E., & Williams, C. K. I. (2005) · doi:10.7551/mitpress/3206.001.0001 · Cited by 11,705
Efficient Global Optimization of Expensive Black-Box Functions
Jones, D. R., Schonlau, M., & Welch, W. J. (1998) · Journal of Global Optimization · doi:10.1023/a:1008306431147 · Cited by 8,070 · cited 2×
“It is motivated by work on experimental design [13] [14] [15].”
MethodInformation 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 by
Taking the Human Out of the Loop: A Review of Bayesian Optimization
Shahriari, B., Swersky, K., Wang, Z., Adams, R. P., & de Freitas, N. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2494218 · Cited by 6,049
Self-citationBrochu, E., Cora, V. M., & de Freitas, N. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1012.2599 · Cited by 2,011
Model learning for robot control: A survey
Nguyen-Tuong, D., & Peters, J. (2011) · Cognitive Processing · doi:10.1007/s10339-011-0404-1 · Cited by 503
Bayesian Optimization in a Billion Dimensions via Random Embeddings
Wang, Z., Hutter, F., Zoghi, M., Matheson, D., & De Feitas, N. (2016) · Journal of Artificial Intelligence Research · doi:10.1613/jair.4806 · Cited by 390
Martinez-Cantin, R., de Freitas, N., Brochu, E., Castellanos, J., & Doucet, A. (2009) · Autonomous Robots · doi:10.1007/s10514-009-9130-2 · Cited by 217
“Although we actually learn the mean function in the manner proposed in Martinez-Cantin et al. (2007a) , for presentation clarity let us assume that it is the zero function as it is often the case in the machine learning literature.”
MethodSelf-citation
Metadata
- Authors
- Martinez-Cantin, R., de Freitas, N., Doucet, A., & Castellanos, J.
- Venue
- Robotics: Science and Systems III
- Published
- 2007-06-27
- OpenAlex
- W2121658992
- Cited by
- 140
- References
- 3
- FWCI
- 4.12
- Type
- conference paper
- Language
- en
- Open access
- gold
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: Active Policy Learning for Robot Planning and Exploration under Uncertainty. https://app.cochat.ai/papers/10.15607/rss.2007.iii.041
- The paper
- Martinez-Cantin, R., de Freitas, N., Doucet, A., & Castellanos, J. (2007). Active Policy Learning for Robot Planning and Exploration under Uncertainty. Robotics: Science and Systems III. https://doi.org/10.15607/rss.2007.iii.041
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.