作者: Michael Buro , Nicolas A. Barriga , Marius Stanescu
DOI: 10.3233/978-1-61499-419-0-1099
关键词: Adversarial system 、 State (computer science) 、 Hierarchy 、 Implementation 、 Action (philosophy) 、 Scalability 、 Abstraction (linguistics) 、 Artificial intelligence 、 Real-time strategy 、 Computer science
摘要: Real-Time Strategy (RTS) video games have proven to be a very challenging application area for Artificial Intelligence research. Existing AI solutions are limited by vast state and action spaces real-time constraints. Most implementations efficiently tackle various tactical or strategic sub-problems, but there is no single algorithm fast enough successfully applied full RTS games. This paper introduces hierarchical adversarial search framework which implements different abstraction at each level — from deciding how win the game top of hierarchy individual unit orders bottom.