{"id":"https://openalex.org/W2894757447","doi":"https://doi.org/10.2478/amcs-2018-0038","title":"An Exact Geometry\u2013Based Algorithm for Path Planning","display_name":"An Exact Geometry\u2013Based Algorithm for Path Planning","publication_year":2018,"publication_date":"2018-09-01","ids":{"openalex":"https://openalex.org/W2894757447","doi":"https://doi.org/10.2478/amcs-2018-0038","mag":"2894757447"},"language":"en","primary_location":{"id":"doi:10.2478/amcs-2018-0038","is_oa":true,"landing_page_url":"https://doi.org/10.2478/amcs-2018-0038","pdf_url":"https://content.sciendo.com/downloadpdf/journals/amcs/28/3/article-p493.pdf","source":{"id":"https://openalex.org/S117679522","display_name":"International Journal of Applied Mathematics and Computer Science","issn_l":"1641-876X","issn":["1641-876X","2083-8492"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320322","host_organization_name":"De Gruyter Open","host_organization_lineage":["https://openalex.org/P4310320322","https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter Open","De Gruyter"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Mathematics and Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://content.sciendo.com/downloadpdf/journals/amcs/28/3/article-p493.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083333299","display_name":"Hassan Jafarzadeh","orcid":"https://orcid.org/0000-0001-6946-9606"},"institutions":[{"id":"https://openalex.org/I51556381","display_name":"University of Virginia","ror":"https://ror.org/0153tk833","country_code":"US","type":"education","lineage":["https://openalex.org/I51556381"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hassan Jafarzadeh","raw_affiliation_strings":["Department of Systems and Information Engineering University of Virginia, Charlottesville , VA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Systems and Information Engineering University of Virginia, Charlottesville , VA, USA","institution_ids":["https://openalex.org/I51556381"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113457201","display_name":"Cody Fleming","orcid":null},"institutions":[{"id":"https://openalex.org/I51556381","display_name":"University of Virginia","ror":"https://ror.org/0153tk833","country_code":"US","type":"education","lineage":["https://openalex.org/I51556381"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cody H. Fleming","raw_affiliation_strings":["Department of Systems and Information Engineering University of Virginia, Charlottesville , VA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Systems and Information Engineering University of Virginia, Charlottesville , VA, USA","institution_ids":["https://openalex.org/I51556381"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083333299"],"corresponding_institution_ids":["https://openalex.org/I51556381"],"apc_list":{"value":4080,"currency":"PLN","value_usd":1100},"apc_paid":{"value":4080,"currency":"PLN","value_usd":1100},"fwci":0.848,"has_fulltext":true,"cited_by_count":16,"citation_normalized_percentile":{"value":0.7940993,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"28","issue":"3","first_page":"493","last_page":"504"},"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/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":1.0,"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.9854000210762024,"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.9785000085830688,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.7042916417121887},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6652219295501709},{"id":"https://openalex.org/keywords/visibility-graph","display_name":"Visibility graph","score":0.6349565386772156},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6195951104164124},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.6180974245071411},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5999191999435425},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5504506826400757},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.537461519241333},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5288321375846863},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.514255940914154},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5121135711669922},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.511017918586731},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.5098944902420044},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5014755725860596},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.49904632568359375},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.4538007378578186},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.4356461763381958},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.4310712218284607},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39043182134628296},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.37706857919692993},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.32998692989349365},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.26945722103118896},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16642165184020996},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.15540775656700134},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15298715233802795},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.11208665370941162}],"concepts":[{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.7042916417121887},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6652219295501709},{"id":"https://openalex.org/C173362246","wikidata":"https://www.wikidata.org/wiki/Q8216024","display_name":"Visibility graph","level":3,"score":0.6349565386772156},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6195951104164124},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.6180974245071411},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5999191999435425},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5504506826400757},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.537461519241333},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5288321375846863},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.514255940914154},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5121135711669922},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.511017918586731},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.5098944902420044},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5014755725860596},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.49904632568359375},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.4538007378578186},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.4356461763381958},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.4310712218284607},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39043182134628296},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.37706857919692993},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32998692989349365},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.26945722103118896},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16642165184020996},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.15540775656700134},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15298715233802795},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.11208665370941162},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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":2,"locations":[{"id":"doi:10.2478/amcs-2018-0038","is_oa":true,"landing_page_url":"https://doi.org/10.2478/amcs-2018-0038","pdf_url":"https://content.sciendo.com/downloadpdf/journals/amcs/28/3/article-p493.pdf","source":{"id":"https://openalex.org/S117679522","display_name":"International Journal of Applied Mathematics and Computer Science","issn_l":"1641-876X","issn":["1641-876X","2083-8492"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320322","host_organization_name":"De Gruyter Open","host_organization_lineage":["https://openalex.org/P4310320322","https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter Open","De Gruyter"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Mathematics and Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:b27bbbef39c34a2298a6d41846ff4d93","is_oa":true,"landing_page_url":"https://doaj.org/article/b27bbbef39c34a2298a6d41846ff4d93","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Applied Mathematics and Computer Science, Vol 28, Iss 3, Pp 493-504 (2018)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2478/amcs-2018-0038","is_oa":true,"landing_page_url":"https://doi.org/10.2478/amcs-2018-0038","pdf_url":"https://content.sciendo.com/downloadpdf/journals/amcs/28/3/article-p493.pdf","source":{"id":"https://openalex.org/S117679522","display_name":"International Journal of Applied Mathematics and Computer Science","issn_l":"1641-876X","issn":["1641-876X","2083-8492"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320322","host_organization_name":"De Gruyter Open","host_organization_lineage":["https://openalex.org/P4310320322","https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter Open","De Gruyter"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Mathematics and Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.7200000286102295}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2894757447.pdf","grobid_xml":"https://content.openalex.org/works/W2894757447.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W101508493","https://openalex.org/W131069610","https://openalex.org/W1482503584","https://openalex.org/W1521785144","https://openalex.org/W1553373771","https://openalex.org/W1585939719","https://openalex.org/W1595498733","https://openalex.org/W1638373997","https://openalex.org/W1981167736","https://openalex.org/W1986014106","https://openalex.org/W2014320134","https://openalex.org/W2016584965","https://openalex.org/W2029107091","https://openalex.org/W2086860466","https://openalex.org/W2095202810","https://openalex.org/W2096636360","https://openalex.org/W2112863752","https://openalex.org/W2120600560","https://openalex.org/W2132026455","https://openalex.org/W2143826757","https://openalex.org/W2158334497","https://openalex.org/W2159722616","https://openalex.org/W2161339130","https://openalex.org/W2163178194","https://openalex.org/W2165171393","https://openalex.org/W2417637069","https://openalex.org/W2467632359","https://openalex.org/W2486402301","https://openalex.org/W2515498963","https://openalex.org/W2586026999","https://openalex.org/W2780890569","https://openalex.org/W3145128584","https://openalex.org/W4236470048","https://openalex.org/W4251391716","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2133099431","https://openalex.org/W2018146256","https://openalex.org/W1970083491","https://openalex.org/W2163318972","https://openalex.org/W2186738974","https://openalex.org/W1568976900","https://openalex.org/W2237480599","https://openalex.org/W4309149619","https://openalex.org/W4206588173","https://openalex.org/W2894757447"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"novel,":[2],"exact":[3],"algorithm":[4,95,112,154,199,224,235,270],"is":[5,40,69,113,149,167,178,200,262,271],"presented":[6,269],"to":[7,23,87,203,218,226],"solve":[8],"the":[9,16,42,54,57,60,63,72,76,82,129,135,145,152,157,168,179,188,198,220,223,227,268],"path":[10,19,45,84,102,159,189,238],"planning":[11],"problem":[12],"that":[13,103,117,137,151,183],"involves":[14],"finding":[15],"shortest":[17,43,83],"collision-free":[18],"from":[20,85,108],"a":[21,24,28,49,97,105,240],"start":[22,64,86],"goal":[25,66,88],"point":[26,89],"in":[27,143,160,186],"two-dimensional":[29],"environment":[30],"containing":[31],"convex":[32,122],"and":[33,59,65,100,123,175,211,251],"non-convex":[34],"obstacles.":[35,126],"The":[36,93,195],"proposed":[37],"algorithm,":[38,47,243],"which":[39,68],"called":[41],"possible":[44],"(SPP)":[46],"constructs":[48],"network":[50,73,190],"of":[51,56,62,131,134,170,172,181,197,207,222,231],"lines":[52],"connecting":[53],"vertices":[55,171,182],"obstacles":[58],"locations":[61],"points":[67],"smaller":[70],"than":[71],"generated":[74],"by":[75],"visibility":[77],"graph.":[78],"Then":[79],"it":[80],"finds":[81],"within":[90],"this":[91],"network.":[92],"SPP":[94,153],"generates":[96],"safe,":[98],"smooth":[99],"obstacle-free":[101],"has":[104,128],"desired":[106],"distance":[107],"each":[109],"obstacle.":[110],"This":[111],"designed":[114],"for":[115,236,264],"environments":[116],"are":[118,184,216],"populated":[119],"sparsely":[120],"with":[121],"nonconvex":[124],"polygonal":[125],"It":[127,148],"capability":[130],"eliminating":[132],"some":[133],"polygons":[136,174],"do":[138],"not":[139],"play":[140],"any":[141],"role":[142],"constructing":[144,187],"optimal":[146,158],"path.":[147],"proven":[150],"can":[155],"find":[156],"O(nn":[161],"r2":[162],")":[163],"time,":[164],"where":[165],"n":[166,176],"number":[169,180],"all":[173],"\u0313":[177,192],"considered":[185],"(n":[191],"\u2264":[193],"n).":[194],"performance":[196,221],"evaluated":[201],"relative":[202,225],"three":[204],"major":[205],"classes":[206,230],"algorithms:":[208,232],"heuristic,":[209],"probabilistic,":[210],"classic.":[212],"Different":[213],"benchmark":[214],"scenarios":[215],"used":[217],"evaluate":[219],"first":[228],"two":[229,256],"GAMOPP":[233],"(genetic":[234],"multi-objective":[237],"planning),":[239],"representative":[241],"heuristic":[242],"as":[244,246],"well":[245],"RRT":[247],"(rapidly-exploring":[248],"random":[249],"tree)":[250],"PRM":[252],"(probabilistic":[253],"road":[254],"map),":[255],"well-known":[257],"probabilistic":[258],"algorithms.":[259],"Time":[260],"complexity":[261],"known":[263],"classic":[265],"algorithms,":[266],"so":[267],"compared":[272],"analytically.":[273]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":5}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2018-10-12T00:00:00"}