{"id":"https://openalex.org/W4411787425","doi":"https://doi.org/10.3390/a18070400","title":"The True Shortest Path of Obstacle Grid Graph Is Solved by SGP Vertex Extraction and Filtering Algorithm","display_name":"The True Shortest Path of Obstacle Grid Graph Is Solved by SGP Vertex Extraction and Filtering Algorithm","publication_year":2025,"publication_date":"2025-06-29","ids":{"openalex":"https://openalex.org/W4411787425","doi":"https://doi.org/10.3390/a18070400"},"language":"en","primary_location":{"id":"doi:10.3390/a18070400","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18070400","pdf_url":"https://www.mdpi.com/1999-4893/18/7/400/pdf?version=1751181286","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/18/7/400/pdf?version=1751181286","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100610198","display_name":"Yijie Zhang","orcid":"https://orcid.org/0000-0003-1594-1789"},"institutions":[{"id":"https://openalex.org/I111599522","display_name":"Jiangnan University","ror":"https://ror.org/04mkzax54","country_code":"CN","type":"education","lineage":["https://openalex.org/I111599522"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yijie Zhang","raw_affiliation_strings":["School of Artificial Intelligence and Computer Science, Jiangnan University, Wuxi 214126, China"],"raw_orcid":"https://orcid.org/0000-0003-1594-1789","affiliations":[{"raw_affiliation_string":"School of Artificial Intelligence and Computer Science, Jiangnan University, Wuxi 214126, China","institution_ids":["https://openalex.org/I111599522"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069297967","display_name":"Jizhou Chen","orcid":"https://orcid.org/0009-0009-6218-0960"},"institutions":[{"id":"https://openalex.org/I111599522","display_name":"Jiangnan University","ror":"https://ror.org/04mkzax54","country_code":"CN","type":"education","lineage":["https://openalex.org/I111599522"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jizhou Chen","raw_affiliation_strings":["School of Artificial Intelligence and Computer Science, Jiangnan University, Wuxi 214126, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Artificial Intelligence and Computer Science, Jiangnan University, Wuxi 214126, China","institution_ids":["https://openalex.org/I111599522"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5069297967"],"corresponding_institution_ids":["https://openalex.org/I111599522"],"apc_list":{"value":1600,"currency":"CHF","value_usd":1782},"apc_paid":{"value":1600,"currency":"CHF","value_usd":1782},"fwci":1.0916,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.76803367,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":"18","issue":"7","first_page":"400","last_page":"400"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9571999907493591,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9571999907493591,"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/T13734","display_name":"Advanced Computational Techniques and Applications","score":0.9545999765396118,"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"}},{"id":"https://openalex.org/T14276","display_name":"Power Systems and Technologies","score":0.9465000033378601,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/vertex","display_name":"Vertex (graph theory)","score":0.633823812007904},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6276593208312988},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.6160100102424622},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.586051881313324},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5795707702636719},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5428322553634644},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5304773449897766},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4723692536354065},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4253396987915039},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35612887144088745},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3287964463233948},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1819222867488861}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.633823812007904},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6276593208312988},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.6160100102424622},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.586051881313324},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5795707702636719},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5428322553634644},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5304773449897766},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4723692536354065},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4253396987915039},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35612887144088745},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3287964463233948},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1819222867488861},{"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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/a18070400","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18070400","pdf_url":"https://www.mdpi.com/1999-4893/18/7/400/pdf?version=1751181286","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:303ac97ae77543cdb8e8234bf65e5f3a","is_oa":true,"landing_page_url":"https://doaj.org/article/303ac97ae77543cdb8e8234bf65e5f3a","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":"Algorithms, Vol 18, Iss 7, p 400 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a18070400","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18070400","pdf_url":"https://www.mdpi.com/1999-4893/18/7/400/pdf?version=1751181286","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":[{"id":"https://openalex.org/G5451269634","display_name":null,"funder_award_id":"62402200","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4411787425.pdf","grobid_xml":"https://content.openalex.org/works/W4411787425.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W193081048","https://openalex.org/W1534688999","https://openalex.org/W1570691242","https://openalex.org/W1595159159","https://openalex.org/W1981167736","https://openalex.org/W2061438946","https://openalex.org/W2098006849","https://openalex.org/W2139393291","https://openalex.org/W2262276395","https://openalex.org/W2498592833","https://openalex.org/W2749159846","https://openalex.org/W2770729327","https://openalex.org/W2783827472","https://openalex.org/W2973843340","https://openalex.org/W2998553334","https://openalex.org/W3010726750","https://openalex.org/W3035939904","https://openalex.org/W3125146262","https://openalex.org/W3184816460","https://openalex.org/W4250503569","https://openalex.org/W4285092328","https://openalex.org/W4307403081","https://openalex.org/W4384831806","https://openalex.org/W4385811494","https://openalex.org/W4399300226","https://openalex.org/W4409593380","https://openalex.org/W6682642761"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600","https://openalex.org/W2761711678"],"abstract_inverted_index":{"In":[0],"the":[1,7,20,25,32,61,67,73,85,101,109],"obstacle":[2,107],"grid":[3,34],"map,":[4],"due":[5],"to":[6,82],"limitations":[8],"in":[9,76,94,103],"search":[10,83],"direction":[11],"imposed":[12],"by":[13,72],"classical":[14],"path":[15,69,113],"algorithms":[16],"and":[17,44,89,106],"meta-heuristic":[18],"algorithms,":[19],"shortest":[21,27,33,68,87],"paths":[22,28,35],"are":[23,115],"not":[24],"true":[26],"(TSPs)":[29],"but":[30],"rather":[31],"(SGPs).":[36],"This":[37],"paper":[38,78],"introduces":[39],"an":[40],"SGP":[41],"vertex":[42],"extraction":[43],"filtering":[45],"algorithm":[46,114],"(SGPVEFA)":[47],"that":[48],"identifies":[49],"key":[50],"nodes":[51,57],"within":[52],"SGPs.":[53],"After":[54],"screening,":[55],"these":[56],"yield":[58],"TSPs":[59],"under":[60],"same":[62],"conditions.":[63],"Through":[64],"various":[65],"experiments,":[66],"length":[70],"searched":[71],"SGPVEFA":[74],"proposed":[75],"this":[77,112],"can":[79],"be":[80],"used":[81],"for":[84],"real":[86],"path,":[88],"it":[90],"also":[91],"has":[92],"advantages":[93,110],"comparison":[95],"with":[96],"recent":[97],"new":[98],"algorithms.":[99],"With":[100],"increase":[102],"map":[104],"scale":[105],"rate,":[108],"of":[111],"more":[116],"significant.":[117]},"counts_by_year":[{"year":2026,"cited_by_count":2}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}