Optimization Techniques for Robot Path Planning
暂无分享,去创建一个
[1] Lydia E. Kavraki,et al. Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..
[2] Hiroshi Nagamochi,et al. A Multi-sphere Scheme for 2D and 3D Packing Problems , 2007, SLS.
[3] Bruce Randall Donald,et al. On the complexity of kinodynamic planning , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[4] Micha Sharir,et al. Planning, geometry, and complexity of robot motion , 1986 .
[5] Philip M. Hubbard,et al. Approximating polyhedra with spheres for time-critical collision detection , 1996, TOGS.
[6] Cherif Ahrikencheikh,et al. Optimized-Motion Planning: Theory and Implementation , 1994 .
[7] J. Schwartz,et al. On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .
[8] Fouad Bennis,et al. 2D Multi-Objective Placement Algorithm for Free-Form Components , 2009, DAC 2009.
[9] Simon Parsons,et al. Principles of Robot Motion: Theory, Algorithms and Implementations by Howie Choset, Kevin M. Lynch, Seth Hutchinson, George Kantor, Wolfram Burgard, Lydia E. Kavraki and Sebastian Thrun, 603 pp., $60.00, ISBN 0-262-033275 , 2007, The Knowledge Engineering Review.
[10] T. Imamichi,et al. Designing Algorithms with Multi-sphere Scheme , 2008, International Conference on Informatics Education and Research for Knowledge-Circulating Society (icks 2008).
[11] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .
[12] John Canny,et al. The complexity of robot motion planning , 1988 .
[13] Fouad Bennis,et al. Interactive optimization strategies for layout problems , 2010 .
[14] Tomás Lozano-Pérez,et al. Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.
[15] J. T. Shwartz,et al. On the Piano Movers' Problem : III , 1983 .
[16] Lydia E. Kavraki,et al. Analysis of probabilistic roadmaps for path planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.
[17] Lydia E. Kavraki,et al. A Random Sampling Scheme for Path Planning , 1997, Int. J. Robotics Res..
[18] Mark H. Overmars,et al. A Comparative Study of Probabilistic Roadmap Planners , 2002, WAFR.
[19] Siddhartha S. Srinivasa,et al. CHOMP: Gradient optimization techniques for efficient motion planning , 2009, 2009 IEEE International Conference on Robotics and Automation.
[20] Micha Sharir,et al. Motion planning in the presence of moving obstacles , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[21] Takashi Imamichi,et al. Nonlinear programming based algorithms to cutting and packing problems , 2009 .
[22] Joseph O'Rourke,et al. Computational geometry in C (2nd ed.) , 1998 .
[23] N. Amato,et al. A motion planning approach to protein folding , 2003 .
[24] Hiroshi Nagamochi,et al. Performance Analysis of a Collision Detection Algorithm of Spheres Based on Slab Partitioning , 2008, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..
[25] J. O´Rourke,et al. Computational Geometry in C: Arrangements , 1998 .
[26] Stephen J. Wright,et al. Numerical Optimization , 2018, Fundamental Statistical Inference.
[27] Jean-Daniel Boissonnat,et al. Algorithmic Foundations of Robotics V, Selected Contributions of the Fifth International Workshop on the Algorithmic Foundations of Robotics, WAFR 2002, Nice, France, December 15-17, 2002 , 2004, WAFR.
[28] Jean-Claude Latombe,et al. Robot motion planning , 1970, The Kluwer international series in engineering and computer science.
[29] Nancy M. Amato,et al. Using Motion Planning to Study Protein Folding Pathways , 2002, J. Comput. Biol..