{"id":"https://openalex.org/W4410949692","doi":"https://doi.org/10.1109/access.2025.3575168","title":"Efficient Pathfinding on Grid Maps: Comparative Analysis of Classical Algorithms and Incremental Line Search","display_name":"Efficient Pathfinding on Grid Maps: Comparative Analysis of Classical Algorithms and Incremental Line Search","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4410949692","doi":"https://doi.org/10.1109/access.2025.3575168"},"language":"en","primary_location":{"id":"doi:10.1109/access.2025.3575168","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3575168","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2025.3575168","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025429835","display_name":"Amr Elshahed","orcid":"https://orcid.org/0000-0002-1242-6581"},"institutions":[{"id":"https://openalex.org/I139322472","display_name":"Universiti Sains Malaysia","ror":"https://ror.org/02rgb2k63","country_code":"MY","type":"education","lineage":["https://openalex.org/I139322472"]}],"countries":["MY"],"is_corresponding":true,"raw_author_name":"Amr Elshahed","raw_affiliation_strings":["School of Mathematical Sciences, Universiti Sains Malaysia (USM), George Town, Malaysia"],"raw_orcid":"https://orcid.org/0000-0002-1242-6581","affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, Universiti Sains Malaysia (USM), George Town, Malaysia","institution_ids":["https://openalex.org/I139322472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101615025","display_name":"Majid Khan Majahar Ali","orcid":"https://orcid.org/0000-0002-5558-5929"},"institutions":[{"id":"https://openalex.org/I139322472","display_name":"Universiti Sains Malaysia","ror":"https://ror.org/02rgb2k63","country_code":"MY","type":"education","lineage":["https://openalex.org/I139322472"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Majid Khan Bin Majahar Ali","raw_affiliation_strings":["School of Mathematical Sciences, Universiti Sains Malaysia (USM), George Town, Malaysia"],"raw_orcid":"https://orcid.org/0000-0002-5558-5929","affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, Universiti Sains Malaysia (USM), George Town, Malaysia","institution_ids":["https://openalex.org/I139322472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073889249","display_name":"Ahmad Sufril Azlan Mohamed","orcid":"https://orcid.org/0000-0002-2838-0872"},"institutions":[{"id":"https://openalex.org/I139322472","display_name":"Universiti Sains Malaysia","ror":"https://ror.org/02rgb2k63","country_code":"MY","type":"education","lineage":["https://openalex.org/I139322472"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Ahmad Sufril Azlan Mohamed","raw_affiliation_strings":["School of Mathematical Sciences, Universiti Sains Malaysia (USM), George Town, Malaysia"],"raw_orcid":"https://orcid.org/0000-0002-2838-0872","affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, Universiti Sains Malaysia (USM), George Town, Malaysia","institution_ids":["https://openalex.org/I139322472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019785333","display_name":"Farah Aini Abdullah","orcid":"https://orcid.org/0000-0002-5215-9617"},"institutions":[{"id":"https://openalex.org/I139322472","display_name":"Universiti Sains Malaysia","ror":"https://ror.org/02rgb2k63","country_code":"MY","type":"education","lineage":["https://openalex.org/I139322472"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Farah Aini Binti Abdullah","raw_affiliation_strings":["School of Mathematical Sciences, Universiti Sains Malaysia (USM), George Town, Malaysia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, Universiti Sains Malaysia (USM), George Town, Malaysia","institution_ids":["https://openalex.org/I139322472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5117798868","display_name":"Ts. Lee Jian Aun","orcid":null},"institutions":[{"id":"https://openalex.org/I139322472","display_name":"Universiti Sains Malaysia","ror":"https://ror.org/02rgb2k63","country_code":"MY","type":"education","lineage":["https://openalex.org/I139322472"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Ts. Lee Jian Aun","raw_affiliation_strings":["School of Mathematical Sciences, Universiti Sains Malaysia (USM), George Town, Malaysia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, Universiti Sains Malaysia (USM), George Town, Malaysia","institution_ids":["https://openalex.org/I139322472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5025429835"],"corresponding_institution_ids":["https://openalex.org/I139322472"],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":2.1749,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.87707502,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":"13","issue":null,"first_page":"98473","last_page":"98484"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9987000226974487,"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.9987000226974487,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9944000244140625,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.8902419805526733},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7020034193992615},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5470434427261353},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.5224175453186035},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.49630385637283325},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.283355712890625},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2030409872531891},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.14110365509986877},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06933632493019104}],"concepts":[{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.8902419805526733},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7020034193992615},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5470434427261353},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.5224175453186035},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.49630385637283325},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.283355712890625},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2030409872531891},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.14110365509986877},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06933632493019104},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2025.3575168","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3575168","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:1af162fe4d2c4bf9ba2ba93702279a5b","is_oa":true,"landing_page_url":"https://doaj.org/article/1af162fe4d2c4bf9ba2ba93702279a5b","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":"IEEE Access, Vol 13, Pp 98473-98484 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2025.3575168","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3575168","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1424654272","https://openalex.org/W1935926926","https://openalex.org/W1969483458","https://openalex.org/W1975423918","https://openalex.org/W2035601288","https://openalex.org/W2135125135","https://openalex.org/W2145700549","https://openalex.org/W2150470619","https://openalex.org/W2169528473","https://openalex.org/W2171330332","https://openalex.org/W2808115698","https://openalex.org/W2962957005","https://openalex.org/W2963428623","https://openalex.org/W2997061791","https://openalex.org/W3103759471","https://openalex.org/W3132663004","https://openalex.org/W4292454835","https://openalex.org/W4368359192","https://openalex.org/W4380992980","https://openalex.org/W4385611410","https://openalex.org/W4387693951","https://openalex.org/W4390810698","https://openalex.org/W4390944607","https://openalex.org/W4393164638","https://openalex.org/W4402512737","https://openalex.org/W6605583594","https://openalex.org/W6679896305","https://openalex.org/W6696955428"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4285687848","https://openalex.org/W4289994039","https://openalex.org/W2240526870","https://openalex.org/W3100156731","https://openalex.org/W2623016776","https://openalex.org/W1967962134","https://openalex.org/W2355768292"],"abstract_inverted_index":{"Pathfinding":[0],"on":[1],"grid":[2,150],"maps":[3,151],"is":[4],"a":[5,68,79,146,165,172,193,225],"cornerstone":[6],"problem":[7],"in":[8,56,110,122,168,175,196,217,246,259],"robotics,":[9,247],"autonomous":[10,248],"navigation,":[11],"and":[12,22,41,86,97,118,142,159,171,228,250,262],"game":[13],"develop-":[14],"ment.":[15],"Classical":[16],"algorithms":[17,51],"such":[18],"as":[19,224],"A*,":[20],"Dijkstra's,":[21],"Breadth-First":[23],"Search":[24,39,44,66,191],"(BFS)":[25],"are":[26],"known":[27],"for":[28,232,244,256],"their":[29,180],"ability":[30],"to":[31,77,93,128,179,214],"guarantee":[32],"optimal":[33],"solutions,":[34],"while":[35,107,199],"others":[36],"like":[37],"Depth-First":[38],"(DFS)":[40],"Greedy":[42],"Best-First":[43,190],"prioritize":[45],"speed":[46],"over":[47,145],"optimality.":[48],"However,":[49],"these":[50,184],"can":[52],"be":[53],"computationally":[54],"inefficient":[55],"large-scale":[57],"or":[58],"real-time":[59,263],"environments.":[60],"This":[61],"paper":[62],"introduces":[63],"Incremental":[64],"Line":[65],"(ILS),":[67],"novel":[69],"optimization":[70,230],"strategy":[71],"that":[72,205],"incorporates":[73],"Bresenham's":[74],"line":[75],"algorithm":[76,115],"define":[78],"dynamically":[80],"adjustable":[81],"corridor":[82],"between":[83],"the":[84,91,113,130,254],"start":[85],"goal":[87],"points.":[88],"By":[89],"restricting":[90],"search":[92],"this":[94],"focused":[95],"region":[96],"expanding":[98],"only":[99,208],"when":[100],"necessary,":[101],"ILS":[102,133,163,206,223,241],"significantly":[103],"reduces":[104],"computational":[105],"overhead":[106],"preserving":[108],"optimality":[109],"cases":[111],"where":[112],"underlying":[114],"guarantees":[116],"it,":[117],"delivering":[119],"near-optimal":[120],"paths":[121,216],"others.":[123],"Extensive":[124],"experiments":[125],"were":[126],"conducted":[127],"evaluate":[129],"performance":[131],"of":[132,148,156],"across":[134],"various":[135],"metrics,":[136],"including":[137],"execution":[138,169],"time,":[139],"visited":[140],"nodes,":[141],"path":[143,186,197],"length,":[144,198],"total":[147],"6000":[149],"generated":[152],"with":[153],"obstacle":[154],"densities":[155],"10%,":[157],"20%,":[158],"30%.":[160],"On":[161],"average,":[162],"achieved":[164],"87.31%":[166],"reduction":[167,174],"time":[170],"71.44%":[173],"node":[176],"expansions":[177],"compared":[178],"standard":[181],"counterparts.":[182],"Despite":[183],"improvements,":[185],"quality":[187],"was":[188],"preserved:":[189],"showed":[192],"63.24%":[194],"improvement":[195],"DFS":[200],"improved":[201],"by":[202],"86.70%,":[203],"confirming":[204],"not":[207],"accelerates":[209],"computation":[210],"but":[211],"also":[212],"leads":[213],"smoother":[215],"most":[218],"scenarios.":[219],"These":[220],"findings":[221],"affirm":[222],"highly":[226],"effective":[227],"resilient":[229],"technique":[231],"demanding":[233],"pathfind-":[234],"ing":[235],"tasks.":[236],"Its":[237],"dynamic":[238],"adaptability":[239],"renders":[240],"especially":[242],"suitable":[243],"applications":[245],"systems,":[249],"resource-constrained":[251],"environments,":[252],"setting":[253],"stage":[255],"future":[257],"advancements":[258],"multi-agent":[260],"navigation":[261],"optimization.":[264]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}