{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:27:49Z","timestamp":1760441269338,"version":"3.41.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319165943"},{"type":"electronic","value":"9783319165950"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-16595-0_21","type":"book-chapter","created":{"date-parts":[[2015,4,29]],"date-time":"2015-04-29T13:42:10Z","timestamp":1430314930000},"page":"353-370","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Resolution-Exact Algorithms for Link Robots"],"prefix":"10.1007","author":[{"given":"Zhongdi","family":"Luo","sequence":"first","affiliation":[]},{"given":"Yi-Jen","family":"Chiang","sequence":"additional","affiliation":[]},{"given":"Jyh-Ming","family":"Lien","sequence":"additional","affiliation":[]},{"given":"Chee","family":"Yap","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,30]]},"reference":[{"issue":"6","key":"21_CR1","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1177\/027836499101000604","volume":"10","author":"J Barraquand","year":"1991","unstructured":"Barraquand, J., Latombe, J.-C.: Robot motion planning: a distributed representation approach. Int. J. Robot. Res. 10(6), 628\u2013649 (1991)","journal-title":"Int. J. Robot. Res."},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry, 2nd edn. Algorithms and Computation in Mathematics. Springer, Berlin (2006)","DOI":"10.1007\/3-540-33099-2"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Boor, V., Overmars, M.H., van der Stappen., F.: The Gaussian sampling strategy for probabilistic roadmap planners. In: Proceedings of the IEEE Robotics and Automation, vol. 2, pp. 1018\u20131023. IEEE (1999)","DOI":"10.1109\/ROBOT.1999.772447"},{"key":"21_CR4","unstructured":"Brooks, R.A., Lozano-Perez, T.: A subdivision algorithm in configuration space for findpath with rotation. In: Proceedings of the 8th International Joint Conference on Artificial intelligence, vol. 2, pp. 799\u2013806. Morgan Kaufmann Publishers Inc., San Francisco (1983)"},{"key":"21_CR5","volume-title":"Principles of Robot Motion: Theory, Algorithms, and Implementations","author":"H Choset","year":"2005","unstructured":"Choset, H., Lynch, K.M., Hutchinson, S., Kantor, G., Burgard, W., Kavraki, L.E., Thrun, S.: Principles of Robot Motion: Theory, Algorithms, and Implementations. MIT Press, Boston (2005)"},{"key":"21_CR6","unstructured":"Halperin, D., Kavraki, V., Latombe, J.-C.: Robotics. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, Chapter 41, pp. 755\u2013778. CRC Press LLC (1997)"},{"issue":"7","key":"21_CR7","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1177\/0278364906067174","volume":"25","author":"D Hsu","year":"2006","unstructured":"Hsu, D., Latombe, J.-C., Kurniawati, H.: On the probabilistic foundations of probabilistic roadmap planning. Int. J. Robot. Res. 25(7), 627\u2013643 (2006)","journal-title":"Int. J. Robot. Res."},{"issue":"4","key":"21_CR8","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1109\/70.508439","volume":"12","author":"L Kavraki","year":"1996","unstructured":"Kavraki, L., \u0160vestka, P., Latombe, C., Overmars, M.: Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robot. Autom. 12(4), 566\u2013580 (1996)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"21_CR9","unstructured":"Kavraki, L.E.: Random Networks in Configuration Space for Fast Path Planning. PhD thesis, Stanford University (1995)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Kuffner, Jr. J.J., LaValle, S.M.: RRT-connect: an efficient approach to single-query path planning. In: Proceedings of the 2000 IEEE International Conference on Robotics and Automation ICRA\u201900, vol. 2, pp. 995\u20131001. IEEE (2000)","DOI":"10.1109\/ROBOT.2000.844730"},{"issue":"7\/8","key":"21_CR11","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1177\/0278364904045481","volume":"23","author":"S LaValle","year":"2004","unstructured":"LaValle, S., Branicky, M., Lindemann, S.: On the relationship between classical grid search and probabilistic roadmaps. Int J. Robot. Res. 23(7\/8), 673\u2013692 (2004)","journal-title":"Int J. Robot. Res."},{"key":"21_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877","volume-title":"Planning Algorithms","author":"SM LaValle","year":"2006","unstructured":"LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006)"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1177\/027836499000900506","volume":"9","author":"V Lumelsky","year":"1990","unstructured":"Lumelsky, V., Sun, K.: A unified methodology for motion planning with uncertainty for 2d and 3d two-link robot arm manipulators. Int. J. Robot. Res. 9, 89\u2013104 (1990)","journal-title":"Int. J. Robot. Res."},{"key":"21_CR14","unstructured":"Luo, Z.: Resolution-exact planner for a 2-link planar robot using soft predicates. Master thesis, New York University, Courant Institute, January 2014. Master Thesis Prize (2014)"},{"key":"21_CR15","unstructured":"Luo, Z., Chiang, Y.-J., Lien, J.-M., Yap, C.: Resolution exact algorithms for link robots, 2014. Full paper download with\u00a0http:\/\/www.cs.nyu.edu\/exact\/doc\/linkRobot2014.pdf or http:\/\/cse.poly.edu\/chiang\/wafr14-full.pdf"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Sharir, M., Ariel-Sheffi, E.: On the piano movers\u2019 problem: IV. Various decomposable two-dimensional motion planning problems. NYU Robotics Report 58, Courant Institute, New York University (1983)","DOI":"10.1002\/cpa.3160370406"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Sharir, M., O\u2019D\u2019\u00fanlaing, C., Yap, C.: Generalized Voronoi diagrams for moving a ladder II: efficient computation of the diagram. Algorithmica 2, 27\u201359 (1987). Also: NYU-Courant Institute, Robotics Laboratory, No. 33, October (1984)","DOI":"10.1007\/BF01840348"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"\u015eucan, l., Moll, M., Kavraki, L.: The open motion planning library. IEEE Robot. Autom. Mag. 19(4):72\u201382 (2012). http:\/\/ompl.kavrakilab.org","DOI":"10.1109\/MRA.2012.2205651"},{"key":"21_CR19","volume-title":"Probabilistic Robotics","author":"S Thrun","year":"2005","unstructured":"Thrun, S., Burgard, W., Fox, D.: Probabilistic Robotics. MIT Press, Cambridge (2005)"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Wang, C., Chiang, Y.-J., Yap, C.: On soft predicates in subdivision motion planning. In: 29th ACM Symposium on Computational Geometry (SoCG\u201913), pp. 349\u2013358 (2013). To appear CGTA, Special Issue for SoCG\u201913","DOI":"10.1145\/2462356.2462386"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Yap, C., Sharma, V., Lien, J.-M.: Towards exact numerical Voronoi diagrams. In: 9th Proceedings of the International Symposium of Voronoi Diagrams in Science and Engineering (ISVD), Invited Talk, , Rutgers University, NJ, pp. 2\u201316. IEEE 27\u201329 June 2012","DOI":"10.1109\/ISVD.2012.31"},{"key":"21_CR22","unstructured":"Yap, C.K.: Soft subdivision search in motion planning. In: Proceedings, Robotics Challenge and Vision Workshop (RCV 2013). Best Paper Award, sponsored by Computing Community Consortium (CCC). Robotics Science and Systems Conference (RSS 2013), Berlin, Germany, 27 June 2013. In arXiv:1402.3213v1 [cs.RO]. Full paper from: http:\/\/cs.nyu.edu\/exact\/papers\/"},{"key":"21_CR23","first-page":"11","volume":"27","author":"L Zhang","year":"2008","unstructured":"Zhang, L., Kim, Y.J., Manocha, D.: Efficient cell labeling and path non-existence computation using C-obstacle query. Int. J. Robot. Res. 27, 11\u201312 (2008)","journal-title":"Int. J. Robot. Res."}],"container-title":["Springer Tracts in Advanced Robotics","Algorithmic Foundations of Robotics XI"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-16595-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T17:33:55Z","timestamp":1748367235000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-16595-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319165943","9783319165950"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-16595-0_21","relation":{},"ISSN":["1610-7438","1610-742X"],"issn-type":[{"type":"print","value":"1610-7438"},{"type":"electronic","value":"1610-742X"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"30 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}