{"id":"https://openalex.org/W4384818457","doi":"https://doi.org/10.1007/s11280-023-01188-6","title":"Efficiently computing alternative paths in game maps","display_name":"Efficiently computing alternative paths in game maps","publication_year":2023,"publication_date":"2023-07-19","ids":{"openalex":"https://openalex.org/W4384818457","doi":"https://doi.org/10.1007/s11280-023-01188-6"},"language":"en","primary_location":{"id":"doi:10.1007/s11280-023-01188-6","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s11280-023-01188-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11280-023-01188-6.pdf","source":{"id":"https://openalex.org/S129236917","display_name":"World Wide Web","issn_l":"1386-145X","issn":["1386-145X","1573-1413"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"World Wide Web","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s11280-023-01188-6.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100745845","display_name":"Lingxiao Li","orcid":"https://orcid.org/0000-0001-5610-5811"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Lingxiao Li","raw_affiliation_strings":["Faculty of Information Technology, Monash University, Clayton, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Monash University, Clayton, Australia","institution_ids":["https://openalex.org/I56590836"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047549903","display_name":"Muhammad Aamir Cheema","orcid":"https://orcid.org/0000-0003-2139-9121"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Muhammad Aamir Cheema","raw_affiliation_strings":["Faculty of Information Technology, Monash University, Clayton, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Monash University, Clayton, Australia","institution_ids":["https://openalex.org/I56590836"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000819439","display_name":"Mohammed Eunus Ali","orcid":"https://orcid.org/0000-0002-0384-7616"},"institutions":[{"id":"https://openalex.org/I183697816","display_name":"Bangladesh University of Engineering and Technology","ror":"https://ror.org/05a1qpv97","country_code":"BD","type":"education","lineage":["https://openalex.org/I183697816"]}],"countries":["BD"],"is_corresponding":false,"raw_author_name":"Mohammed Eunus Ali","raw_affiliation_strings":["Bangladesh University of Engineering and Technology, Dhaka, Bangladesh"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bangladesh University of Engineering and Technology, Dhaka, Bangladesh","institution_ids":["https://openalex.org/I183697816"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079711114","display_name":"Hua Lu","orcid":"https://orcid.org/0000-0003-1199-6678"},"institutions":[{"id":"https://openalex.org/I107707843","display_name":"Roskilde University","ror":"https://ror.org/014axpa37","country_code":"DK","type":"education","lineage":["https://openalex.org/I107707843"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Hua Lu","raw_affiliation_strings":["Department of People and Technology, Roskilde University, Roskilde, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of People and Technology, Roskilde University, Roskilde, Denmark","institution_ids":["https://openalex.org/I107707843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100319239","display_name":"Huan Li","orcid":"https://orcid.org/0000-0003-0084-1662"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Huan Li","raw_affiliation_strings":["Department of Computer Science, Aalborg University, Aalborg, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Aalborg University, Aalborg, Denmark","institution_ids":["https://openalex.org/I891191580"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5100745845"],"corresponding_institution_ids":["https://openalex.org/I56590836"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.3744,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.54591647,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"26","issue":"5","first_page":"3321","last_page":"3345"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9952999949455261,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9952999949455261,"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/T10799","display_name":"Data Visualization and Analytics","score":0.9871000051498413,"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/T12644","display_name":"Wildlife-Road Interactions and Conservation","score":0.9100000262260437,"subfield":{"id":"https://openalex.org/subfields/2303","display_name":"Ecology"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.9020146131515503},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8150570392608643},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6209897994995117},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.591303825378418},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5763922333717346},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5317168235778809},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.49182987213134766},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4346100986003876},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.42349180579185486},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3941182792186737},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38735783100128174},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3632100522518158},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11932343244552612}],"concepts":[{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.9020146131515503},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8150570392608643},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6209897994995117},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.591303825378418},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5763922333717346},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5317168235778809},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.49182987213134766},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4346100986003876},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.42349180579185486},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3941182792186737},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38735783100128174},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3632100522518158},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11932343244552612},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s11280-023-01188-6","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s11280-023-01188-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11280-023-01188-6.pdf","source":{"id":"https://openalex.org/S129236917","display_name":"World Wide Web","issn_l":"1386-145X","issn":["1386-145X","1573-1413"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"World Wide Web","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/61e2c4a9-6510-4f35-b198-2391c138c892","is_oa":true,"landing_page_url":"https://forskning.ruc.dk/da/publications/61e2c4a9-6510-4f35-b198-2391c138c892","pdf_url":null,"source":{"id":"https://openalex.org/S4306401457","display_name":"RUCforsk (Roskilde University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I107707843","host_organization_name":"Roskilde University","host_organization_lineage":["https://openalex.org/I107707843"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Li, L, Cheema, M A, Ali, M E, Lu, H & Li, H 2023, 'Efficiently computing alternative paths in game maps', World Wide Web, vol. 26, no. 5, pp. 3321-3345. https://doi.org/10.1007/s11280-023-01188-6","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:monash.edu:openaire/a5e948e8-818f-411c-9b8b-d26dec752dd6","is_oa":true,"landing_page_url":"https://research.monash.edu/en/publications/a5e948e8-818f-411c-9b8b-d26dec752dd6","pdf_url":"https://researchmgt.monash.edu/ws/files/621721719/621721300-oa.pdf","source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Li, L, Cheema, M A, Ali, M E, Lu, H & Li, H 2023, 'Efficiently computing alternative paths in game maps', World Wide Web, vol. 26, no. 5, pp. 3321-3345. https://doi.org/10.1007/s11280-023-01188-6","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/13a5400e-2fdf-4f55-802f-907780be4869","is_oa":true,"landing_page_url":"https://vbn.aau.dk/da/publications/13a5400e-2fdf-4f55-802f-907780be4869","pdf_url":"https://vbn.aau.dk/ws/files/742449602/s11280-023-01188-6.pdf","source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Li, L, Cheema, M A, Ali, M E, Lu, H & Li, H 2023, 'Efficiently computing alternative paths in game maps', World Wide Web, vol. 26, no. 5, pp. 3321-3345. https://doi.org/10.1007/s11280-023-01188-6","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1007/s11280-023-01188-6","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s11280-023-01188-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11280-023-01188-6.pdf","source":{"id":"https://openalex.org/S129236917","display_name":"World Wide Web","issn_l":"1386-145X","issn":["1386-145X","1573-1413"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"World Wide Web","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.7099999785423279}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320971","display_name":"Monash University","ror":"https://ror.org/02bfwt286"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4384818457.pdf"},"referenced_works_count":51,"referenced_works":["https://openalex.org/W197429550","https://openalex.org/W1493214567","https://openalex.org/W1574634131","https://openalex.org/W1829285201","https://openalex.org/W1977943748","https://openalex.org/W1996014455","https://openalex.org/W2005945380","https://openalex.org/W2009746817","https://openalex.org/W2011282943","https://openalex.org/W2012549825","https://openalex.org/W2057983864","https://openalex.org/W2072485026","https://openalex.org/W2112513979","https://openalex.org/W2114913305","https://openalex.org/W2120783268","https://openalex.org/W2131058166","https://openalex.org/W2135125135","https://openalex.org/W2140946282","https://openalex.org/W2142311862","https://openalex.org/W2145585184","https://openalex.org/W2148831787","https://openalex.org/W2169528473","https://openalex.org/W2173413334","https://openalex.org/W2201539200","https://openalex.org/W2229332794","https://openalex.org/W2607239473","https://openalex.org/W2734434792","https://openalex.org/W2739140437","https://openalex.org/W2741438308","https://openalex.org/W2791658191","https://openalex.org/W2889097229","https://openalex.org/W2896694605","https://openalex.org/W2898247783","https://openalex.org/W2900686218","https://openalex.org/W2945287947","https://openalex.org/W2953083820","https://openalex.org/W2979866729","https://openalex.org/W3007023388","https://openalex.org/W3008330356","https://openalex.org/W3008629102","https://openalex.org/W3009330983","https://openalex.org/W3035324306","https://openalex.org/W3082927533","https://openalex.org/W3202476543","https://openalex.org/W3209269749","https://openalex.org/W3212378323","https://openalex.org/W4283328089","https://openalex.org/W4289533937","https://openalex.org/W4293111481","https://openalex.org/W4313054664","https://openalex.org/W4382202922"],"related_works":["https://openalex.org/W2512285581","https://openalex.org/W4402599120","https://openalex.org/W2605563323","https://openalex.org/W2383519316","https://openalex.org/W2350354796","https://openalex.org/W3088868185","https://openalex.org/W2356287045","https://openalex.org/W2509483197","https://openalex.org/W4221129498","https://openalex.org/W78690942"],"abstract_inverted_index":{"Abstract":[0],"Alternative":[1],"pathfinding":[2,70],"requires":[3],"finding":[4,46],"a":[5,16,21,118,225],"set":[6],"of":[7,59,205,216,232],"k":[8],"alternative":[9,47,69,96,110,131,174,186,214],"paths":[10,27,48,97,111,132,187,215],"(including":[11],"the":[12,57,64,87,99,124,136,150,179,209],"shortest":[13,152,227],"path)":[14],"between":[15],"given":[17],"source":[18],"s":[19],"and":[20,35,163,212],"target":[22],"t":[23],".":[24],"Intuitively,":[25],"these":[26,140,165],"should":[28],"be":[29],"significantly":[30],"different":[31,114],"from":[32],"each":[33],"other":[34],"meaningful/natural":[36],"(e.g.,":[37],"must":[38],"not":[39],"contain":[40],"loops":[41],"or":[42],"unnecessary":[43],"detours).":[44],"While":[45],"in":[49,71,98,188,230],"road":[50,92,126,181],"networks":[51,93],"has":[52],"been":[53],"extensively":[54],"studied,":[55],"to":[56,66,94,149,166,171,224],"best":[58],"our":[60,105,197,220],"knowledge,":[61],"we":[62,85,116,158],"are":[63,75,143],"first":[65],"formally":[67],"study":[68,120,194],"game":[72,100,137,189],"maps":[73],"which":[74],"typically":[76],"represented":[77],"as":[78],"Euclidean":[79],"planes":[80],"containing":[81],"polygonal":[82],"obstacles.":[83],"First,":[84],"adapt":[86],"existing":[88,125,141,180,210],"techniques":[89],"designed":[90],"for":[91,135],"find":[95],"maps.":[101,138,190],"Then,":[102],"based":[103],"on":[104],"web-based":[106],"system":[107],"that":[108,121,123,176,178,196],"visualises":[109],"generated":[112],"by":[113,156],"approaches,":[115],"conduct":[117],"user":[119],"shows":[122,177],"network":[127,182],"approaches":[128,142,183,211],"generate":[129,184],"high-quality":[130,173,185],"when":[133,147],"adapted":[134],"However,":[139],"computationally":[144],"inefficient":[145],"especially":[146],"compared":[148],"state-of-the-art":[151,226],"path":[153,228],"algorithms.":[154],"Motivated":[155],"this,":[157],"propose":[159],"novel":[160],"data":[161],"structures":[162],"exploit":[164],"develop":[167],"an":[168,203],"efficient":[169],"algorithm":[170,199,221,229],"compute":[172],"paths.":[175],"Our":[191],"extensive":[192],"experimental":[193],"demonstrates":[195],"proposed":[198],"is":[200,222],"more":[201],"than":[202,208],"order":[204],"magnitude":[206],"faster":[207],"returns":[213],"comparable":[217,223],"quality.":[218],"Furthermore,":[219],"terms":[231],"running":[233],"time.":[234]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}