{"id":"https://openalex.org/W2765226061","doi":"https://doi.org/10.1109/lra.2019.2899668","title":"Minimizing Task-Space Fr\u00e9chet Error via Efficient Incremental Graph Search","display_name":"Minimizing Task-Space Fr\u00e9chet Error via Efficient Incremental Graph Search","publication_year":2019,"publication_date":"2019-02-15","ids":{"openalex":"https://openalex.org/W2765226061","doi":"https://doi.org/10.1109/lra.2019.2899668","mag":"2765226061"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2019.2899668","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2019.2899668","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766","2377-3774"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1710.06738","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Rachel Holladay","orcid":"https://orcid.org/0000-0002-1947-4180"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rachel Holladay","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0002-1947-4180","affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Oren Salzman","orcid":"https://orcid.org/0000-0003-4541-8219"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Oren Salzman","raw_affiliation_strings":["Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":"https://orcid.org/0000-0003-4541-8219","affiliations":[{"raw_affiliation_string":"Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":null,"display_name":"Siddhartha Srinivasa","orcid":null},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Siddhartha Srinivasa","raw_affiliation_strings":["Paul G. Allen School of Computer Science & Engineering, University of Washington, Seattle, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Paul G. Allen School of Computer Science & Engineering, University of Washington, Seattle, WA, USA","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4708,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.82629883,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"4","issue":"2","first_page":"1999","last_page":"2006"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.4438000023365021,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.4438000023365021,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.2101999968290329,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.05719999969005585,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sketch","display_name":"Sketch","score":0.5633000135421753},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"Bidirectional search","score":0.5396999716758728},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.529699981212616},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5210000276565552},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45260000228881836},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.44130000472068787},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.42969998717308044},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.42730000615119934},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3790999948978424}],"concepts":[{"id":"https://openalex.org/C2779231336","wikidata":"https://www.wikidata.org/wiki/Q7534724","display_name":"Sketch","level":2,"score":0.5633000135421753},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.5396999716758728},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5358999967575073},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.529699981212616},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5210000276565552},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48579999804496765},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45260000228881836},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4431999921798706},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.44130000472068787},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.42969998717308044},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.42730000615119934},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3815000057220459},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3790999948978424},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.35199999809265137},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.3476000130176544},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3386000096797943},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.31540000438690186},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.30869999527931213},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.29820001125335693},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.2874000072479248},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.2822999954223633},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2736999988555908},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.27129998803138733},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.25540000200271606},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.25429999828338623},{"id":"https://openalex.org/C203208320","wikidata":"https://www.wikidata.org/wiki/Q5150830","display_name":"Combinatorial search","level":4,"score":0.2540999948978424},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.25279998779296875},{"id":"https://openalex.org/C148220186","wikidata":"https://www.wikidata.org/wiki/Q7111912","display_name":"Outcome (game theory)","level":2,"score":0.2513999938964844},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lra.2019.2899668","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2019.2899668","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766","2377-3774"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1710.06738","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1710.06738","pdf_url":"https://arxiv.org/pdf/1710.06738","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1710.06738","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1710.06738","pdf_url":"https://arxiv.org/pdf/1710.06738","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1554588678","https://openalex.org/W1971086298","https://openalex.org/W1982442957","https://openalex.org/W1982809790","https://openalex.org/W2010536454","https://openalex.org/W2042803738","https://openalex.org/W2042913147","https://openalex.org/W2049354208","https://openalex.org/W2057134777","https://openalex.org/W2084404970","https://openalex.org/W2087989168","https://openalex.org/W2097677484","https://openalex.org/W2103430937","https://openalex.org/W2110333200","https://openalex.org/W2110762409","https://openalex.org/W2128990851","https://openalex.org/W2134447392","https://openalex.org/W2136354320","https://openalex.org/W2146467128","https://openalex.org/W2159722616","https://openalex.org/W2159857204","https://openalex.org/W2169528473","https://openalex.org/W2293499200","https://openalex.org/W2603413286","https://openalex.org/W2735705371","https://openalex.org/W2764278393","https://openalex.org/W2792806200","https://openalex.org/W2805114031","https://openalex.org/W4247782262","https://openalex.org/W6677807407","https://openalex.org/W6678609610","https://openalex.org/W6683073854","https://openalex.org/W6730687371","https://openalex.org/W6765909403"],"related_works":[],"abstract_inverted_index":{"We":[0,41,58],"present":[1],"an":[2],"anytime":[3],"algorithm":[4,48,69],"that":[5,11,67],"generates":[6],"a":[7,14,38,43,71,77,85],"collision-free":[8],"configuration-space":[9],"path":[10,16],"closely":[12],"follows":[13],"desired":[15],"in":[17],"task":[18],"space,":[19],"according":[20],"to":[21,49],"the":[22,34,56,89],"discrete":[23],"Fr\u00e9chet":[24],"distance.":[25],"By":[26],"leveraging":[27],"tools":[28],"from":[29],"computational":[30],"geometry,":[31],"we":[32,83],"approximate":[33],"search":[35,51],"space":[36],"using":[37],"cross-product":[39],"graph.":[40],"use":[42],"variant":[44],"of":[45,73,79,88,92],"Dijkstra's":[46],"graph-search":[47],"efficiently":[50],"for":[52],"and":[53,64],"iteratively":[54],"improve":[55],"solution.":[57],"compare":[59],"multiple":[60],"proposed":[61],"densification":[62],"strategies":[63],"empirically":[65],"show":[66],"our":[68,93],"outperforms":[70],"set":[72],"state-of-the-art":[74],"planners":[75],"on":[76],"range":[78],"manipulation":[80],"problems.":[81],"Finally,":[82],"offer":[84],"proof":[86],"sketch":[87],"asymptotic":[90],"optimality":[91],"algorithm.":[94]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2017-11-10T00:00:00"}