{"id":"https://openalex.org/W2116772004","doi":"https://doi.org/10.1109/mra.2008.921540","title":"Roadmap-Based Path Planning - Using the Voronoi Diagram for a Clearance-Based Shortest Path","display_name":"Roadmap-Based Path Planning - Using the Voronoi Diagram for a Clearance-Based Shortest Path","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2116772004","doi":"https://doi.org/10.1109/mra.2008.921540","mag":"2116772004"},"language":"en","primary_location":{"id":"doi:10.1109/mra.2008.921540","doi":"https://doi.org/10.1109/mra.2008.921540","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mra.2008.921540","pdf_url":null,"source":{"id":"https://openalex.org/S132261465","display_name":"IEEE Robotics & Automation Magazine","issn_l":"1070-9932","issn":["1070-9932","1558-223X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-b","jufo-2","norway-1","poland-140","russia-white-list-1","vabb-shw"],"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 &amp; Automation Magazine","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W2116772004"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020121612","display_name":"Priyadarshi Bhattacharya","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Priyadarshi Bhattacharya","raw_affiliation_strings":["Intermap Technologies Corporation, Calgary, AB, Canada","Intermap Technol. Corp., Calgary, AB"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Intermap Technologies Corporation, Calgary, AB, Canada","institution_ids":[]},{"raw_affiliation_string":"Intermap Technol. Corp., Calgary, AB","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072661451","display_name":"Marina L. Gavrilova","orcid":"https://orcid.org/0000-0002-5338-1834","observed_orcids":["https://orcid.org/0000-0002-5338-1834"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marina Gavrilova","raw_affiliation_strings":["Intermap Technologies Corporation, Calgary, AB, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Intermap Technologies Corporation, Calgary, AB, Canada","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2045,"currency":"USD","value_usd":2045},"apc_paid":null,"fwci":10.4621,"has_fulltext":false,"cited_by_count":321,"citation_normalized_percentile":{"value":0.97976788,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"15","issue":"2","first_page":"58","last_page":"66"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.0,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/path-planning","display_name":"path planning","score":0.9430000185966492},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi tessellation","score":0.996999979019165},{"id":"https://openalex.org/keywords/collision-avoidance","display_name":"collision avoidance","score":0.7289999723434448},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"obstacle avoidance","score":0.7839999794960022},{"id":"https://openalex.org/keywords/shortest-path-approximation","display_name":"shortest path approximation","score":0.675000011920929},{"id":"https://openalex.org/keywords/robot-navigation","display_name":"robot navigation","score":0.4729999899864197}],"concepts":[{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.9092925786972046},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8572627305984497},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6991938352584839},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.6848959922790527},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6472503542900085},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6239733695983887},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5484311580657959},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.49386245012283325},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4663357734680176},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4234112501144409},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2940807342529297},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19890031218528748},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.1939840316772461},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1896381676197052},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14045709371566772},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mra.2008.921540","doi":"https://doi.org/10.1109/mra.2008.921540","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mra.2008.921540","pdf_url":null,"source":{"id":"https://openalex.org/S132261465","display_name":"IEEE Robotics & Automation Magazine","issn_l":"1070-9932","issn":["1070-9932","1558-223X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-b","jufo-2","norway-1","poland-140","russia-white-list-1","vabb-shw"],"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 &amp; Automation Magazine","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W101508493","https://openalex.org/W253348889","https://openalex.org/W1482503584","https://openalex.org/W1485397325","https://openalex.org/W1510265196","https://openalex.org/W1512323273","https://openalex.org/W1617800291","https://openalex.org/W1746221535","https://openalex.org/W1877090875","https://openalex.org/W1967005434","https://openalex.org/W1975256568","https://openalex.org/W1985491809","https://openalex.org/W1991482882","https://openalex.org/W1993117421","https://openalex.org/W1997271799","https://openalex.org/W2007403280","https://openalex.org/W2027491349","https://openalex.org/W2041655521","https://openalex.org/W2057512681","https://openalex.org/W2069830673","https://openalex.org/W2080313347","https://openalex.org/W2083907923","https://openalex.org/W2090170700","https://openalex.org/W2108161773","https://openalex.org/W2115257338","https://openalex.org/W2116966230","https://openalex.org/W2118175378","https://openalex.org/W2126525546","https://openalex.org/W2134240078","https://openalex.org/W2134348961","https://openalex.org/W2141664020","https://openalex.org/W2142486506","https://openalex.org/W2145916140","https://openalex.org/W2146646817","https://openalex.org/W2151402824","https://openalex.org/W2154970479","https://openalex.org/W2161356125","https://openalex.org/W2162062774","https://openalex.org/W2171266831","https://openalex.org/W2218021848","https://openalex.org/W2611243847","https://openalex.org/W2748140058","https://openalex.org/W4229558925","https://openalex.org/W6609499178"],"related_works":["https://openalex.org/W1496056286","https://openalex.org/W2156133165","https://openalex.org/W2246654055","https://openalex.org/W2409767818","https://openalex.org/W2121978131","https://openalex.org/W171248756","https://openalex.org/W2143102370","https://openalex.org/W3044217012","https://openalex.org/W2145482393","https://openalex.org/W4390096628"],"abstract_inverted_index":{"Path":[0],"planning":[1],"still":[2],"remains":[3],"one":[4],"of":[5,17,73,88],"the":[6,15,56,61,74,78,84,89],"core":[7],"problems":[8],"in":[9,46,97],"modern":[10],"robotic":[11],"applications,":[12],"such":[13],"as":[14],"design":[16],"autonomous":[18],"vehicles":[19],"and":[20,59,101],"perceptive":[21],"systems.":[22],"The":[23,86],"basic":[24],"path-planning":[25,94],"problem":[26],"is":[27,69,96],"concerned":[28],"with":[29,48],"finding":[30],"a":[31,35,39,66,70],"good-quality":[32],"path":[33,67,76],"from":[34],"source":[36],"point":[37,41],"to":[38,64],"destination":[40],"that":[42,68],"does":[43],"not":[44],"result":[45],"collision":[47],"any":[49],"obstacles.":[50],"In":[51],"this":[52],"article,":[53],"we":[54],"chose":[55],"roadmap":[57],"approach":[58],"utilized":[60],"Voronoi":[62],"diagram":[63],"obtain":[65],"close":[71],"approximation":[72],"shortest":[75],"satisfying":[77],"required":[79],"clearance":[80],"value":[81],"set":[82],"by":[83],"user.":[85],"advantage":[87],"proposed":[90],"technique":[91],"versus":[92],"alternative":[93],"methods":[95],"its":[98],"simplicity,":[99],"versatility,":[100],"efficiency.":[102]},"counts_by_year":[{"year":2026,"cited_by_count":7},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":15},{"year":2023,"cited_by_count":29},{"year":2022,"cited_by_count":25},{"year":2021,"cited_by_count":30},{"year":2020,"cited_by_count":29},{"year":2019,"cited_by_count":22},{"year":2018,"cited_by_count":21},{"year":2017,"cited_by_count":22},{"year":2016,"cited_by_count":22},{"year":2015,"cited_by_count":16},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":21},{"year":2012,"cited_by_count":22}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}
