{"id":"https://openalex.org/W4402677380","doi":"https://doi.org/10.3390/a17090420","title":"An Algorithm to Find the Shortest Path through Obstacles of Arbitrary Shapes and Positions in 2D","display_name":"An Algorithm to Find the Shortest Path through Obstacles of Arbitrary Shapes and Positions in 2D","publication_year":2024,"publication_date":"2024-09-20","ids":{"openalex":"https://openalex.org/W4402677380","doi":"https://doi.org/10.3390/a17090420"},"language":"en","primary_location":{"id":"doi:10.3390/a17090420","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17090420","pdf_url":"https://www.mdpi.com/1999-4893/17/9/420/pdf?version=1726837502","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/17/9/420/pdf?version=1726837502","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057352087","display_name":"Gilles Labont\u00e9","orcid":"https://orcid.org/0000-0002-4176-1135"},"institutions":[{"id":"https://openalex.org/I51768193","display_name":"Royal Military College of Canada","ror":"https://ror.org/04yr71909","country_code":"CA","type":"education","lineage":["https://openalex.org/I51768193"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Gilles Labont\u00e9","raw_affiliation_strings":["Department of Mathematics and Computer Science, Royal Military College of Canada, Kingston, ON K7K 7B4, Canada"],"raw_orcid":"https://orcid.org/0000-0002-4176-1135","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Royal Military College of Canada, Kingston, ON K7K 7B4, Canada","institution_ids":["https://openalex.org/I51768193"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5057352087"],"corresponding_institution_ids":["https://openalex.org/I51768193"],"apc_list":{"value":1600,"currency":"CHF","value_usd":1782},"apc_paid":{"value":1600,"currency":"CHF","value_usd":1782},"fwci":0.1643,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.43545156,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"17","issue":"9","first_page":"420","last_page":"420"},"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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.9966999888420105,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.6062967777252197},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5938177108764648},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5403661131858826},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4520728886127472},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.432032972574234},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4222724437713623},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4168912172317505},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.407032310962677},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3566455543041229},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3322230577468872},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.26875004172325134},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13199150562286377}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6062967777252197},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5938177108764648},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5403661131858826},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4520728886127472},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.432032972574234},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4222724437713623},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4168912172317505},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.407032310962677},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3566455543041229},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3322230577468872},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.26875004172325134},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13199150562286377},{"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.3390/a17090420","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17090420","pdf_url":"https://www.mdpi.com/1999-4893/17/9/420/pdf?version=1726837502","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:b833f98332274771aeaebc755fb07582","is_oa":false,"landing_page_url":"https://doaj.org/article/b833f98332274771aeaebc755fb07582","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 17, Iss 9, p 420 (2024)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a17090420","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17090420","pdf_url":"https://www.mdpi.com/1999-4893/17/9/420/pdf?version=1726837502","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4402677380.pdf","grobid_xml":"https://content.openalex.org/works/W4402677380.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W1424654272","https://openalex.org/W1514632510","https://openalex.org/W1515188965","https://openalex.org/W1969483458","https://openalex.org/W1974909294","https://openalex.org/W1994987092","https://openalex.org/W2037579231","https://openalex.org/W2058510050","https://openalex.org/W2094657222","https://openalex.org/W2109868275","https://openalex.org/W2119559506","https://openalex.org/W2144717132","https://openalex.org/W2150500908","https://openalex.org/W2157932003","https://openalex.org/W2163178194","https://openalex.org/W2169528473","https://openalex.org/W2171330332","https://openalex.org/W2565603695","https://openalex.org/W2574393322","https://openalex.org/W2808115698","https://openalex.org/W2894757447","https://openalex.org/W2895647709","https://openalex.org/W2946409778","https://openalex.org/W2985525587","https://openalex.org/W3011379640","https://openalex.org/W3035013381","https://openalex.org/W3039948179","https://openalex.org/W3115628694","https://openalex.org/W3155756237","https://openalex.org/W4249127954","https://openalex.org/W4360855698","https://openalex.org/W4392078442","https://openalex.org/W6602684739","https://openalex.org/W6659965354","https://openalex.org/W6830803584"],"related_works":["https://openalex.org/W4293054712","https://openalex.org/W2360981904","https://openalex.org/W2375775343","https://openalex.org/W2562562750","https://openalex.org/W2597144308","https://openalex.org/W2198982833","https://openalex.org/W2368964068","https://openalex.org/W2377950158","https://openalex.org/W2366342492","https://openalex.org/W2161960576"],"abstract_inverted_index":{"An":[0],"algorithm":[1,56,152,198],"is":[2,46,57,153,167,199,225],"described":[3],"to":[4,27,31,54,98,133,155,171],"find":[5,28],"the":[6,21,33,43,58,62,78,125,128,135,145,176,182,187,191,197,203,221],"shortest":[7,82,146,204],"route":[8],"through":[9],"a":[10,39,87,105,121,131,231],"field":[11],"of":[12,14,24,42,60,64,81,107,109,124,127,141,144,160,184,186,190,196,210],"obstacles":[13],"arbitrary":[15],"shapes":[16],"and":[17,45,71,113,215],"positions.":[18],"It":[19],"has":[20],"appreciable":[22],"advantage":[23],"not":[25],"having":[26],"mathematical":[29],"formulas":[30],"represent":[32],"obstacles:":[34],"it":[35],"works":[36],"directly":[37],"with":[38,49,68,157],"digital":[40],"image":[41],"terrain":[44,129],"implemented":[47],"solely":[48],"standard":[50],"graphical":[51],"functions.":[52],"Key":[53],"this":[55,100,158],"definition":[59],"digraphs,":[61],"edges":[63,103,112,136],"which":[65,169,175,180],"are":[66,104,115],"built":[67],"obstacle":[69],"bitangents":[70],"border":[72],"enveloping":[73],"convex":[74],"arcs":[75],"that":[76,93,137],"incorporate":[77],"fundamental":[79],"features":[80],"paths.":[83],"These":[84],"graphs":[85,173],"have":[86,94,138],"remarkably":[88],"lower":[89],"cardinality":[90],"than":[91,227],"those":[92],"been":[95],"proposed":[96],"before":[97],"solve":[99],"problem;":[101],"their":[102],"concatenation":[106],"sequences":[108],"what":[110],"individual":[111],"nodes":[114],"in":[116,174],"formerly":[117],"defined":[118],"graphs.":[119],"Furthermore,":[120],"thorough":[122],"analysis":[123],"topology":[126],"yields":[130],"procedure":[132],"eliminate":[134],"no":[139],"possibility":[140],"being":[142],"part":[143],"path.":[147],"The":[148,194],"A*":[149,192],"graph":[150],"optimization":[151],"adapted":[154],"deal":[156],"type":[159],"graph.":[161],"A":[162],"new":[163],"quite":[164],"general":[165],"theorem":[166],"proved,":[168],"applies":[170],"all":[172,219],"triangle":[177],"inequality":[178],"holds,":[179],"allows":[181],"discarding":[183],"one":[185],"normal":[188],"steps":[189],"algorithm.":[193],"effectiveness":[195],"demonstrated":[200],"by":[201],"calculating":[202],"path":[205],"for":[206],"real":[207],"complex":[208],"terrains":[209],"areas":[211],"between":[212],"25":[213],"km2":[214],"900":[216],"km2.":[217],"In":[218],"cases,":[220],"required":[222],"calculation":[223],"time":[224],"less":[226],"0.6":[228],"s":[229],"on":[230],"Core":[232],"i7-10750H":[233],"CPU":[234],"@":[235],"2.60":[236],"GHz":[237],"laptop":[238],"computer.":[239]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}