{"id":"https://openalex.org/W2888446832","doi":"https://doi.org/10.1145/3230650","title":"An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles","display_name":"An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles","publication_year":2018,"publication_date":"2018-08-21","ids":{"openalex":"https://openalex.org/W2888446832","doi":"https://doi.org/10.1145/3230650","mag":"2888446832"},"language":"en","primary_location":{"id":"doi:10.1145/3230650","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3230650","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3230650","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3230650","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058649592","display_name":"Pankaj K. Agarwal","orcid":"https://orcid.org/0000-0002-9439-181X"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pankaj K. Agarwal","raw_affiliation_strings":["Duke University, Durham, NC, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Duke University, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013518909","display_name":"Kyle Fox","orcid":"https://orcid.org/0000-0002-2446-8594"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kyle Fox","raw_affiliation_strings":["The University of Texas at Dallas, Richardson, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Texas at Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078885681","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":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7283,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.7659253,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"14","issue":"4","first_page":"1","last_page":"21"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994999766349792,"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.9994999766349792,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9987999796867371,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.98580002784729,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/path","display_name":"Path (computing)","score":0.7625991702079773},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.7080473899841309},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5596680045127869},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.49566352367401123},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.4832206964492798},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4780462384223938},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4676598608493805},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46488142013549805},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4646816551685333},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4608027935028076},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4583629071712494},{"id":"https://openalex.org/keywords/reciprocal","display_name":"Reciprocal","score":0.4329746663570404},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.43238893151283264},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38112330436706543},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.380706787109375},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.24123144149780273},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.20218464732170105},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10182836651802063},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06391456723213196}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7625991702079773},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.7080473899841309},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5596680045127869},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.49566352367401123},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4832206964492798},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4780462384223938},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4676598608493805},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46488142013549805},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4646816551685333},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4608027935028076},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4583629071712494},{"id":"https://openalex.org/C2777742833","wikidata":"https://www.wikidata.org/wiki/Q1964083","display_name":"Reciprocal","level":2,"score":0.4329746663570404},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.43238893151283264},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38112330436706543},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.380706787109375},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.24123144149780273},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.20218464732170105},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10182836651802063},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06391456723213196},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3230650","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3230650","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3230650","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3230650","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3230650","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3230650","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.7400000095367432,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G2505475569","display_name":null,"funder_award_id":"CCF-10-12254","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3488816049","display_name":null,"funder_award_id":"CCF-15-13816","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4707214446","display_name":null,"funder_award_id":"2012/229","funder_id":"https://openalex.org/F4320320950","funder_display_name":"United States-Israel Binational Science Foundation"},{"id":"https://openalex.org/G5890629468","display_name":null,"funder_award_id":"CCF-11-61359","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6899300390","display_name":null,"funder_award_id":"CCF-09-40671,CCF-10-12254,CCF-11-61359,IIS-14-08846,CCF-15-13816,IIS-14-09003","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8952211519","display_name":null,"funder_award_id":"CCF-09-40671","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8965294572","display_name":null,"funder_award_id":"1102/11","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320950","display_name":"United States-Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320322596","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"},{"id":"https://openalex.org/F4320338298","display_name":"Office of Naval Research Global","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2888446832.pdf","grobid_xml":"https://content.openalex.org/works/W2888446832.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W162712129","https://openalex.org/W1521785144","https://openalex.org/W1557739567","https://openalex.org/W1559408176","https://openalex.org/W1844162177","https://openalex.org/W1965440866","https://openalex.org/W1982000265","https://openalex.org/W2020449301","https://openalex.org/W2022670034","https://openalex.org/W2042553152","https://openalex.org/W2052967435","https://openalex.org/W2084224084","https://openalex.org/W2085512211","https://openalex.org/W2098790909","https://openalex.org/W2107704676","https://openalex.org/W2118571526","https://openalex.org/W2130647774","https://openalex.org/W2170220350","https://openalex.org/W2218021848","https://openalex.org/W2762935521","https://openalex.org/W3068329111","https://openalex.org/W4252017042"],"related_works":["https://openalex.org/W2946941768","https://openalex.org/W2315143898","https://openalex.org/W3046207687","https://openalex.org/W2995673330","https://openalex.org/W2604760770","https://openalex.org/W2092513144","https://openalex.org/W2165808384","https://openalex.org/W3111684308","https://openalex.org/W2940127232","https://openalex.org/W1660309994"],"abstract_inverted_index":{"We":[0,69],"study":[1],"a":[2,6,21,30,38,44,54,108],"path-planning":[3],"problem":[4,51],"amid":[5],"set":[7],"O":[8,99],"of":[9,37,59,66,85,110,121],"obstacles":[10],"in":[11,15,47,97],"R":[12],"2":[13,102,104],",":[14],"which":[16],"we":[17],"wish":[18],"to":[19],"compute":[20],"short":[22],"path":[23,55,109],"between":[24],"two":[25],"points":[26],"while":[27],"also":[28],"maintaining":[29],"high":[31],"clearance":[32,36,61],"from":[33,43],"O;":[34],"the":[35,50,57,60,64,67,71,82,119,122],"point":[39],"is":[40],"its":[41],"distance":[42],"nearest":[45],"obstacle":[46,86],"O.":[48],"Specifically,":[49],"asks":[52],"for":[53,76],"minimizing":[56],"reciprocal":[58],"integrated":[62],"over":[63],"length":[65],"path.":[68,124],"present":[70],"first":[72],"polynomial-time":[73],"approximation":[74],"scheme":[75],"this":[77],"problem.":[78],"Let":[79],"n":[80,101,106],"be":[81],"total":[83,111],"number":[84],"vertices":[87],"and":[88],"let":[89],"\u03b5":[90],"\u2208":[91],"(0,":[92],"1].":[93],"Our":[94],"algorithm":[95],"computes":[96],"time":[98],"(":[100],"/\u03b5":[103],"log":[105],"/\u03b5)":[107],"cost":[112,120],"at":[113],"most":[114],"(1":[115],"+":[116],"\u03b5)":[117],"times":[118],"optimal":[123]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}