{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:50:32Z","timestamp":1787503832098,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540528463","type":"print"},{"value":"9783540471646","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52846-6_92","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:43:13Z","timestamp":1330188193000},"page":"225-237","source":"Crossref","is-referenced-by-count":2,"title":["Input-sensitive compliant motion in the plane"],"prefix":"10.1007","author":[{"given":"Joseph","family":"Friedman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John","family":"Hershberger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jack","family":"Snoeyink","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"A. J. Briggs. An efficient algorithm for one-step planar compliant motion planning with uncertainty. In Proceedings of the 5th ACM Symposium on Computational Geometry, pages 187\u2013196, 1989.","DOI":"10.1145\/73833.73855"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"J. F. Canny and J. Reif. New lower bound techniques for robot motion planning problems. In Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, pages 49\u201360, 1987.","DOI":"10.1109\/SFCS.1987.42"},{"key":"20_CR3","unstructured":"B. R. Donald. Error detection and recovery for robot motion planning with uncertainty. Technical Report MIT-AI-TR 982, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, 1987."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"B. R. Donald. The complexity of planar compliant motion planning under uncertainty. In Proceedings of the 4th ACM Symposium on Computational Geometry, pages 309\u2013318, 1988.","DOI":"10.1145\/73393.73425"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/0215023","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"H. Edelsbrunner, L. J. Guibas, and J. Stolfi. Optimal point location in a monotone subdivision. SIAM Journal on Computing, 15:317\u2013340, 1986.","journal-title":"SIAM Journal on Computing"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"M. A. Erdmann. Using backprojections for fine motion planning with uncertainty. International Journal of Robotics Research, 5(1), 1986.","DOI":"10.1177\/027836498600500102"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"M. A. Erdmann and M. Mason. An exploration of sensorless manipulation. In IEEE International Conference on Robotics, pages 1569\u20131574, 1986.","DOI":"10.1109\/ROBOT.1986.1087522"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"J. Friedman, J. Hershberger, and J. Snoeyink. Compliant motion in a simple polygon. In Proceedings of the 5th ACM Symposium on Computational Geometry, pages 175\u2013186, 1989.","DOI":"10.1145\/73833.73854"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D. Kirkpatrick","year":"1983","unstructured":"D. Kirkpatrick. Optimal search in planar subdivisions. SIAM Journal on Computing, 12:28\u201335, 1983.","journal-title":"SIAM Journal on Computing"},{"key":"20_CR10","series-title":"Technical Report","volume-title":"Motion planning with uncertainty: The preimage backchaining approach","author":"J.-C. Latombe","year":"1988","unstructured":"J.-C. Latombe. Motion planning with uncertainty: The preimage backchaining approach. Technical Report STAN-CS-88-1196, Department of Compuuter Science, Stanford University, Stanford, California 94305, March 1988."},{"key":"20_CR11","volume-title":"On Moving and Orienting Objects","author":"B. K. Natarajan","year":"1986","unstructured":"B. K. Natarajan. On Moving and Orienting Objects. PhD thesis, Cornell University Department of Computer Science, Ithaca, N.Y., 1986."},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"C. \u00d3'D\u00fanlaing, M. Sharir, and C. K. Yap. Retraction: A new approach to motion-planning. In Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pages 207\u2013220. ACM, 1983.","DOI":"10.1145\/800061.808750"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"M. Sharir and A. Schorr. On shortest paths in polyhedral spaces. In Proceedings of the 16th Annual ACM Symposium on Theory of Computing, pages 144\u2013153, 1984.","DOI":"10.1145\/800057.808676"}],"container-title":["Lecture Notes in Computer Science","SWAT 90"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52846-6_92.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:25:23Z","timestamp":1605630323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52846-6_92"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540528463","9783540471646"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-52846-6_92","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990]]}}}