{"id":"https://openalex.org/W2590334681","doi":"https://doi.org/10.1109/cig.2016.7860422","title":"A multi-objective genetic algorithm for simulating optimal fights in StarCraft II","display_name":"A multi-objective genetic algorithm for simulating optimal fights in StarCraft II","publication_year":2016,"publication_date":"2016-09-01","ids":{"openalex":"https://openalex.org/W2590334681","doi":"https://doi.org/10.1109/cig.2016.7860422","mag":"2590334681"},"language":"en","primary_location":{"id":"doi:10.1109/cig.2016.7860422","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2016.7860422","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Conference on Computational Intelligence and Games (CIG)","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/A5075576154","display_name":"Jonas Schmitt","orcid":"https://orcid.org/0000-0002-8891-0046"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jonas Schmitt","raw_affiliation_strings":["Friedrich-Alexander-Universit\u00e4t, Erlangen-N\u00fcrnberg"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Friedrich-Alexander-Universit\u00e4t, Erlangen-N\u00fcrnberg","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110039750","display_name":"Harald K\u00f6stler","orcid":null},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Harald Kostler","raw_affiliation_strings":["Friedrich-Alexander-Universit\u00e4t, Erlangen-N\u00fcrnberg"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Friedrich-Alexander-Universit\u00e4t, Erlangen-N\u00fcrnberg","institution_ids":["https://openalex.org/I181369854"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I181369854"],"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":"9","issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9995999932289124,"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.9995999932289124,"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.9914000034332275,"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/T10731","display_name":"Educational Games and Gamification","score":0.9894999861717224,"subfield":{"id":"https://openalex.org/subfields/3204","display_name":"Developmental and Educational Psychology"},"field":{"id":"https://openalex.org/fields/32","display_name":"Psychology"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7126948237419128},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6742382049560547},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6490895748138428},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5227177739143372},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4960504472255707},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27468469738960266},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.188716858625412}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7126948237419128},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6742382049560547},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6490895748138428},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5227177739143372},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4960504472255707},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27468469738960266},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.188716858625412},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cig.2016.7860422","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2016.7860422","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Conference on Computational Intelligence and Games (CIG)","raw_type":"proceedings-article"},{"id":"mag:2753294265","is_oa":false,"landing_page_url":"http://jglobal.jst.go.jp/en/public/201702272369278169","pdf_url":null,"source":{"id":"https://openalex.org/S4306512817","display_name":"IEEE Conference Proceedings","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":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"IEEE Conference Proceedings","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.44999998807907104,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W225560312","https://openalex.org/W410468143","https://openalex.org/W1964153772","https://openalex.org/W2013570256","https://openalex.org/W2013907475","https://openalex.org/W2027945080","https://openalex.org/W2043697203","https://openalex.org/W2047891762","https://openalex.org/W2053407718","https://openalex.org/W2103120971","https://openalex.org/W2103862045","https://openalex.org/W2114934447","https://openalex.org/W2126105956","https://openalex.org/W2136168234","https://openalex.org/W2156728410","https://openalex.org/W2254158107","https://openalex.org/W4299335686","https://openalex.org/W6608886761","https://openalex.org/W6683225304"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W4285140130","https://openalex.org/W3104770499","https://openalex.org/W4285677055","https://openalex.org/W1992731528","https://openalex.org/W2007843488","https://openalex.org/W1994436307","https://openalex.org/W1987021796","https://openalex.org/W2795565301","https://openalex.org/W2785349417"],"abstract_inverted_index":{"The":[0,83],"goal":[1,84],"of":[2,48,58,80,85,99,109,145,148,160,167,169,197,203,212,226,232,241,251],"this":[3,42],"work":[4],"is":[5,28,66,89,133],"to":[6,90,119,222,238],"develop":[7],"a":[8,62,78,126,138,153,161,164,230,248],"multi-objective":[9,127],"genetic":[10,139],"algorithm":[11,140],"for":[12,35,189,256],"simulating":[13],"optimal":[14,74,115],"fights":[15],"between":[16,182],"arbitrary":[17],"units":[18,37,71,108,242],"in":[19,38,72,113,152,220],"the":[20,39,49,56,97,107,143,158,170,176,190,195,201,204,213,224,227,239],"real-time":[21],"strategy":[22],"game":[23,40,51],"StarCraft":[24],"II.":[25],"As":[26],"there":[27],"no":[29],"freely":[30],"available":[31],"application":[32],"programming":[33],"interface":[34],"controlling":[36,70],"directly,":[41],"first":[43],"requires":[44],"an":[45,73,114,217],"accurate":[46],"simulation":[47],"actual":[50],"mechanics.":[52],"Next,":[53],"based":[54,76],"on":[55,77],"concept":[57],"artificial":[59],"potential":[60],"fields":[61],"general":[63],"behavior":[64,144],"model":[65],"developed":[67],"which":[68,236],"allows":[69],"way":[75,116],"number":[79,166,231],"real-valued":[81],"parameters.":[82],"each":[86,146],"individual":[87],"unit":[88,147],"maximize":[91],"their":[92],"damage":[93],"output":[94],"while":[95],"minimizing":[96],"amount":[98,240],"received":[100],"damage.":[101],"Finding":[102],"parameter":[103],"values":[104],"that":[105,141,243],"control":[106],"two":[110,149,214],"opposing":[111,150],"players":[112,151,184,199,215],"with":[117],"respect":[118],"these":[120],"objectives":[121],"can":[122,172,207],"be":[123,173,208],"formulated":[124],"as":[125,187,254],"continuous":[128],"optimization":[129,258],"problem.":[130],"This":[131],"problem":[132],"then":[134],"solved":[135],"by":[136],"applying":[137],"optimizes":[142],"competitive":[154],"way.":[155],"To":[156],"evaluate":[157,223],"quality":[159],"solution,":[162],"only":[163],"finite":[165],"solutions":[168,196],"opponent":[171],"used.":[174],"Therefore,":[175],"current":[177],"optima":[178],"are":[179],"repeatedly":[180],"exchanged":[181],"both":[183,198],"and":[185],"serve":[186,253],"input":[188,255],"simulated":[191],"encounter.":[192],"By":[193],"comparing":[194],"at":[200],"end":[202],"optimization,":[205],"it":[206],"estimated":[209],"if":[210],"one":[211],"has":[216],"advantage.":[218],"Finally,":[219],"order":[221],"effectiveness":[225],"presented":[228],"approach,":[229],"sample":[233],"build":[234],"orders,":[235],"correspond":[237],"have":[244],"been":[245],"produced":[246],"until":[247],"certain":[249],"point":[250],"time,":[252],"several":[257],"runs.":[259]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}