{"id":"https://openalex.org/W4407152233","doi":"https://doi.org/10.1145/3708597.3708620","title":"Theoretical Approach on Assessing the Accuracy of the Shortest Path Non-Optimal Algorithm for 2-Dimensional Grids with Obstacles","display_name":"Theoretical Approach on Assessing the Accuracy of the Shortest Path Non-Optimal Algorithm for 2-Dimensional Grids with Obstacles","publication_year":2024,"publication_date":"2024-10-11","ids":{"openalex":"https://openalex.org/W4407152233","doi":"https://doi.org/10.1145/3708597.3708620"},"language":"en","primary_location":{"id":"doi:10.1145/3708597.3708620","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3708597.3708620","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2024 8th International Conference on Algorithms, Computing and Systems","raw_type":"proceedings-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/A5111384150","display_name":"C. D. Mo","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Chenghao Mo","raw_affiliation_strings":["Oyster River High School, Durham, NH, USA"],"raw_orcid":"https://orcid.org/0009-0002-2714-6619","affiliations":[{"raw_affiliation_string":"Oyster River High School, Durham, NH, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5111384150"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.25858154,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"150","last_page":"156"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9970999956130981,"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.9970999956130981,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/computer-science","display_name":"Computer science","score":0.6411588788032532},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5529197454452515},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5389567017555237},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4787972867488861},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.378013014793396},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19436901807785034},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16053223609924316},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.059118807315826416}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6411588788032532},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5529197454452515},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5389567017555237},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4787972867488861},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.378013014793396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19436901807785034},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16053223609924316},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.059118807315826416},{"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.1145/3708597.3708620","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3708597.3708620","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2024 8th International Conference on Algorithms, Computing and Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2031236641","https://openalex.org/W2160365857","https://openalex.org/W2169528473","https://openalex.org/W2313522962","https://openalex.org/W2981328445","https://openalex.org/W3157605924","https://openalex.org/W4367839715","https://openalex.org/W6742410347"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"In":[0],"many":[1],"applications":[2,139],"such":[3],"as":[4],"urban":[5],"navigation":[6],"and":[7,116],"robotics,":[8],"finding":[9,143],"the":[10,36,40,65,68,75,78,93,122,128],"shortest":[11,37],"path":[12,38,142],"in":[13,144],"a":[14,47,88,118],"2D":[15],"grid":[16,71,129],"is":[17],"crucial":[18],"but":[19],"computationally":[20],"expensive":[21],"using":[22],"traditional":[23,31],"optimal":[24],"algorithms":[25,32,55,79,125],"like":[26],"Floyd-Warshall":[27],"or":[28],"Dijkstra.":[29],"These":[30],"guarantee":[33],"to":[34,46,63,120],"find":[35],"at":[39],"cost":[41],"of":[42,70,77,95],"time":[43],"complexity,":[44],"leading":[45],"time-consuming":[48],"computation,":[49],"particularly":[50],"for":[51,59,91,138],"large-scale":[52],"grids.":[53],"Non-optimal":[54],"that":[56],"trade":[57],"accuracy":[58,76,94],"speed":[60],"have":[61],"emerged":[62],"address":[64],"issue.":[66],"However,":[67],"impact":[69],"obstacle":[72,111,130],"density":[73,112],"on":[74,127],"has":[80,135],"not":[81],"been":[82],"well":[83],"understood.":[84],"This":[85],"paper":[86,108],"presents":[87],"theoretical":[89,101,133],"framework":[90,134],"evaluating":[92],"two":[96],"non-optimal":[97,124],"algorithms.":[98],"By":[99],"integrating":[100],"analysis":[102],"with":[103],"extensive":[104],"experimental":[105],"data,":[106],"this":[107],"demonstrates":[109],"how":[110],"influences":[113],"algorithm":[114],"performance,":[115],"proposes":[117],"methodology":[119],"select":[121],"best":[123],"based":[126],"density.":[131],"The":[132],"practical":[136],"implications":[137],"requiring":[140],"rapid":[141],"complex":[145],"environments.":[146]},"counts_by_year":[],"updated_date":"2025-12-22T23:10:17.713674","created_date":"2025-10-10T00:00:00"}