Motion Planning for Knot Untangling
暂无分享,去创建一个
[1] Louis H. Kauffman,et al. Physically-Based Stochastic Simplification of Mathematical Knots , 1997, IEEE Trans. Vis. Comput. Graph..
[2] Nancy M. Amato,et al. Using Motion Planning to Study Protein Folding Pathways , 2002, J. Comput. Biol..
[3] Jean-Claude Latombe,et al. Capturing molecular energy landscapes with probabilistic conformational roadmaps , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).
[4] Leonidas J. Guibas,et al. Emerging Challenges in Computational Topology , 1999, ArXiv.
[5] Lydia E. Kavraki,et al. Planning Paths for Elastic Objects under Manipulation Constraints , 2001, Int. J. Robotics Res..
[6] David Hsu,et al. Randomized single-query motion planning in expansive spaces , 2000 .
[7] C. Aneziris. The mystery of knots : computer programming for knot tabulation , 1999 .
[8] Jeffrey C. Lagarias,et al. The computational complexity of knot and link problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[9] Jean-Claude Latombe,et al. A Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking , 2001, ISRR.
[10] W. Thurston,et al. The Computational Complexity of Knot Genus and Spanning Area , 2002, math/0205057.
[11] Lydia E. Kavraki,et al. Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..
[12] Steven M. LaValle,et al. RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).
[13] X. Dai,et al. THE MINIMUM OF KNOT ENERGY FUNCTIONS , 2000 .
[14] J. Little,et al. Interactive topological drawing , 1998 .
[15] E. L. Zechiedrich,et al. Topoisomerase IV, alone, unknots DNA in E. coli. , 2001, Genes & development.
[16] S. LaValle,et al. Randomized Kinodynamic Planning , 2001 .
[17] Lydia E. Kavraki,et al. Simulated knot tying , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).
[18] Y. Diao,et al. In Search of a Good Polygonal Knot Energy , 1997 .
[19] J. Sethian,et al. Recognizing Knots Using Simulated Annealing , 1994 .
[20] W. Lickorish,et al. An Introduction to Knot Theory , 1997 .
[21] Lydia E. Kavraki,et al. A dimensionality reduction approach to modeling protein flexibility , 2002, RECOMB '02.
[22] J. Simon. ENERGY FUNCTIONS FOR POLYGONAL KNOTS , 1994 .
[23] Sergei Vassilvitskii,et al. A complete, local and parallel reconfiguration algorithm for cube style modular robots , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).
[24] Nancy M. Amato,et al. Probabilistic roadmap motion planning for deformable objects , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).
[25] Louis H. Kauffman,et al. Untangling knots by stochastic energy optimization , 1996, Proceedings of Seventh Annual IEEE Visualization '96.
[26] J. Weeks,et al. The first 1,701,936 knots , 1998 .
[27] Jean-Claude Latombe,et al. Stochastic roadmap simulation: an efficient representation and algorithm for analyzing molecular motion , 2002, RECOMB '02.
[28] D. Welsh,et al. On the computational complexity of the Jones and Tutte polynomials , 1990, Mathematical Proceedings of the Cambridge Philosophical Society.
[29] Rajeev Motwani,et al. Path planning in expansive configuration spaces , 1997, Proceedings of International Conference on Robotics and Automation.
[30] Nancy M. Amato,et al. Choosing good paths for fast distributed reconfiguration of hexagonal metamorphic robots , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).
[31] B. Peter,et al. Knot what we thought before: the twisted story of replication. , 1999, BioEssays : news and reviews in molecular, cellular and developmental biology.
[32] Lydia E. Kavraki,et al. Generalizing the analysis of PRM , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).
[33] P. Boldi,et al. TOWARDS AN IMPLEMENTATION OF THE B–H ALGORITHM FOR RECOGNIZING THE UNKNOT , 2001, math/0102177.
[34] J. Lagarias,et al. The number of Reidemeister moves needed for unknotting , 1998, math/9807012.
[35] Nancy M. Amato,et al. Using motion planning to study protein folding pathways , 2001, J. Comput. Biol..