The DOI matches its Crossref record; 61 of the 61 references it cites were found in a registry or an index.
Motion Planning Networks: Bridging the Gap Between Learning-Based and Classical Motion Planners
Open accessAbstract
This article describes motion planning networks (MPNet), a computationally efficient, learning-based neural planner for solving motion planning problems.MPNet uses neural networks to learn general near-optimal heuristics for path planning in seen and unseen environments. It takes environment information such as raw point cloud from depth sensors, as well as a robot's initial and desired goal configurations and recursively calls itself to bidirectionally generate connectable paths. In addition to finding directly connectable and near-optimal paths in a single pass, we show that worst-case theoretical guarantees can be proven if we merge this neural network strategy with classical sample-based planners in a hybrid approach while still retaining significant computational and optimality improvements. To train the MPNet models, we present an active continual learning approach that enables MPNet to learn from streaming data and actively ask for expert demonstrations when needed, drastically reducing data for training. We validate MPNet against gold-standard and state-of-the-art planning methods in a variety of problems from two-dimensional to seven-dimensional robot configuration spaces in challenging and cluttered environments, with results showing significant and consistently stronger performance metrics, and motivating neural planning in general as a modern strategy for solving motion planning problems efficiently.
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
(2014) · Cited by 33,419
Human-level control through deep reinforcement learning
Mnih, V., Kavukcuoglu, K., Silver, D., Rusu, A. A., Veness, J., Bellemare, M. G., Graves, A., Riedmiller, M., Fidjeland, A. K., Ostrovski, G., et al. (2015) · Nature · doi:10.1038/nature14236 · Cited by 30,357
Auto-Encoding Variational Bayes
Kingma, D. P., & Welling, M. (2013) · arXiv · doi:10.48550/arxiv.1312.6114 · Cited by 20,067
GAN(Generative Adversarial Nets)
(2017) · Journal of Japan Society for Fuzzy Theory and Intelligent Informatics · doi:10.3156/jsoft.29.5_177_2 · Cited by 19,270
Continuous control with deep reinforcement learning
Lillicrap, T. P., Hunt, J. J., Pritzel, A., Heess, N., Erez, T., Tassa, Y., Silver, D., & Wierstra, D. (2015) · arXiv · doi:10.48550/arxiv.1509.02971 · Cited by 10,782
(2010) · Cited by 8,261
Real-Time Obstacle Avoidance for Manipulators and Mobile Robots
Khatib, O. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500106 · Cited by 7,894 · cited 3×
“stones for motion planning including resolution-complete planners such artificial potential fields [6], sample-based motion planners such as rapidly exploring random trees (RRT) [4] and”
BackgroundMethodIntroduction to Reinforcement Learning
Sutton, R. S., & Barto, A. G. (1998) · The MIT Press eBooks · Cited by 6,855
Dropout as a bayesian approximation: Representing model uncertainty in deep learning
Gal, Y., & Ghahramani, Z. (2015) · arXiv · doi:10.48550/arxiv.1506.02142 · Cited by 6,471
Latombe, J.-C. (1991) · Springer eBooks · doi:10.1007/978-1-4615-4022-9 · Cited by 6,396
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
Rapidly-exploring random trees : a new tool for path planning
LaValle, S. M. (1998) · Cited by 3,704
RRT-connect: An efficient approach to single-query path planning
Kuffner, J. J., & LaValle, S. M. (2000) · Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065) · doi:10.1109/robot.2000.844730 · Cited by 3,555
Simple Statistical Gradient-Following Algorithms for Connectionist Reinforcement Learning
Williams, R. J. (1992) · Machine Learning · doi:10.1007/bf00992696 · Cited by 3,416
(2017) · International Conference on Learning Representations · Cited by 3,248
Reinforcement learning in robotics: A survey
Kober, J., Bagnell, J. A., & Peters, J. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913495721 · Cited by 3,160
An algorithm for planning collision-free paths among polyhedral obstacles
Lozano-Pérez, T., & Wesley, M. A. (1979) · Communications of the ACM · doi:10.1145/359156.359164 · Cited by 2,304
Levine, S., Pastor, P., Krizhevsky, A., Ibarz, J., & Quillen, D. (2018) · The International Journal of Robotics Research · doi:10.1177/0278364917710318 · Cited by 1,971
The Open Motion Planning Library
Sucan, I. A., Moll, M., & Kavraki, L. E. (2012) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2012.2205651 · Cited by 1,616
Contractive Auto-Encoders: Explicit Invariance During Feature Extraction
Rifai, S., Vincent, P., Muller, X., Glorot, X., & Bengio, Y. (2011) · International Conference on Machine Learning · Cited by 1,600
Real-Time Obstacle Avoidance for Manipulators and Mobile Robots
Khatib, O. (1986) · Autonomous Robot Vehicles · doi:10.1007/978-1-4613-8997-2_29 · Cited by 1,569
Deep reinforcement learning for robotic manipulation with asynchronous off-policy updates
Gu, S., Holly, E., Lillicrap, T., & Levine, S. (2017) · 2017 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2017.7989385 · Cited by 1,424
Gradient Episodic Memory for Continual Learning
Lopez-Paz, D., & Ranzato, M. (2017) · arXiv · doi:10.48550/arxiv.1706.08840 · Cited by 1,403
The complexity of robot motion planning
Canny, J. (1988) · Medical Entomology and Zoology · Cited by 1,375
End-to-End Training of Deep Visuomotor Policies
Levine, S., Finn, C., Darrell, T. J., & Abbeel, P. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1504.00702 · Cited by 1,344
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
Benchmarking Deep Reinforcement Learning for Continuous Control
Duan, Y., Chen, X., Houthooft, R., Schulman, J., & Abbeel, P. (2016) · arXiv · doi:10.48550/arxiv.1604.06778 · Cited by 1,114
Simple statistical gradient-following algorithms for connectionist reinforcement learning
Williams, R. J. (1992) · Machine Learning · doi:10.1023/a:1022672621406 · Cited by 817
Geometric Loss Functions for Camera Pose Regression with Deep Learning
Kendall, A., & Cipolla, R. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.694 · Cited by 803
Schwartz, J. T., & Sharir, M. (1983) · Advances in Applied Mathematics · doi:10.1016/0196-8858(83)90014-3 · Cited by 801
A Survey on Policy Search for Robotics
Deisenroth, M. P. (2011) · Foundations and Trends in Robotics · doi:10.1561/2300000021 · Cited by 798
A subdivision algorithm in configuration space for findpath with rotation
Brooks, R. A., & Lozano-Perez, T. (1985) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1985.6313352 · Cited by 550
Implementing Discrete Mathematics: Combinatorics And Graph Theory With Mathematica
Skiena, S. (1990) · Medical Entomology and Zoology · Cited by 546
Experience Replay for Continual Learning
Rolnick, D., Ahuja, A., Schwarz, J., Lillicrap, T. P., & Wayne, G. (2018) · arXiv · doi:10.48550/arxiv.1811.11682 · Cited by 529
Tamar, A., Wu, Y., Thomas, G., Levine, S., & Abbeel, P. (2017) · Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/700 · Cited by 484
Gammell, J. D., Srinivasa, S. S., & Barfoot, T. D. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7139620 · Cited by 416
Gammell, J. D., Srinivasa, S. S., & Barfoot, T. D. (2015) · Cited by 398
Learning Sampling Distributions for Robot Motion Planning
Ichter, B., Harrison, J., & Pavone, M. (2018) · 2018 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2018.8460730 · Cited by 370
Selective Experience Replay for Lifelong Learning
Isele, D., & Cosgun, A. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11595 · Cited by 347
Data-efficient Deep Reinforcement Learning for Dexterous ManipulationPreprint
Popov, I., Heess, N., Lillicrap, T., Hafner, R., Barth-Maron, G., Vecerík, M., Lampe, T., Tassa, Y., Erez, T., & Riedmiller, M. A. (2017) · arXiv.org · doi:10.48550/arxiv.1704.03073 · Cited by 287
Qureshi, A. H., & Ayaz, Y. (2015) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2015.02.007 · Cited by 262
Self-citationQureshi, 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
Self-citationPotential functions based sampling heuristic for optimal path planning
Qureshi, A. H., & Ayaz, Y. (2016) · Autonomous Robots · doi:10.1007/s10514-015-9518-0 · Cited by 248
Self-citationRobot Motion Planning in Learned Latent Spaces
Ichter, B., & Pavone, M. (2019) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2019.2901898 · Cited by 203
Lazy collision checking in asymptotically-optimal motion planning
Hauser, K. K. (2015) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2015.7139603 · Cited by 202
Parametric Exponential Linear Unit for Deep Convolutional Neural Networks
Trottier, L., Giguere, P., & Chaib-draa, B. (2017) · 2017 16th IEEE International Conference on Machine Learning and Applications (ICMLA) · doi:10.1109/icmla.2017.00038 · Cited by 200
Potentially guided bidirectionalized RRT* for fast optimal path planning in cluttered environments
Tahir, Z., Qureshi, A. H., Ayaz, Y., & Nawaz, R. (2018) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2018.06.013 · Cited by 175
Self-citationCollective robot reinforcement learning with distributed asynchronous guided policy search
Yahya, A., Li, A., Kalakrishnan, M., Chebotar, Y., & Levine, S. (2017) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2017.8202141 · Cited by 143
Path integral guided policy search
Chebotar, Y., Kalakrishnan, M., Yahya, A., Li, A., Schaal, S., & Levine, S. (2017) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2017.7989384 · Cited by 131
Experience Replay for Continual LearningPreprint
Rolnick, D., Ahuja, A., Schwarz, J., Lillicrap, T., & Wayne, G. (2019) · arXiv (Cornell University) · Cited by 124
Fast smoothing of manipulator trajectories using optimal bounded-acceleration shortcuts
Hauser, K. K., & Ng‐Thow‐Hing, V. (2010) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2010.5509683 · Cited by 113
Neural Path Planning: Fixed Time, Near-Optimal Path Generation via Oracle Imitation
Bency, M. J., Qureshi, A. H., & Yip, M. C. (2019) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros40897.2019.8968089 · Cited by 110
Self-citationDemonstration-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
Learning Heuristic Search via ImitationPreprint
Bhardwaj, M., Choudhury, S., & Scherer, S. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1707.03034 · Cited by 94
Deeply Informed Neural Sampling for Robot Motion Planning
Qureshi, A. H., & Yip, M. C. (2018) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2018.8593772 · Cited by 89
Self-citationLearning Implicit Sampling Distributions for Motion Planning
Zhang, C., Huh, J., & Lee, D. D. (2018) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2018.8594028 · Cited by 86
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
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
Janson, L., & Pavone, M. (2016) · Springer tracts in advanced robotics · doi:10.1007/978-3-319-28872-7_38 · Cited by 36
Composing Task-Agnostic Policies with Deep Reinforcement LearningPreprint
Qureshi, A. H., Johnson, J. J., Qin, Y., Henderson, T., Boots, B., & Yip, M. C. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.10681 · Cited by 19
Self-citation
Cited by
Morales, E. F., Murrieta-Cid, R., Becerra, I., & Esquivel-Basaldua, M. A. (2021) · Intelligent Service Robotics · doi:10.1007/s11370-021-00398-z · Cited by 101
Metadata
- Authors
- Qureshi, A. H., Miao, Y., Simeonov, A., & Yip, M. C.
- Venue
- IEEE Transactions on Robotics
- Published
- 2021-02
- Volume
- 37
- Issue
- 1
- Pages
- 48-66
- ISSN
- 1552-3098 (ISSN-L)
- 1941-0468
- OpenAlex
- W2961188780
- Cited by
- 287
- References
- 61
- FWCI
- 12.27
- 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.