Group Marching Tree: Sampling-Based Approximately Optimal Motion Planning on GPUs
暂无分享,去创建一个
[1] Emilio Frazzoli,et al. Massively parallelizing the RRT and the RRT , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.
[2] Marco Pavone,et al. Fast marching tree: A fast marching sampling-based method for optimal motion planning in many dimensions , 2013, ISRR.
[3] Sebastian Scherer,et al. Flying Fast and Low Among Obstacles: Methodology and Experiments , 2008, Int. J. Robotics Res..
[4] Steven M. LaValle,et al. Time-optimal paths for a Dubins airplane , 2007, 2007 46th IEEE Conference on Decision and Control.
[5] Marco Pavone,et al. Optimal sampling-based motion planning under differential constraints: The drift case with linear affine dynamics , 2014, 2015 54th IEEE Conference on Decision and Control (CDC).
[6] Marco Pavone,et al. An asymptotically-optimal sampling-based algorithm for Bi-directional motion planning , 2015, 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).
[7] Marco Pavone,et al. Optimal sampling-based motion planning under differential constraints: The driftless case , 2014, 2015 IEEE International Conference on Robotics and Automation (ICRA).
[8] Marco Pavone,et al. Deterministic sampling-based motion planning: Optimality, complexity, and performance , 2015, ISRR.
[9] Steven M. LaValle,et al. Simple and Efficient Algorithms for Computing Smooth, Collision-free Feedback Laws Over Given Cell Decompositions , 2009, Int. J. Robotics Res..
[10] Andrew S. Grimshaw,et al. Scalable GPU graph traversal , 2012, PPoPP '12.
[11] Ron Alterovitz,et al. High-Frequency Replanning Under Uncertainty Using Parallel Sampling-Based Motion Planning , 2015, IEEE Transactions on Robotics.
[12] Russ Tedrake,et al. Robust Online Motion Planning with Regions of Finite Time Invariance , 2012, WAFR.
[13] Steven M. LaValle,et al. Planning algorithms , 2006 .
[14] Seongjai Kim,et al. An O(N) Level Set Method for Eikonal Equations , 2000, SIAM J. Sci. Comput..
[15] Emilio Frazzoli,et al. RRTX: Asymptotically optimal single-query sampling-based motion planning with quick replanning , 2016, Int. J. Robotics Res..
[16] Dinesh Manocha,et al. g-Planner: Real-time Motion Planning and Global Navigation using GPUs , 2010, AAAI.
[17] Nancy M. Amato,et al. Probabilistic roadmap methods are embarrassingly parallel , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).
[18] Didier Devaurs,et al. Parallelizing RRT on Large-Scale Distributed-Memory Architectures , 2013, IEEE Transactions on Robotics.
[19] Steven M. LaValle,et al. Motion Planning Part I: The Essentials , 2011 .
[20] Sam Ade Jacobs,et al. Blind RRT: A probabilistically complete distributed RRT , 2013, 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems.
[21] Charles Richter,et al. Bayesian Learning for Safe High-Speed Navigation in Unknown Environments , 2015, ISRR.
[22] Robert B. Dial,et al. Algorithm 360: shortest-path forest with topological ordering [H] , 1969, CACM.
[23] Peter Sanders,et al. [Delta]-stepping: a parallelizable shortest path algorithm , 2003, J. Algorithms.
[24] Steven M. LaValle. Motion Planning : Wild Frontiers , 2011 .
[25] Silvio Savarese,et al. 3D Semantic Parsing of Large-Scale Indoor Spaces , 2016, 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).
[26] Emilio Frazzoli,et al. Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..
[27] 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).
[28] Lydia E. Kavraki,et al. Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..
[29] Sam Ade Jacobs,et al. Using Load Balancing to Scalably Parallelize Sampling-Based Motion Planning Algorithms , 2014, 2014 IEEE 28th International Parallel and Distributed Processing Symposium.