{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:10:07Z","timestamp":1760044207815,"version":"3.37.3"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/lra.2019.2899668","type":"journal-article","created":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T19:43:13Z","timestamp":1550259793000},"page":"1999-2006","source":"Crossref","is-referenced-by-count":20,"title":["Minimizing Task-Space Fr\u00e9chet Error via Efficient Incremental Graph Search"],"prefix":"10.1109","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1947-4180","authenticated-orcid":false,"given":"Rachel","family":"Holladay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4541-8219","authenticated-orcid":false,"given":"Oren","family":"Salzman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siddhartha","family":"Srinivasa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"article-title":"Minimizing task space Frechet error via efficient incremental graph search","year":"2018","author":"holladay","key":"ref38"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1994.350966"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1609\/icaps.v28i1.13879","article-title":"The provable virtue of laziness in motion planning","author":"haghtalab","year":"2018","journal-title":"Proc Int Conf Automated Planning Scheduling"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1609\/icaps.v26i1.13788","article-title":"A unifying formalism for shortest path problems with expensive edge evaluations via lazy best-first search over paths with edge selectors","author":"dellin","year":"2016","journal-title":"Proc Int Conf Automated Planning Scheduling"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2003.12.001"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00079-8"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1048"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844107"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF00126069"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50115-4_23"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/70.88067"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2017.2715348"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2018.XIV.043"},{"key":"ref14","first-page":"1657","article-title":"Pro babilistic motion planning for redundant robots along given end-effector paths","volume":"2","author":"oriolo","year":"2002","journal-title":"Proc IEEE\/RSJ Int Conf Intell Robots Syst"},{"article-title":"Descartes","year":"2015","author":"madaan","key":"ref15"},{"key":"ref16","first-page":"5533","article-title":"Dis tance metrics and algorithms for task space path optimization","author":"holladay","year":"2016","journal-title":"Proc IEEE\/RSJ Int Conf Intell Robots Syst"},{"year":"2010","key":"ref17","article-title":"Hausdorff distance — Wikipedia, The Free Encyclopedia"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF03018603"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2532646"},{"key":"ref28","volume":"4586","author":"munkres","year":"1984","journal-title":"Elements of Algebraic Topology"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/70.88055"},{"journal-title":"”The discrete Fréchet distance with applications ”","year":"2013","author":"wylie","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1177\/027836498700600201"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1177\/027836499101000409"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1989.99999"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/9.277234"},{"key":"ref7","first-page":"199","article-title":"Joi nt trajectory generation for redundant robots in an environment with obstacles","volume":"10","author":"guo","year":"1993","journal-title":"J Field Robot"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1177\/027836498500400308"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/70.345948"},{"key":"ref1","first-page":"1311","article-title":"Algorithmic motion planning","author":"halperin","year":"2017","journal-title":"Handbook of Discrete and Computational Geometry"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8997-2_20"},{"key":"ref22","first-page":"76:1","article-title":"Sampling-based bottleneck pathfinding with applications to Fréchet matching","author":"solovey","year":"2016","journal-title":"Proc European Symp Algorithms"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2012.2205651"},{"journal-title":"PR2","year":"2010","key":"ref42"},{"article-title":"Computing discrete Fréchet distance","year":"1994","author":"eiter","key":"ref24"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152399"},{"key":"ref23","first-page":"429","article-title":"Computing the discrete Fréchet distance in subquadratic time","volume":"43","author":"agarwal","year":"2014","journal-title":"J Comput"},{"key":"ref26","article-title":"OpenRAVE: A planning architecture for autonomous robotics","volume":"79","author":"diankov","year":"2008"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2018.2805878"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-009-9160-9"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/8581687\/08642910.pdf?arnumber=8642910","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T17:50:44Z","timestamp":1694627444000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8642910\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":43,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/lra.2019.2899668","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"type":"electronic","value":"2377-3766"},{"type":"electronic","value":"2377-3774"}],"subject":[],"published":{"date-parts":[[2019,4]]}}}