The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Planning under Uncertainty for Robotic Tasks with Mixed Observability
Abstract
Partially observable Markov decision processes (POMDPs) provide a principled, general framework for robot motion planning in uncertain and dynamic environments. They have been applied to various robotic tasks. However, solving POMDPs exactly is computationally intractable. A major challenge is to scale up POMDP algorithms for complex robotic tasks. Robotic systems often have mixed observability : even when a robot’s state is not fully observable, some components of the state may still be so. We use a factored model to represent separately the fully and partially observable components of a robot’s state and derive a compact lower-dimensional representation of its belief space. This factored representation can be combined with any point-based algorithm to compute approximate POMDP solutions. Experimental results show that on standard test problems, our approach improves the performance of a leading point-based POMDP algorithm by many times.
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
The Complexity of Markov Decision Processes
Papadimitriou, C. H., & Tsitsiklis, J. N. (1987) · Mathematics of Operations Research · doi:10.1287/moor.12.3.441 · Cited by 1,329
Towards robotic assistants in nursing homes: Challenges and results
Pineau, J., Montemerlo, M., Pollack, M., Roy, N., & Thrun, S. (2003) · Robotics and Autonomous Systems · doi:10.1016/s0921-8890(02)00381-0 · Cited by 640 · cited 7×
“We would also like to point out that the belief update and backup operations, which are the main modifications required for SARSOP to solve MOMDPs, are common to most pointbased POMDP algorithms, such as PBVI (Pineau et al. 2003a), Perseus (Spaan and Vlassis 2004), and HSVI (Smith and Simmons 2004).”
BackgroundMethodInfluential(2004) · doi:10.5555/1036843.1036906 · Cited by 417
Finding approximate POMDP solutions through belief compression
Roy, N., Gordon, G., & Thrun, S. (2005) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1496 · Cited by 254
Cited by
Katrakazas, C., Quddus, M., Chen, W.-H., & Deka, L. (2015) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2015.09.011 · Cited by 800
Perception, Planning, Control, and Coordination for Autonomous Vehicles
Pendleton, S., Andersen, H., Du, X., Shen, X., Meghjani, M., Eng, Y., Rus, D., & Ang, M. (2017) · Machines · doi:10.3390/machines5010006 · Cited by 657
Search and pursuit-evasion in mobile robotics: A survey
Chung, T. H., Hollinger, G. A., & Isler, V. (2011) · Autonomous Robots · doi:10.1007/s10514-011-9241-4 · Cited by 535
A Survey of Multi-Objective Sequential Decision-Making
Roijers, D. M., Vamplew, P., Whiteson, S., & Dazeley, R. (2013) · Journal of Artificial Intelligence Research · doi:10.1613/jair.3987 · Cited by 461
Decision Making Under Uncertainty: Theory and Application
Kochenderfer, M. J., Amato, C., Chowdhary, G., How, J. P., Reynolds, H. J. D., Thornton, J. R., Torres-Carrasquillo, P. A., Üre, N. K., & Vian, J. (2015) · The MIT Press eBooks · doi:10.7551/mitpress/10187.001.0001 · Cited by 392
Metadata
- Authors
- Ong, S. C. W., Png, S. W., Hsu, D., & Lee, W. S.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2010-05-04
- Volume
- 29
- Issue
- 8
- Pages
- 1053-1068
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W2010780110
- Cited by
- 238
- References
- 4
- FWCI
- 12.58
- Type
- journal article
- Language
- en
- Open access
- closed
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: Planning under Uncertainty for Robotic Tasks with Mixed Observability. https://app.cochat.ai/papers/10.1177/0278364910369861
- The paper
- Ong, S. C. W., Png, S. W., Hsu, D., & Lee, W. S. (2010). Planning under Uncertainty for Robotic Tasks with Mixed Observability. The International Journal of Robotics Research. https://doi.org/10.1177/0278364910369861
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.