The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Learning Sampling Distributions for Robot Motion Planning
Open accessAbstract
A defining feature of sampling-based motion planning is the reliance on an implicit representation of the state space, which is enabled by a set of probing samples. Traditionally, these samples are drawn either probabilistically or deterministically to uniformly cover the state space. Yet, the motion of many robotic systems is often restricted to “small” regions of the state space, due to e.g. differential constraints or collision-avoidance constraints. To accelerate the planning process, it is thus desirable to devise non-uniform sampling strategies that favor sampling in those regions where an optimal solution might lie. This paper proposes a methodology for nonuniform sampling, whereby a sampling distribution is learned from demonstrations, and then used to bias sampling. The sampling distribution is computed through a conditional variational autoencoder, allowing sample generation from the latent space conditioned on the specific planning problem. This methodology is general, can be used in combination with any sampling-based planner, and can effectively exploit the underlying structure of a planning problem while maintaining the theoretical guarantees of sampling-based approaches. Specifically, on several planning problems, the proposed methodology is shown to effectively learn representations for the relevant regions of the state space, resulting in an order of magnitude improvement in terms of success rate and convergence to the optimal cost.
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
Auto-Encoding Variational Bayes
Kingma, D. P., & Welling, M. (2013) · arXiv · doi:10.48550/arxiv.1312.6114 · Cited by 20,067
Representation Learning: A Review and New Perspectives
Bengio, Y., Courville, A., & Vincent, P. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.50 · Cited by 13,001
Proximal Policy Optimization Algorithms
Schulman, J., Wolski, F., Dhariwal, P., Radford, A., & Klimov, O. (2017) · arXiv · doi:10.48550/arxiv.1707.06347 · Cited by 10,625
Sampling-based algorithms for optimal motion planning
Karaman, S., & Frazzoli, E. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364911406761 · Cited by 5,275
LaValle, S. M. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546877 · Cited by 5,211
(2017) · International Conference on Learning Representations · Cited by 3,248
Tutorial on Variational Autoencoders
Doersch, C. (2016) · arXiv · doi:10.48550/arxiv.1606.05908 · Cited by 1,470
Gammell, J. D., Srinivasa, S. S., & Barfoot, T. D. (2014) · 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2014.6942976 · Cited by 1,207
Anytime Motion Planning using the RRT*
Karaman, S., Walter, M. R., Perez, A., Frazzoli, E., & Teller, S. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5980479 · Cited by 881
Janson, L., Schmerling, E., Clark, A., & Pavone, M. (2015) · The International Journal of Robotics Research · doi:10.1177/0278364915577958 · Cited by 576
Self-citationGammell, J. D., Srinivasa, S. S., & Barfoot, T. D. (2015) · Cited by 398
Semantic mapping for mobile robotics tasks: A survey
Kostavelis, I., & Gasteratos, A. (2015) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2014.12.006 · Cited by 376
Approaches for heuristically biasing RRT growth
Urmson, C., & Simmons, R. (2004) · Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453) · doi:10.1109/iros.2003.1248805 · Cited by 334
On the Probabilistic Foundations of Probabilistic Roadmap Planning
Hsu, D., Latombe, J.-C., & Kurniawati, H. (2006) · The International Journal of Robotics Research · doi:10.1177/0278364906067174 · Cited by 260
Ferguson, D., & Stentz, A. (2006) · 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2006.282100 · Cited by 234
Path Planning Under Kinematic Constraints by Rapidly Exploring Manifolds
Jaillet, L., & Porta, J. M. (2012) · IEEE Transactions on Robotics · doi:10.1109/tro.2012.2222272 · Cited by 190
Sampling heuristics for optimal motion planning in high dimensions
Akgun, B., & Stilman, M. (2011) · 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2011.6095077 · Cited by 158
Choudhury, S., Gammell, J. D., Barfoot, T. D., Srinivasa, S. S., & Scherer, S. (2016) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2016.7487615 · Cited by 116
Hybrid PRM Sampling with a Cost-Sensitive Adaptive Strategy
Hsu, D., Sanchez‐Ante, G., & Sun, Z. (2006) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2005.1570712 · Cited by 110
Toward Optimal Configuration Space Sampling
Burns, B., & Brock, O. (2005) · Robotics: Science and Systems · doi:10.15607/rss.2005.i.015 · Cited by 106
Demonstration-Guided Motion Planning
Gu, Y., & Alterovitz, R. (2016) · Springer tracts in advanced robotics · doi:10.1007/978-3-319-29363-9_17 · Cited by 96
Sampling-Based Motion Planning Using Predictive Models
Burns, B., & Brock, O. (2006) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2005.1570590 · Cited by 91
Adaptive workspace biasing for sampling-based planners
Zucker, M., Kuffner, J., & Bagnell, J. A. (2008) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2008.4543787 · Cited by 84
Workspace importance sampling for probabilistic roadmap planning
Kurniawati, H., & Hsu, D. (2005) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2004.1389627 · Cited by 82
Experience-based planning with sparse roadmap spanners
Coleman, D., Sucan, I. A., Moll, M., Okada, K., & Correll, N. (2015) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2015.7139284 · Cited by 73
Adapting the sampling distribution in PRM planners based on an approximated medial axis
Yang, Y., & Brock, O. (2004) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2004.1302411 · Cited by 67
Deterministic Sampling-Based Motion Planning: Optimality, Complexity, and Performance
Janson, L., Ichter, B., & Pavone, M. (2017) · Springer proceedings in advanced robotics · doi:10.1007/978-3-319-60916-4_29 · Cited by 63
Self-citationUsing workspace information as a guide to non-uniform sampling in probabilistic roadmap planners
van den Berg, J., & Overmars, M. H. (2004) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2004.1307191 · Cited by 49
Yi, D., Thakker, R., Gulino, C., Salzman, O., & Srinivasa, S. S. (2018) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2018.8460188 · Cited by 29
Group Marching Tree: Sampling-Based Approximately Optimal Motion Planning on GPUs
Ichter, B., Schmerling, E., & Pavone, M. (2017) · IEEE International Conference on Robotic Computing (IRC) · doi:10.1109/irc.2017.72 · Cited by 16
Self-citation
Cited by
Neural RRT*: Learning-Based Optimal Path Planning
Wang, J., Chi, W., Li, C., Wang, C., & Meng, M. Q.-H. (2020) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2020.2976560 · Cited by 555
Mobile Robot Path Planning in Dynamic Environments Through Globally Guided Reinforcement Learning
Wang, B., Liu, Z., Li, Q., & Prorok, A. (2020) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2020.3026638 · Cited by 372
Motion Planning Networks: Bridging the Gap Between Learning-Based and Classical Motion Planners
Qureshi, A. H., Miao, Y., Simeonov, A., & Yip, M. C. (2021) · IEEE Transactions on Robotics · doi:10.1109/tro.2020.3006716 · Cited by 287
Qureshi, A. H., Simeonov, A., Bency, M. J., & Yip, M. C. (2019) · 2019 International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2019.8793889 · Cited by 253
Habitat 2.0: Training home assistants to rearrange their habitat
Szot, A., Clegg, A., Undersander, E., Wijmans, E., Zhao, Y., Turner, J., Maestre, N., Mukadam, M., Chaplot, D., Maksymets, O., et al. (2021) · arXiv · doi:10.48550/arxiv.2106.14405 · Cited by 143
Metadata
- Authors
- Ichter, B., Harrison, J., & Pavone, M.
- Venue
- 2018 IEEE International Conference on Robotics and Automation (ICRA)
- Publisher
- IEEE
- Published
- 2018-05
- Pages
- 7087-7094
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2754453099
- Cited by
- 370
- References
- 30
- FWCI
- 11.62
- 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
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.