{"id":"https://openalex.org/W2766651382","doi":"https://doi.org/10.1145/3136457.3136465","title":"Improvements to hierarchical pathfinding for navigation meshes","display_name":"Improvements to hierarchical pathfinding for navigation meshes","publication_year":2017,"publication_date":"2017-10-31","ids":{"openalex":"https://openalex.org/W2766651382","doi":"https://doi.org/10.1145/3136457.3136465","mag":"2766651382"},"language":"en","primary_location":{"id":"doi:10.1145/3136457.3136465","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3136457.3136465","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Tenth International Conference on Motion in Games","raw_type":"proceedings-article"},"type":"conference-paper","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/A5087232321","display_name":"Vahid Rahmani","orcid":"https://orcid.org/0000-0003-0583-2538"},"institutions":[{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Vahid Rahmani","raw_affiliation_strings":["Universitat Politecnica de Catalunya, Barcelona, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universitat Politecnica de Catalunya, Barcelona, Spain","institution_ids":["https://openalex.org/I9617848"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090504012","display_name":"Nuria Pelechano","orcid":"https://orcid.org/0000-0002-1437-245X"},"institutions":[{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Nuria Pelechano","raw_affiliation_strings":["Universitat Politecnica de Catalunya, Barcelona, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universitat Politecnica de Catalunya, Barcelona, Spain","institution_ids":["https://openalex.org/I9617848"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I9617848"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9993000030517578,"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.9993000030517578,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9991999864578247,"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/T12290","display_name":"Human Motion and Animation","score":0.991599977016449,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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.8418889045715332},{"id":"https://openalex.org/keywords/polygon-mesh","display_name":"Polygon mesh","score":0.7004711627960205},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.6935035586357117},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.683151364326477},{"id":"https://openalex.org/keywords/memory-hierarchy","display_name":"Memory hierarchy","score":0.6767770051956177},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.653453528881073},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5833102464675903},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5353797674179077},{"id":"https://openalex.org/keywords/central-processing-unit","display_name":"Central processing unit","score":0.4759671092033386},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4640568494796753},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.4581143260002136},{"id":"https://openalex.org/keywords/flops","display_name":"FLOPS","score":0.4278000593185425},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2664027810096741},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.21296477317810059},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1772685945034027},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.11397141218185425},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.08772385120391846}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8418889045715332},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.7004711627960205},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.6935035586357117},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.683151364326477},{"id":"https://openalex.org/C2778100165","wikidata":"https://www.wikidata.org/wiki/Q1589327","display_name":"Memory hierarchy","level":3,"score":0.6767770051956177},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.653453528881073},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5833102464675903},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5353797674179077},{"id":"https://openalex.org/C49154492","wikidata":"https://www.wikidata.org/wiki/Q5300","display_name":"Central processing unit","level":2,"score":0.4759671092033386},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4640568494796753},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.4581143260002136},{"id":"https://openalex.org/C3826847","wikidata":"https://www.wikidata.org/wiki/Q188768","display_name":"FLOPS","level":2,"score":0.4278000593185425},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2664027810096741},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.21296477317810059},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1772685945034027},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.11397141218185425},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.08772385120391846},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3136457.3136465","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3136457.3136465","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Tenth International Conference on Motion in Games","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":11,"referenced_works":["https://openalex.org/W105147962","https://openalex.org/W196854640","https://openalex.org/W1981627423","https://openalex.org/W2028499920","https://openalex.org/W2145700549","https://openalex.org/W2193780041","https://openalex.org/W2394686934","https://openalex.org/W2418310384","https://openalex.org/W3022683862","https://openalex.org/W3088934865","https://openalex.org/W3138798301"],"related_works":["https://openalex.org/W4285687848","https://openalex.org/W4289994039","https://openalex.org/W2240526870","https://openalex.org/W1520927959","https://openalex.org/W2082754615","https://openalex.org/W4311294724","https://openalex.org/W4236831773","https://openalex.org/W3092369023","https://openalex.org/W2075747496","https://openalex.org/W2559253174"],"abstract_inverted_index":{"The":[0],"challenge":[1],"of":[2,23,29,42,62],"path-finding":[3],"in":[4],"video":[5],"games":[6],"is":[7],"to":[8,36,88,90],"compute":[9,53],"optimal":[10,13],"or":[11,103],"near":[12],"paths":[14,54],"as":[15,17,50],"efficiently":[16],"possible.":[18],"As":[19],"both":[20,106],"the":[21,24,27,63,74,80],"size":[22],"environments":[25],"and":[26,44,76,108,110,125],"number":[28],"autonomous":[30],"agents":[31],"increase,":[32],"this":[33,83],"computation":[34],"has":[35],"be":[37],"done":[38],"under":[39],"hard":[40],"constraints":[41],"memory":[43,101],"CPU":[45,107],"resources.":[46],"Hierarchical":[47],"approaches,":[48],"such":[49],"HNA*":[51,89],"can":[52,69],"more":[55],"efficiently,":[56],"although":[57],"only":[58],"for":[59,121],"certain":[60],"configurations":[61,124],"hierarchy.":[64,81],"For":[65],"other":[66],"configurations,":[67],"performance":[68],"drop":[70],"drastically":[71],"when":[72],"inserting":[73],"start":[75],"goal":[77],"position":[78],"into":[79],"In":[82],"paper":[84],"we":[85],"present":[86],"improvements":[87],"eliminate":[91],"bottlenecks.":[92],"We":[93],"propose":[94],"different":[95],"methods":[96],"that":[97],"rely":[98],"on":[99,105],"further":[100],"storage":[102],"parallelism":[104],"GPU,":[109],"carry":[111],"out":[112],"a":[113],"comparative":[114],"evaluation.":[115],"Results":[116],"show":[117],"an":[118],"important":[119],"speed-up":[120],"all":[122],"tested":[123],"scenarios.":[126]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}