{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T06:17:02Z","timestamp":1725689822667},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642073410"},{"type":"electronic","value":"9783540450580"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-45058-0_2","type":"book-chapter","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T15:51:48Z","timestamp":1340812308000},"page":"7-23","source":"Crossref","is-referenced-by-count":6,"title":["Motion Planning for Knot Untangling"],"prefix":"10.1007","author":[{"given":"Andrew M.","family":"Ladd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lydia E.","family":"Kavraki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"I. Agol, J. Hass, and W. Thurston. The computational complexity of knot genus and spanning area, (preprint.)."},{"key":"2_CR2","volume-title":"Series on Knots and Everything","author":"C. N. Anerizis","year":"1999","unstructured":"C. N. Anerizis. The Mystery of Knots - Computer Programming for Knot Tabulation. Series on Knots and Everything. World Scientifical Publishing Co. Pte. Ltd., 1999."},{"key":"2_CR3","volume-title":"International Conference on Computational Molecular Biology (RECOMB)","author":"M. Apaydin","year":"2002","unstructured":"M. Apaydin, D. Brutlag, C. Guestrin, D. Hsu, and J. Latombe. Stochastic roadmap simulation: An efficient representation and algorithm for analyzing molecular motion. In International Conference on Computational Molecular Biology (RECOMB), April 2002."},{"key":"2_CR4","volume-title":"IEEE International Conference on Robotics and Automation (ICRA)","author":"M. Apaydin","year":"2001","unstructured":"M. Apaydin, A. Singh, D. Brutlag, and J. Latombe. Capturing molecular energy landscapes with probabilistic conformal roadmaps. In IEEE International Conference on Robotics and Automation (ICRA), May 2001."},{"key":"2_CR5","volume-title":"IEEE International Conference on Robotics and Automation","author":"O. Bayazit","year":"2002","unstructured":"O. Bayazit, J.-M. Lien, and N. Amato. Probabilistic roadmap motion planning for deformable objects. In IEEE International Conference on Robotics and Automation, 2002."},{"key":"2_CR6","volume-title":"Emerging challenges in computational topology","author":"M. Bern","year":"1999","unstructured":"M. Bern, D. Eppstein, and al. Emerging challenges in computational topology, 1999."},{"key":"2_CR7","volume-title":"Knots-2000","author":"J. S. Birman","year":"2000","unstructured":"J. S. Birman, P. Boldi, M. Rampichini, and S. Vigna. Towards an implementation of the b-h algorithm for recognizing the unknot. In KNOTS-2000, 2000."},{"key":"2_CR8","volume-title":"IEEE International Conference on Robotics and Automation","author":"Z. Butler","year":"2001","unstructured":"Z. Butler, K. Kotay, D. Rus, and K. Tomita. Cellular automata for decentralized control of self-reconfigurable robots. In IEEE International Conference on Robotics and Automation, 2001."},{"issue":"6","key":"2_CR9","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1142\/S0218216500000402","volume":"9","author":"X. Dai","year":"2000","unstructured":"X. Dai and Y. Diao. The minimum of knot energy functions. Journal of Knot Theory and its Ramifications, 9 (6): 713\u2013724, 2000.","journal-title":"Journal of Knot Theory and its Ramifications"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1101\/gad.872301","volume":"15","author":"R. Deibler","year":"2001","unstructured":"R. Deibler, S. Rahmati, and E. Zechiedrich. Topoisomerase iv, alone, unknots dna in escherichia coli. Genes and Development, 15: 748\u2013761, 2001.","journal-title":"Genes and Development"},{"issue":"5","key":"2_CR11","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1142\/S0218216597000352","volume":"6","author":"Y. Diao","year":"1997","unstructured":"Y. Diao, C. Ernst, and J. Rensburg. In search of a good polygonal knot energy. Journal of Knot Theory and its Ramifications, 6(5):633\u2013657, 1997.","journal-title":"Journal of Knot Theory and its Ramifications"},{"key":"2_CR12","first-page":"279","volume-title":"IEEE Visualization","author":"R. Grzeszczuk","year":"1996","unstructured":"R. Grzeszczuk, M. Huang, and L. Kauffman. Untangling knots by stochastic energy optimization. IEEE Visualization, pages 279\u2013286, 1996."},{"issue":"3","key":"2_CR13","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1109\/2945.620492","volume":"3","author":"R. Grzeszczuk","year":"1997","unstructured":"R. Grzeszczuk, M. Huang, and L. Kauffman. Physically-based stochastic simplification of mathematical knots. IEEE Transactions on Visualization and Computer Graphics, 3 (3): 262\u2013278, 1997.","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"2_CR14","unstructured":"J. Hass and J. Lagarias. The number of reidemeister moves needed for unknotting. (preprint.)."},{"key":"2_CR15","first-page":"172","volume-title":"IEEE Symposium on Foundations of Computer Science","author":"J. Hass","year":"1997","unstructured":"J. Hass, J. C. Lagarias, and N. Pippenger. The computational complexity of knot and link problems. In IEEE Symposium on Foundations of Computer Science, pages 172\u2013181, 1997."},{"issue":"4","key":"2_CR16","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF03025227","volume":"20","author":"J. Hoste","year":"1998","unstructured":"J. Hoste and M. Thistlethwaite. The first 1,701,936 knots. Math. Intelligencer, 20 (4): 33\u201348, 1998.","journal-title":"Math. Intelligencer"},{"key":"2_CR17","volume-title":"Randomized Single-Query Motion Planning In Expansive Spaces","author":"D. Hsu","year":"2000","unstructured":"D. Hsu. Randomized Single-Query Motion Planning In Expansive Spaces. PhD thesis, Department of Computer Science, Stanford University, 2000."},{"key":"2_CR18","first-page":"247","volume-title":"Algorithmic and Computational Robotics: New Directions: The Fourth International Workshop on the Algorithmic Foundations of Robotics","author":"D. Hsu","year":"2001","unstructured":"D. Hsu, R. Kindel, J. Latombe, and S. Rock. Control-based randomized motion planning for dynamic environments. In Algorithmic and Computational Robotics: New Directions: The Fourth International Workshop on the Algorithmic Foundations of Robotics, pages 247\u2013264, 2001."},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"2719","DOI":"10.1109\/ROBOT.1997.619371","volume-title":"Proc. IEEE Intl Conf. on Robotics and Automation","author":"D. Hsu","year":"1997","unstructured":"D. Hsu, J. Latombe, and R. Motwani. Path planning in expansive spaces. In Proc. IEEE Int\u2019l Conf. on Robotics and Automation, pages 2719\u20132726, 1997."},{"key":"2_CR20","first-page":"35","volume-title":"Math. Proc. Camb. Phil. Soc","author":"F. Jaeger","year":"1990","unstructured":"F. Jaeger, D. L. Vertigan, and D. Welsh. On the computational complexity of the jones and tutte polynomials. In Math. Proc. Camb. Phil. Soc108, pages 35\u201353, 1990.","edition":"108"},{"key":"2_CR21","volume-title":"A dynamic approach to calculating the homfly polynomial for directed knots and links","author":"R. Jenkins","year":"1989","unstructured":"R. Jenkins. A dynamic approach to calculating the homfly polynomial for directed knots and links. Master\u2019s thesis, Carnegie Mellon University, 1989."},{"issue":"4","key":"2_CR22","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1109\/70.508439","volume":"12","author":"L. E. Kavraki","year":"1996","unstructured":"L. E. Kavraki, P. Svestka, J.-C. Latombe, and M. H. Overmars. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. Transaction on Robotics and Automation, 12 (4): 566\u2013580, June 1996.","journal-title":"Transaction on Robotics and Automation"},{"key":"2_CR23","first-page":"473","volume-title":"Proc. IEEE Intl Conf. on Robotics and Automation","author":"J. J. Kuffner","year":"1999","unstructured":"J. J. Kuffner and S. M. LaValle. Randomized kinodynamic planning. In Proc. IEEE Int\u2019l Conf. on Robotics and Automation, pages 473\u2013479, 1999."},{"key":"2_CR24","volume-title":"Proc. IEEE Intl Conf. on Robotics and Automation","author":"J. J. Kuffner","year":"2000","unstructured":"J. J. Kuffner and S. M. LaValle. RRT-connect: An efficient approach to single-query path planning. In Proc. IEEE Int\u2019l Conf. on Robotics and Automation, 2000."},{"issue":"5","key":"2_CR25","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1177\/02783640122067453","volume":"20","author":"J. J. Kuffner","year":"2001","unstructured":"J. J. Kuffner and S. M. LaValle. Randomized kinodynamic planning. International Journal of Robotics Research, 20 (5): 378\u2013400, May 2001.","journal-title":"International Journal of Robotics Research"},{"key":"2_CR26","first-page":"293","volume-title":"Algorithmic and Computational Robotics: New Directions: The Fourth International Workshop on the Algorithmic Foundations of Robotics","author":"J. J. Kuffner","year":"2001","unstructured":"J. J. Kuffner and S. M. LaValle. Rapidly exploring random trees: Progress and prospects. In Algorithmic and Computational Robotics: New Directions: The Fourth International Workshop on the Algorithmic Foundations of Robotics, pages 293\u2013308, 2001."},{"key":"2_CR27","volume-title":"IEEE International Conference on Robotics and Automation","author":"A. Ladd","year":"2002","unstructured":"A. Ladd and L. Kavraki. A measure theoretic analysis of prm. In IEEE International Conference on Robotics and Automation, May 2002."},{"key":"2_CR28","first-page":"20","volume-title":"International Journal of Robotics Research","author":"F. Lamiraux","year":"2001","unstructured":"F. Lamiraux and L. Kavraki. Planning paths for elastic objects. International Journal of Robotics Research, 20 (3), 2001.","edition":"3"},{"key":"2_CR29","volume-title":"Springer","author":"W. Lickorish","year":"1997","unstructured":"W. Lickorish. An Introduction to Knot Theory. Springer, 1997."},{"issue":"4","key":"2_CR30","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1142\/S0218216594000356","volume":"3","author":"T. Ligocki","year":"1994","unstructured":"T. Ligocki and J. A. Sethian. Recognizing knots using simulated annealing. Journal of Knot Theory and Its Ramifications, 3 (4): 477\u2013495, 1994.","journal-title":"Journal of Knot Theory and Its Ramifications"},{"key":"2_CR31","volume-title":"IEEE International Conference on Robotics and Automation","author":"J. Phillips","year":"2002","unstructured":"J. Phillips, A. Ladd, and L. Kavraki. Simulated knot tying. In IEEE International Conference on Robotics and Automation, May 2002."},{"key":"2_CR32","first-page":"805","volume":"21","author":"L. Postow","year":"1999","unstructured":"L. Postow, B. Peter, and N. Cozzarelli. Knot what we thought before: The twisted story of replication. BioEssays, 21: 805\u2013808, 1999.","journal-title":"Bio Essays"},{"key":"2_CR33","volume-title":"Isrr","author":"G. Sanchez","year":"2001","unstructured":"G. Sanchez and J.-C. Latombe. A single-query bi-directional probabilistic roadmap planner with lazy collision checking. In ISRR, 2001."},{"key":"2_CR34","volume-title":"Interactive Topological Drawing","author":"R. Scharein","year":"1988","unstructured":"R. Scharein. Interactive Topological Drawing. PhD thesis, University of British Columbia, 1988."},{"key":"2_CR35","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1142\/S021821659400023X","volume":"3","author":"J. Simon","year":"1994","unstructured":"J. Simon. Energy functions for polygonal knots. J. Knot Theory and its Ramif., 3: 299\u2013320, 1994.","journal-title":"J. Knot Theory and its Ramif."},{"key":"2_CR36","first-page":"287","volume-title":"International Conference on Computational Molecular Biology (RE- COMB)","author":"G. Song","year":"2001","unstructured":"G. Song and N. Amato. Using motion planning to study protein folding pathways. In International Conference on Computational Molecular Biology (RE- COMB), pages 287\u2013296, April 2001."},{"key":"2_CR37","volume-title":"International Conference on Computational Molecular Biology (RECOMB)","author":"M. Teodoro","year":"2002","unstructured":"M. Teodoro, G. Phillips, and L. Kavraki. A dimensionality reduction approach to modeling protein flexibility. In International Conference on Computational Molecular Biology (RECOMB), April 2002."},{"key":"2_CR38","volume-title":"IEEE International Conference on Robotics and Automation (ICRA)","author":"S. Vassilvitskii","year":"2002","unstructured":"S. Vassilvitskii, J. Suh, and M. Yim. A complete, local and parallel reconfiguration algorithm for cube style modular robots. In IEEE International Conference on Robotics and Automation (ICRA), May 2002."},{"key":"2_CR39","volume-title":"IEEE International Conference on Robotics and Automation","author":"J. Walter","year":"2002","unstructured":"J. Walter, B. Tsai, and N. Amato. Choosing good paths for fast distributed reconfiguration of hexagonal met amorphic robots. In IEEE International Conference on Robotics and Automation, 2002."},{"key":"2_CR40","volume-title":"Ming user manual","author":"Y.-Q. Wu","year":"1996","unstructured":"Y.-Q. Wu. Ming user manual, www.math.uiowa.edu\/wu\/ming\/ming.pdf, 1996."}],"container-title":["Springer Tracts in Advanced Robotics","Algorithmic Foundations of Robotics V"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45058-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T17:01:50Z","timestamp":1556902910000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45058-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783642073410","9783540450580"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45058-0_2","relation":{},"ISSN":["1610-7438","1610-742X"],"issn-type":[{"type":"print","value":"1610-7438"},{"type":"electronic","value":"1610-742X"}],"subject":[],"published":{"date-parts":[[2004]]}}}