A Bayesian Active Learning Approach to Adaptive Motion Planning
暂无分享,去创建一个
[1] Siddhartha S. Srinivasa,et al. Pareto-optimal search over configuration space beliefs for anytime motion planning , 2016, 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).
[2] Andreas Krause,et al. Submodular Surrogates for Value of Information , 2015, AAAI.
[3] John Canny,et al. The complexity of robot motion planning , 1988 .
[4] Siddhartha S. Srinivasa,et al. Near-Optimal Edge Evaluation in Explicit Generalized Binomial Graphs , 2017, NIPS.
[5] Siddhartha S. Srinivasa,et al. Batch Informed Trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs , 2014, 2015 IEEE International Conference on Robotics and Automation (ICRA).
[6] Jeff A. Bilmes,et al. Interactive Submodular Set Cover , 2010, ICML.
[7] Lydia E. Kavraki,et al. A two level fuzzy PRM for manipulation planning , 2000, Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113).
[8] Emilio Frazzoli,et al. Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..
[9] Lydia E. Kavraki,et al. Path planning using lazy PRM , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).
[10] Sanjoy Dasgupta,et al. Analysis of a greedy active learning strategy , 2004, NIPS.
[11] Daniel D. Lee,et al. Learning high-dimensional Mixture Models for fast collision detection in Rapidly-Exploring Random Trees , 2016, 2016 IEEE International Conference on Robotics and Automation (ICRA).
[12] S. LaValle,et al. Randomized Kinodynamic Planning , 2001 .
[13] Maxim Likhachev,et al. Heuristic Search on Graphs with Existence Priors for Expensive-to-Evaluate Edges , 2017, ICAPS.
[14] Andreas Krause,et al. Near-Optimal Bayesian Active Learning with Noisy Observations , 2010, NIPS.
[15] Siddhartha S. Srinivasa,et al. Densification strategies for anytime motion planning over large dense roadmaps , 2016, 2017 IEEE International Conference on Robotics and Automation (ICRA).
[16] Fabio Tozeto Ramos,et al. Hilbert maps: scalable continuous occupancy mapping with stochastic gradient descent , 2015, Robotics: Science and Systems.
[17] Andreas Krause,et al. Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization , 2010, J. Artif. Intell. Res..
[18] Alonzo Kelly,et al. List prediction applied to motion planning , 2016, 2016 IEEE International Conference on Robotics and Automation (ICRA).
[19] Siddhartha S. Srinivasa,et al. A Unifying Formalism for Shortest Path Problems with Expensive Edge Evaluations via Lazy Best-First Search over Paths with Edge Selectors , 2016, ICAPS.
[20] Oliver Brock,et al. Sampling-Based Motion Planning Using Predictive Models , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.
[21] Dinesh Manocha,et al. Faster Sample-Based Motion Planning Using Instance-Based Learning , 2012, WAFR.
[22] Benjamin Van Roy,et al. (More) Efficient Reinforcement Learning via Posterior Sampling , 2013, NIPS.
[23] Steven M. LaValle,et al. Planning algorithms , 2006 .
[24] Andreas Krause,et al. Near Optimal Bayesian Active Learning for Decision Making , 2014, AISTATS.