{"id":"https://openalex.org/W2996899864","doi":"https://doi.org/10.1109/tie.2019.2962425","title":"Optimal Path Planning Using Generalized Voronoi Graph and Multiple Potential Functions","display_name":"Optimal Path Planning Using Generalized Voronoi Graph and Multiple Potential Functions","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W2996899864","doi":"https://doi.org/10.1109/tie.2019.2962425","mag":"2996899864"},"language":"en","primary_location":{"id":"doi:10.1109/tie.2019.2962425","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tie.2019.2962425","pdf_url":null,"source":{"id":"https://openalex.org/S58031724","display_name":"IEEE Transactions on Industrial Electronics","issn_l":"0278-0046","issn":["0278-0046","1557-9948"],"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 Transactions on Industrial Electronics","raw_type":"journal-article"},"type":"article","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/A5043461784","display_name":"Jiankun Wang","orcid":"https://orcid.org/0000-0001-9139-0291"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Jiankun Wang","raw_affiliation_strings":["Department of Electronic Engineering, The Chinese University of Hong Kong, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, The Chinese University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021531143","display_name":"Max Q.\u2010H. Meng","orcid":"https://orcid.org/0000-0002-5255-5898"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Max Q.-H. Meng","raw_affiliation_strings":["Department of Electronic Engineering, The Chinese University of Hong Kong, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, The Chinese University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5043461784"],"corresponding_institution_ids":["https://openalex.org/I177725633"],"apc_list":null,"apc_paid":null,"fwci":5.8871,"has_fulltext":false,"cited_by_count":92,"citation_normalized_percentile":{"value":0.97104436,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"67","issue":"12","first_page":"10621","last_page":"10630"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T11694","display_name":"Fluid Dynamics Simulations and Interactions","score":0.9190000295639038,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9115999937057495,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/motion-planning","display_name":"Motion planning","score":0.7781314849853516},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6719075441360474},{"id":"https://openalex.org/keywords/random-tree","display_name":"Random tree","score":0.636789083480835},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.6065043807029724},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5854344964027405},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.5609073638916016},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.5439857840538025},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.5159926414489746},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4902201294898987},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4842066764831543},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4744452238082886},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4612831473350525},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45399507880210876},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44742822647094727},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.4242505431175232},{"id":"https://openalex.org/keywords/probabilistic-roadmap","display_name":"Probabilistic roadmap","score":0.421855092048645},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41735103726387024},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.41282951831817627},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.41068035364151},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.21056681871414185},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1578862965106964},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.1356636881828308},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1110515296459198}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7781314849853516},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6719075441360474},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.636789083480835},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.6065043807029724},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5854344964027405},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.5609073638916016},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.5439857840538025},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.5159926414489746},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4902201294898987},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4842066764831543},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4744452238082886},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4612831473350525},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45399507880210876},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44742822647094727},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.4242505431175232},{"id":"https://openalex.org/C2778803389","wikidata":"https://www.wikidata.org/wiki/Q7246866","display_name":"Probabilistic roadmap","level":4,"score":0.421855092048645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41735103726387024},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.41282951831817627},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.41068035364151},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.21056681871414185},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1578862965106964},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.1356636881828308},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1110515296459198},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0},{"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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tie.2019.2962425","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tie.2019.2962425","pdf_url":null,"source":{"id":"https://openalex.org/S58031724","display_name":"IEEE Transactions on Industrial Electronics","issn_l":"0278-0046","issn":["0278-0046","1557-9948"],"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 Transactions on Industrial Electronics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6600000262260437,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W181534116","https://openalex.org/W1964180977","https://openalex.org/W1969483458","https://openalex.org/W1971086298","https://openalex.org/W1976930960","https://openalex.org/W1977240978","https://openalex.org/W2000359213","https://openalex.org/W2020837531","https://openalex.org/W2021128738","https://openalex.org/W2026988104","https://openalex.org/W2048825531","https://openalex.org/W2055473513","https://openalex.org/W2099144379","https://openalex.org/W2101043416","https://openalex.org/W2103120971","https://openalex.org/W2106473816","https://openalex.org/W2128990851","https://openalex.org/W2143826757","https://openalex.org/W2157543942","https://openalex.org/W2232710831","https://openalex.org/W2265661972","https://openalex.org/W2294424735","https://openalex.org/W2594530875","https://openalex.org/W2894417726","https://openalex.org/W2902731060","https://openalex.org/W2916002270","https://openalex.org/W2952009315","https://openalex.org/W2962758608","https://openalex.org/W2963439114","https://openalex.org/W2964077562","https://openalex.org/W3021208093","https://openalex.org/W3102121895","https://openalex.org/W4243385754","https://openalex.org/W6655926624","https://openalex.org/W6676022314"],"related_works":["https://openalex.org/W2776102956","https://openalex.org/W2168550231","https://openalex.org/W4312674194","https://openalex.org/W2277626332","https://openalex.org/W2996899864","https://openalex.org/W3184816460","https://openalex.org/W4366823992","https://openalex.org/W4282823369","https://openalex.org/W2034801091","https://openalex.org/W2894757447"],"abstract_inverted_index":{"In":[0],"this":[1],"article,":[2],"we":[3],"present":[4],"a":[5,71,93,102,152],"novel":[6],"nonuniform":[7,36,94],"sampling":[8,37,95],"technique,":[9],"based":[10],"on":[11,40],"the":[12,32,41,44,51,60,66,77,84,90,98,116,119,126,130,146,163,171],"pipeline":[13],"of":[14,118,133,148,154],"rapidly":[15],"exploring":[16],"random":[17],"tree":[18],"(RRT),":[19],"for":[20,97],"efficiently":[21],"computing":[22],"high-quality":[23],"collision-free":[24],"paths":[25],"while":[26],"maintaining":[27],"fast":[28],"asymptotic":[29,131],"convergence":[30],"to":[31,82,108,114,144],"optimal":[33,45],"solution.":[34],"Our":[35],"method":[38,105],"focuses":[39],"area":[42],"where":[43,89],"path":[46,52,73,79,99,140,173],"may":[47],"exist":[48],"so":[49],"that":[50,162],"planning":[53,174],"process":[54],"can":[55],"be":[56],"further":[57],"accelerated.":[58],"First,":[59],"environment":[61],"map":[62],"is":[63,74,80,106,160],"initialized":[64],"with":[65,170],"generalized":[67],"Voronoi":[68],"graph":[69],"and":[70,112,129,139,156],"heuristic":[72,78],"calculated.":[75],"Second,":[76],"discretized":[81],"construct":[83],"multiple":[85],"potential":[86],"functions":[87],"(MPF),":[88],"MPF":[91],"provides":[92],"distribution":[96],"planner.":[100],"As":[101],"meta-algorithm,":[103],"our":[104,134,149],"applicable":[107],"other":[109],"RRT":[110],"methods":[111],"helps":[113],"improve":[115],"performance":[117,168],"underlying":[120],"algorithm":[121,165],"dramatically.":[122],"We":[123],"also":[124],"prove":[125],"probabilistic":[127],"completeness":[128],"optimality":[132],"algorithm.":[135,150],"The":[136],"time":[137],"cost":[138],"length":[141],"are":[142],"selected":[143],"demonstrate":[145],"effectiveness":[147],"Through":[151],"series":[153],"simulation":[155],"real-world":[157],"experiments,":[158],"it":[159],"confirmed":[161],"proposed":[164],"achieves":[166],"convincing":[167],"compared":[169],"state-of-the-art":[172],"algorithms.":[175]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":18},{"year":2023,"cited_by_count":17},{"year":2022,"cited_by_count":16},{"year":2021,"cited_by_count":19},{"year":2020,"cited_by_count":8}],"updated_date":"2026-03-27T14:29:43.386196","created_date":"2025-10-10T00:00:00"}