Adversarial planning by strategy switching in a real-time strategy game Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/rj430715r

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • We consider the problem of strategic adversarial planning in a Real-Time Strategy (RTS) game. Strategic adversarial planning is the generation of a network of high-level tasks to satisfy goals while anticipating an adversary's actions. In this thesis we describe an abstract state and action space used for planning in an RTS game, an algorithm for generating strategic plans, and a modular architecture for controllers that generate and execute plans. We describe in detail planners that evaluate plans by simulation and select a plan by Game Theoretic criteria. We describe the details of a low-level module of the hierarchy, the combat module. We examine a theoretical performance guarantee for policy switching in Markov Games, and show that policy switching agents can underperform fixed strategy agents. Finally, we present results for strategy switching planners playing against single strategy planners and the game engine's scripted player. The results show that our strategy switching planners outperform single strategy planners in simulation and outperform the game engine's scripted AI.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Keyword
Subject
Rights Statement
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Submitted by Brian King (kingbria@onid.orst.edu) on 2012-06-22T15:51:32Z No. of bitstreams: 3 KingBrianD2012.pdf: 828693 bytes, checksum: 00351f0ce4c401ea971db448dc12c81e (MD5) license_rdf: 21091 bytes, checksum: 6b700a38fb61133bb71e5cac54dd59be (MD5) license_text: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2012-06-27T15:54:47Z (GMT) No. of bitstreams: 3 KingBrianD2012.pdf: 828693 bytes, checksum: 00351f0ce4c401ea971db448dc12c81e (MD5) license_rdf: 21091 bytes, checksum: 6b700a38fb61133bb71e5cac54dd59be (MD5) license_text: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2012-06-28T21:58:21Z (GMT) No. of bitstreams: 3 KingBrianD2012.pdf: 828693 bytes, checksum: 00351f0ce4c401ea971db448dc12c81e (MD5) license_rdf: 21091 bytes, checksum: 6b700a38fb61133bb71e5cac54dd59be (MD5) license_text: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
  • description.provenance : Made available in DSpace on 2012-06-28T21:58:21Z (GMT). No. of bitstreams: 3 KingBrianD2012.pdf: 828693 bytes, checksum: 00351f0ce4c401ea971db448dc12c81e (MD5) license_rdf: 21091 bytes, checksum: 6b700a38fb61133bb71e5cac54dd59be (MD5) license_text: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2012-06-12

Relationships

In Administrative Set:
Last modified: 08/09/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items