{"id":"https://openalex.org/W2009999591","doi":"https://doi.org/10.1145/1233341.1233398","title":"Clarifications and extensions to tactical waypoint graph algorithms for video games","display_name":"Clarifications and extensions to tactical waypoint graph algorithms for video games","publication_year":2007,"publication_date":"2007-03-23","ids":{"openalex":"https://openalex.org/W2009999591","doi":"https://doi.org/10.1145/1233341.1233398","mag":"2009999591"},"language":"en","primary_location":{"id":"doi:10.1145/1233341.1233398","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1233341.1233398","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 45th annual southeast regional conference","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/A5024803450","display_name":"Dustin White","orcid":null},"institutions":[{"id":"https://openalex.org/I170164250","display_name":"Elon University","ror":"https://ror.org/01szgyb91","country_code":"US","type":"education","lineage":["https://openalex.org/I170164250"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dustin White","raw_affiliation_strings":["Elon University, Elon, NC"],"affiliations":[{"raw_affiliation_string":"Elon University, Elon, NC","institution_ids":["https://openalex.org/I170164250"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5024803450"],"corresponding_institution_ids":["https://openalex.org/I170164250"],"apc_list":null,"apc_paid":null,"fwci":0.9385,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.80981061,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"211","issue":null,"first_page":"316","last_page":"320"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9993000030517578,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9975000023841858,"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.9922999739646912,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/waypoint","display_name":"Waypoint","score":0.9905775189399719},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7307744026184082},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.614041268825531},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.501777172088623},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5005161762237549},{"id":"https://openalex.org/keywords/a*-search-algorithm","display_name":"A* search algorithm","score":0.4293704926967621},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31240689754486084},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.2369813621044159},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.09734028577804565}],"concepts":[{"id":"https://openalex.org/C2781271823","wikidata":"https://www.wikidata.org/wiki/Q138081","display_name":"Waypoint","level":2,"score":0.9905775189399719},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7307744026184082},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.614041268825531},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.501777172088623},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5005161762237549},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.4293704926967621},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31240689754486084},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.2369813621044159},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.09734028577804565}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1233341.1233398","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1233341.1233398","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 45th annual southeast regional conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1484225231","https://openalex.org/W2068686508","https://openalex.org/W2071470832","https://openalex.org/W2086126008"],"related_works":["https://openalex.org/W1525954646","https://openalex.org/W4391129233","https://openalex.org/W2028468162","https://openalex.org/W3174035939","https://openalex.org/W4312570015","https://openalex.org/W2892662882","https://openalex.org/W4383900343","https://openalex.org/W2376328589","https://openalex.org/W4281735905","https://openalex.org/W4297369706"],"abstract_inverted_index":{"This":[0],"paper":[1],"explores":[2],"pathfinding":[3],"in":[4,19,73],"a":[5,10,13,36],"video":[6],"game":[7],"environment":[8,75],"using":[9],"waypoint":[11,37,86],"graph,":[12],"common":[14],"way":[15],"of":[16,63,84],"representing":[17],"locations":[18],"the":[20,46,77,85],"environment.":[21],"I":[22,43],"take":[23],"algorithms":[24,48,67],"created":[25],"by":[26],"Lars":[27],"Liden":[28],"on":[29],"finding":[30],"strategic":[31],"positions":[32,56],"for":[33,60],"agents":[34],"within":[35],"graph":[38],"and":[39,57],"extend":[40],"these":[41],"algorithms.":[42],"demonstrate":[44],"how":[45],"extended":[47,66],"are":[49,68],"able":[50,70],"to":[51,71],"effectively":[52],"calculate":[53],"tactical":[54],"ambush":[55],"pinch":[58],"points":[59],"any":[61],"number":[62],"agents.":[64],"The":[65],"also":[69],"work":[72],"an":[74],"where":[76],"agent":[78],"does":[79],"not":[80],"have":[81],"complete":[82],"knowledge":[83],"graph.":[87]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}