Parallelizing RRT on Large-Scale Distributed-Memory Architectures
暂无分享,去创建一个
[1] Juan CortL. Disassembly Path Planning for Complex Articulated Objects , 2008 .
[2] Steven M. LaValle,et al. Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .
[3] Vipin Kumar,et al. Parallel search algorithms for robot motion planning , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.
[4] Michael Mikolajczak,et al. Designing And Building Parallel Programs: Concepts And Tools For Parallel Software Engineering , 1997, IEEE Concurrency.
[5] Jean-Paul Laumond,et al. Control of Probabilistic Diffusion in Motion Planning , 2008, WAFR.
[6] Enrico Pagello,et al. On Parallel RRTs for Multi-robot Systems , 2002 .
[7] Abderrahmane Kheddar,et al. Static multi-contact inverse problem for multiple humanoid robots and manipulated objects , 2010, 2010 10th IEEE-RAS International Conference on Humanoid Robots.
[8] Lydia E. Kavraki,et al. Kinodynamic Motion Planning by Interior-Exterior Cell Exploration , 2008, WAFR.
[9] Kostas E. Bekris,et al. Sampling-based roadmap of trees for parallel motion planning , 2005, IEEE Transactions on Robotics.
[10] M. Strandberg,et al. Augmenting RRT-planners with local trees , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.
[11] Michael M. Curtiss,et al. RRTs for nonlinear, discrete, and hybrid planning and control , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).
[12] Didier Devaurs,et al. Parallelizing RRT on distributed-memory architectures , 2011, 2011 IEEE International Conference on Robotics and Automation.
[13] Thierry Siméon,et al. A path planning approach for computing large-amplitude motions of flexible molecules , 2005, ISMB.
[14] Lydia E. Kavraki,et al. Distributed Sampling-Based Roadmap of Trees for Large-Scale Motion Planning , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.
[15] Juan Cort. Sampling-Based Path Planning on Configuration-Space Costmaps , 2010 .
[16] Florent Lamiraux,et al. Whole-body task planning for a humanoid robot: a way to integrate collision avoidance , 2009, 2009 9th IEEE-RAS International Conference on Humanoid Robots.
[17] Howie Choset,et al. Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .
[18] George Karypis,et al. Introduction to Parallel Computing Solution Manual , 2003 .
[19] Lydia E. Kavraki,et al. Quantitative Analysis of Nearest-Neighbors Search in High-Dimensional Sampling-Based Motion Planning , 2006, WAFR.
[20] Thierry Siméon,et al. Adaptive tuning of the sampling domain for dynamic-domain RRTs , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.
[21] Siddhartha S. Srinivasa,et al. Task Space Regions , 2011, Int. J. Robotics Res..
[22] Emilio Frazzoli,et al. Improving the Performance of Sampling-Based Motion Planning With Symmetry-Based Gap Reduction , 2008, IEEE Transactions on Robotics.
[23] Stefano Caselli,et al. ERPP: An experience-based randomized path planner , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).
[24] Nikolaus Correll,et al. Any-Com Multi-robot Path-Planning: Maximizing Collaboration for Variable Bandwidth , 2010, DARS.
[25] Vijay Kumar,et al. Computational Techniques for Analysis of Genetic Network Dynamics , 2005, Int. J. Robotics Res..
[26] Emilio Frazzoli,et al. Massively parallelizing the RRT and the RRT , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.
[27] Diego Borro,et al. Parallel RRT-based path planning for selective disassembly planning , 2008 .
[28] Emilio Frazzoli,et al. Improving the performance of sampling-based planners by using a symmetry-exploiting gap reduction algorithm , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.
[29] Dominik Henrich,et al. Fast Motion Planning by Parallel Processing – a Review , 1997, J. Intell. Robotic Syst..
[30] Steven M. LaValle,et al. Improving Motion-Planning Algorithms by Efficient Nearest-Neighbor Searching , 2007, IEEE Transactions on Robotics.
[31] Thierry Siméon,et al. Sampling-Based Motion Planning under Kinematic Loop-Closure Constraints , 2004, WAFR.
[32] Steven M. LaValle,et al. Randomized Kinodynamic Planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).
[33] Nancy M. Amato,et al. Probabilistic roadmap methods are embarrassingly parallel , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).
[34] Nancy M. Amato,et al. An obstacle-based rapidly-exploring random tree , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..
[35] Daniel W. Watson,et al. Path planning for altruistically negotiating processes , 2005, Proceedings of the 2005 International Symposium on Collaborative Technologies and Systems, 2005..
[36] Steven M. LaValle,et al. Planning algorithms , 2006 .
[37] Jean-Claude Latombe,et al. Randomized Kinodynamic Motion Planning with Moving Obstacles , 2002, Int. J. Robotics Res..
[38] Emilio Frazzoli,et al. Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..