Point-Based Value Iteration for Continuous POMDPs
Open accessThe DOI matches its OpenAlex record; 76 of the 76 references it cites were found in a registry or an index.
Abstract
We propose a novel approach to optimize Partially Observable Markov Decisions Processes (POMDPs) defined on continuous spaces. To date, most algorithms for model-based POMDPs are restricted to discrete states, actions, and observations, but many real-world problems such as, for instance, robot navigation, are naturally defined on continuous spaces. In this work, we demonstrate that the value function for continuous POMDPs is convex in the beliefs over continuous state spaces, and piecewise-linear convex for the particular case of discrete observations and actions but still continuous states. We also demonstrate that continuous Bellman backups are contracting and isotonic ensuring the monotonic convergence of value-iteration algorithms. Relying on those properties, we extend the PERSEUS algorithm, originally developed for discrete POMDPs, to work in continuous state spaces by representing the observation, transition, and reward models using Gaussian mixtures, and the beliefs using Gaussian mixtures or particle sets. With these representations, the integrals that appear in the Bellman backup can be computed in closed form and, therefore, the algorithm is computationally feasible. Finally, we further extend PERSEUS to deal with continuous action and observation sets by designing effective sampling approaches.
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
Shannon, R. D. (1976) · Acta Crystallographica Section A · doi:10.1107/s0567739476001551 · Cited by 66,145
Reinforcement Learning: An Introduction
(2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 24,496
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
(1995) · Cited by 10,558
Markov decision processes: Discrete stochastic dynamic programming
Hazeghi, K., & Puterman, M. L. (1995) · Journal of the American Statistical Association · doi:10.2307/2291177 · Cited by 8,037
Introduction to Reinforcement Learning
Sutton, R. S., & Barto, A. G. (1998) · The MIT Press eBooks · Cited by 6,855
Case-Based Reasoning: Foundational Issues, Methodological Variations, and System Approaches
Aamodt, A., & Plaza, E. (1994) · AI Communications · doi:10.3233/aic-1994-7104 · Cited by 5,624 · cited 1×
“CBR tries to solve problems by retrieving one or several cases relevant for the issue at hand from a case-base with already solved previous problems (cases), and then reusing the past case(s) to also solve the new task (Aamodt and Plaza 1994).”
CONDENSATION—Conditional Density Propagation for Visual Tracking
Isard, M., & Blake, A. (1998) · International Journal of Computer Vision · doi:10.1023/a:1008078328650 · Cited by 4,886
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
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5086 · Cited by 3,515
Cited by
Reinforcement Learning and Dynamic Programming Using Function Approximators
Busoniu, L., Babuska, R., De Schutter, B., & Ernst, D. (2017) · CRC Press eBooks · doi:10.1201/9781439821091 · Cited by 919
A survey of point-based POMDP solvers
Shani, G., Pineau, J., & Kaplow, R. (2013) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-012-9200-2 · Cited by 422
Kernel Mean Embedding of Distributions: A Review and Beyond
Muandet, K., Fukumizu, K., Sriperumbudur, B., & Schölkopf, B. (2017) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000060 · Cited by 409
LQG-MP: Optimized path planning for robots with motion uncertainty and imperfect state information
van den Berg, J., Abbeel, P., & Goldberg, K. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364911406562 · Cited by 395
Partially Observable Markov Decision Processes
Spaan, M. T. J. (2012) · Adaptation, Learning, and Optimization · doi:10.1007/978-3-642-27645-3_12 · Cited by 315
Self-citationMotion 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
Probabilistic decision-making under uncertainty for autonomous driving using continuous POMDPs
Brechtel, S., Gindele, T., & Dillmann, R. (2014) · 17th International IEEE Conference on Intelligent Transportation Systems (ITSC) · doi:10.1109/itsc.2014.6957722 · Cited by 279
Juliá, M., Gil, A., & Reinoso, O. (2012) · Autonomous Robots · doi:10.1007/s10514-012-9298-8 · Cited by 256
Data preprocessing in predictive data mining
Alexandropoulos, S.-A. N., Kotsiantis, S. B., & Vrahatis, M. N. (2019) · The Knowledge Engineering Review · doi:10.1017/s026988891800036x · Cited by 209
Wang, Z., Yang, H., Wu, Z., Wang, T., Li, W., Tang, Y., & Liu, G. (2018) · ChemMedChem · doi:10.1002/cmdc.201800533 · Cited by 203
Gabryś, H. S., Buettner, F., Sterzing, F., Hauswald, H., & Bangert, M. (2018) · Frontiers in Oncology · doi:10.3389/fonc.2018.00035 · Cited by 172
Ke, X., Bernal, S. A., Provis, J. L., & Lothenbach, B. (2020) · Cement and Concrete Research · doi:10.1016/j.cemconres.2020.106158 · Cited by 117
Hill, B. L., Brown, R., Gabel, E., Rakocz, N., Lee, C., Cannesson, M., Baldi, P., Olde Loohuis, L., Johnson, R., Jew, B., et al. (2019) · British Journal of Anaesthesia · doi:10.1016/j.bja.2019.07.030 · Cited by 103
Predatory and Exploitative Behaviour in Academic Publishing: An Assessment
Teixeira da Silva, J. A., Dobránszki, J., Tsigaris, P., & Al-Khatib, A. (2019) · The Journal of Academic Librarianship · doi:10.1016/j.acalib.2019.102071 · Cited by 77
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
Evans, R., Hernández-Orallo, J., Welbl, J., Kohli, P., & Sergot, M. (2021) · Artificial Intelligence · doi:10.1016/j.artint.2020.103438 · Cited by 58
Evans, R., Hernandez-Orallo, J., Welbl, J., Kohli, P., & Sergot, M. (2019) · arXiv · doi:10.48550/arxiv.1910.02227 · Cited by 58
Predicting employee absenteeism for cost effective interventions
Lawrance, N., Petrides, G., & Guerry, M.-A. (2021) · Decision Support Systems · doi:10.1016/j.dss.2021.113539 · Cited by 40
Walking and Stumbling on the Paths of Heritage-making for Rural Development in the Arica Highlands
Saintenoy, T., Estefane, F. G., Jofré, D., & Masaguer, M. (2019) · Mountain Research and Development · doi:10.1659/mrd-journal-d-19-00015.1 · Cited by 24
Zhutovsky, P., Vijverberg, E. G. B., Bruin, W. B., Thomas, R. M., Wattjes, M. P., Pijnenburg, Y. A. L., van Wingen, G. A., & Dols, A. (2019) · Journal of Alzheimer's Disease · doi:10.3233/jad-181004 · Cited by 20
Training-Based Antenna Selection for PER Minimization: A POMDP Approach
Padmanabhan, S., Stephen, R. G., Murthy, C. R., & Coupechoux, M. (2015) · IEEE Transactions on Communications · doi:10.1109/tcomm.2015.2455504 · Cited by 15
On the Cluster Admission Problem for Cloud Computing
Dierks, L., Kash, I., & Seuken, S. (2019) · Proceedings of the 14th Workshop on the Economics of Networks, Systems and Computation · doi:10.1145/3338506.3340274 · Cited by 8
Visual Conceptual Blending with Large-scale Language and Vision Models
Ge, S., & Parikh, D. (2021) · arXiv · doi:10.48550/arxiv.2106.14127 · Cited by 4
Metadata
- Authors
- Porta, J. M., Vlassis, N. A., Spaan, M. T. J., & Poupart, P.
- Venue
- DIGITAL.CSIC (Spanish National Research Council (CSIC))
- Publisher
- Consejo Superior de Investigaciones Científicas
- Published
- 2006-12-01
- Volume
- 7
- Issue
- 83
- Pages
- 2329-2367
- OpenAlex
- W2144088174
- Cited by
- 234
- References
- 76
- FWCI
- 10.33
- 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
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.