{"id":"https://openalex.org/W2910364238","doi":"https://doi.org/10.1109/innovations.2018.8606025","title":"Dynamic Area Search with Shared Memory: A Meta-Framework to Improve Pathfinding Algorithms","display_name":"Dynamic Area Search with Shared Memory: A Meta-Framework to Improve Pathfinding Algorithms","publication_year":2018,"publication_date":"2018-11-01","ids":{"openalex":"https://openalex.org/W2910364238","doi":"https://doi.org/10.1109/innovations.2018.8606025","mag":"2910364238"},"language":"en","primary_location":{"id":"doi:10.1109/innovations.2018.8606025","is_oa":false,"landing_page_url":"https://doi.org/10.1109/innovations.2018.8606025","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Conference on Innovations in Information Technology (IIT)","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/A5026740430","display_name":"Obada Al Zoubi","orcid":"https://orcid.org/0000-0003-0203-5779"},"institutions":[{"id":"https://openalex.org/I8692664","display_name":"University of Oklahoma","ror":"https://ror.org/02aqsxs83","country_code":"US","type":"education","lineage":["https://openalex.org/I8692664"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Obada Al Zoubi","raw_affiliation_strings":["Department of Electrical and Computer Engineering, The University of Oklahoma, Oklahoma, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, The University of Oklahoma, Oklahoma, USA","institution_ids":["https://openalex.org/I8692664"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008382926","display_name":"Mariette Awad","orcid":"https://orcid.org/0000-0002-4815-6894"},"institutions":[{"id":"https://openalex.org/I98635879","display_name":"American University of Beirut","ror":"https://ror.org/04pznsd21","country_code":"LB","type":"education","lineage":["https://openalex.org/I98635879"]}],"countries":["LB"],"is_corresponding":false,"raw_author_name":"Mariette Awad","raw_affiliation_strings":["Department of Electrical and Computer Engineering, American University of Beirut, Beirut, Lebanon"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, American University of Beirut, Beirut, Lebanon","institution_ids":["https://openalex.org/I98635879"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5026740430"],"corresponding_institution_ids":["https://openalex.org/I8692664"],"apc_list":null,"apc_paid":null,"fwci":0.1045,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.48514291,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"81","last_page":"87"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9937999844551086,"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.9937999844551086,"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/T11106","display_name":"Data Management and Algorithms","score":0.9695000052452087,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9257000088691711,"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.9735205173492432},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8257577419281006},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5801718235015869},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5148802995681763},{"id":"https://openalex.org/keywords/limiting","display_name":"Limiting","score":0.5011839866638184},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.49148786067962646},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.48718875646591187},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.45857861638069153},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4559178948402405},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3875775933265686},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32058197259902954},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.32053065299987793},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2615928053855896},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09273460507392883}],"concepts":[{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.9735205173492432},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8257577419281006},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5801718235015869},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5148802995681763},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.5011839866638184},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.49148786067962646},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.48718875646591187},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.45857861638069153},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4559178948402405},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3875775933265686},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32058197259902954},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.32053065299987793},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2615928053855896},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09273460507392883},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/innovations.2018.8606025","is_oa":false,"landing_page_url":"https://doi.org/10.1109/innovations.2018.8606025","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Conference on Innovations in Information Technology (IIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5600000023841858,"display_name":"Life below water","id":"https://metadata.un.org/sdg/14"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1505083629","https://openalex.org/W1539048696","https://openalex.org/W1597203970","https://openalex.org/W1969483458","https://openalex.org/W1975532906","https://openalex.org/W2009833344","https://openalex.org/W2023624803","https://openalex.org/W2035601288","https://openalex.org/W2042872950","https://openalex.org/W2055798432","https://openalex.org/W2089137033","https://openalex.org/W2101155486","https://openalex.org/W2137422497","https://openalex.org/W2150470619","https://openalex.org/W2188198880","https://openalex.org/W2296772665","https://openalex.org/W2313634429","https://openalex.org/W2558384956","https://openalex.org/W2914081601","https://openalex.org/W4232410053","https://openalex.org/W6630092808","https://openalex.org/W6635459721","https://openalex.org/W6680120955","https://openalex.org/W6687201192"],"related_works":["https://openalex.org/W2081821176","https://openalex.org/W2358427436","https://openalex.org/W1994919150","https://openalex.org/W4386269615","https://openalex.org/W2064794194","https://openalex.org/W2402589461","https://openalex.org/W4200104947","https://openalex.org/W58921990","https://openalex.org/W2204575588","https://openalex.org/W1483073478"],"abstract_inverted_index":{"Finding":[0],"the":[1,27,32,35,50,54,58,76,84,88,98,105,113,118,126,132,169,176,191,198],"shortest":[2],"path":[3,115],"between":[4],"two":[5],"given":[6],"objects/states":[7],"is":[8],"a":[9,43,142,194],"common":[10,157],"problem":[11,59,78],"for":[12,34,155,188],"many":[13,16],"scenarios/applications.":[14],"Although":[15],"algorithms":[17,159],"have":[18,112],"been":[19],"proposed,":[20],"most":[21],"of":[22,53,131,145],"them":[23,162],"rely":[24],"entirely":[25],"on":[26,117,125,163],"heuristic":[28],"metrics":[29],"to":[30,48,86,107,138,141,180],"guide":[31,87],"search":[33,106,147],"optimal":[36,114],"path.":[37],"In":[38,121],"this":[39],"work,":[40],"we":[41,123,152,183],"proposed":[42],"novel":[44],"and":[45,79,81,103,128,134,160,174],"generic":[46],"approach":[47,133],"learn":[49],"underlying":[51],"structure":[52],"environment":[55],"while":[56],"exploring":[57],"seamlessly.":[60],"The":[61],"approach,":[62],"Dynamic":[63],"Area":[64],"Search":[65],"with":[66],"Shared":[67],"Memory":[68],"(DASSM),":[69],"learns":[70],"from":[71],"already":[72],"explored":[73],"areas":[74],"in":[75,171,197],"pathfinding":[77,90,158],"efficiently":[80],"dynamically":[82],"reuse":[83],"information":[85],"utilized":[89],"algorithms.":[91,148],"We":[92],"showed":[93],"how":[94],"DASSM":[95,167],"can":[96],"alleviate":[97],"computational":[99],"overhead":[100],"by":[101],"limiting":[102],"focusing":[104],"regions":[108],"that":[109],"more":[110],"likely":[111],"based":[116],"learned":[119],"information.":[120],"addition,":[122],"elaborated":[124],"implementation":[127],"technical":[129],"details":[130],"revealed":[135,193],"its":[136],"feasibility":[137],"be":[139],"implemented":[140],"wide":[143],"range":[144],"informed":[146],"To":[149],"test":[150],"DASSM,":[151,189],"applied":[153],"it":[154],"three":[156],"tested":[161],"publicly":[164],"available":[165],"benchmarks.":[166],"improved":[168],"performance":[170],"all":[172],"cases":[173],"reduced":[175],"execution":[177,199],"time":[178],"up":[179],"75%.":[181],"Moreover,":[182],"examined":[184],"adding":[185],"random":[186],"steps":[187],"where":[190],"results":[192],"potential":[195],"improvement":[196],"time.":[200]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}