PSMAGE: Balanced Map Generation for StarCraft Alberto Uriarte and Santiago Ontañón Drexel University Philadelphia 1/34 August 11, 2013.

Slides:



Advertisements
Similar presentations
Lazy Paired Hyper-Parameter Tuning
Advertisements

MOEAs University of Missouri - Rolla Dr. T’s Course in Evolutionary Computation Matt D. Johnson November 6, 2006.
Clustering Categorical Data The Case of Quran Verses
Fast Algorithms For Hierarchical Range Histogram Constructions
Bidding Protocols for Deploying Mobile Sensors Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic University.
A Survey of Real-Time Strategy Game AI Research and Competition in StarCraft Santiago Ontanon, Gabriel Synnaeve, Alberto Uriarte, Florian Richoux, David.
Data Mining Methodology 1. Why have a Methodology  Don’t want to learn things that aren’t true May not represent any underlying reality ○ Spurious correlation.
1 Machine Learning: Lecture 10 Unsupervised Learning (Based on Chapter 9 of Nilsson, N., Introduction to Machine Learning, 1996)
On the Genetic Evolution of a Perfect Tic-Tac-Toe Strategy
1/38 Game-Tree Search over High-Level Game States in RTS Games Alberto Uriarte and Santiago Ontañón Drexel University Philadelphia October 6, 2014.
Regression Analysis Once a linear relationship is defined, the independent variable can be used to forecast the dependent variable. Y ^ = bo + bX bo is.
Parametric Throughput Analysis of Synchronous Data Flow Graphs
Horse race © Horse race: rules 1.Each player chooses a horse and puts it into a stall. Write your name next to the.
Linear Discriminant Functions Wen-Hung Liao, 11/25/2008.
Content Based Image Clustering and Image Retrieval Using Multiple Instance Learning Using Multiple Instance Learning Xin Chen Advisor: Chengcui Zhang Department.
Integrating Bayesian Networks and Simpson’s Paradox in Data Mining Alex Freitas University of Kent Ken McGarry University of Sunderland.
CMOS Circuit Design for Minimum Dynamic Power and Highest Speed Tezaswi Raja, Dept. of ECE, Rutgers University Vishwani D. Agrawal, Dept. of ECE, Auburn.
DIMENSIONALITY REDUCTION BY RANDOM PROJECTION AND LATENT SEMANTIC INDEXING Jessica Lin and Dimitrios Gunopulos Ângelo Cardoso IST/UTL December
Clustering short time series gene expression data Jason Ernst, Gerard J. Nau and Ziv Bar-Joseph BIOINFORMATICS, vol
A New Force-Directed Graph Drawing Method Based on Edge- Edge Repulsion Chun-Cheng Lin and Hsu-Chen Yen Department of Electrical Engineering, National.
Quality Improvement Introduction to Business Statistics, 5e Kvanli/Guynes/Pavur (c)2000 South-Western College Publishing.
Generic Object Detection using Feature Maps Oscar Danielsson Stefan Carlsson
Othello Sean Farrell June 29, Othello Two-player game played on 8x8 board All pieces have one white side and one black side Initial board setup.
Maximizing the Lifetime of Wireless Sensor Networks through Optimal Single-Session Flow Routing Y.Thomas Hou, Yi Shi, Jianping Pan, Scott F.Midkiff Mobile.
The Pareto fitness genetic algorithm: Test function study Wei-Ming Chen
The Planar-Reflective Symmetry Transform Princeton University.
Lecture 10: Robust fitting CS4670: Computer Vision Noah Snavely.
Statistics for Managers Using Microsoft Excel, 5e © 2008 Pearson Prentice-Hall, Inc.Chap 8-1 Statistics for Managers Using Microsoft® Excel 5th Edition.
Chapter 11: understanding randomness (Simulations)
Radial Basis Function Networks
A Node-Centric Load Balancing Algorithm for Wireless Sensor Networks Hui Dai, Richar Han Department of Computer Science University of Colorado at Boulder.
Information theory, fitness and sampling semantics colin johnson / university of kent john woodward / university of stirling.
Kiting in RTS Games Using Influence Maps Alberto Uriarte and Santiago Ontañón Drexel University Philadelphia 1/26 October 9, 2012.
Game Trees: MiniMax strategy, Tree Evaluation, Pruning, Utility evaluation Adapted from slides of Yoonsuck Choe.
Minimax Trees: Utility Evaluation, Tree Evaluation, Pruning CPSC 315 – Programming Studio Spring 2008 Project 2, Lecture 2 Adapted from slides of Yoonsuck.
Evolutionary Computing Systems Lab (ECSL), University of Nevada, Reno 1 Authors : Siming Liu, Sushil Louis and Monica Nicolascu
林偉楷 Taiwan Evolutionary Intelligence Laboratory.
6-2: STANDARD NORMAL AND UNIFORM DISTRIBUTIONS. IMPORTANT CHANGE Last chapter, we dealt with discrete probability distributions. This chapter we will.
Continuous Random Variables Continuous Random Variables Chapter 6.
Statistics for Managers Using Microsoft Excel, 5e © 2008 Pearson Prentice-Hall, Inc.Chap 8-1 Statistics for Managers Using Microsoft® Excel 5th Edition.
1 CS 391L: Machine Learning: Experimental Evaluation Raymond J. Mooney University of Texas at Austin.
Ground Truth Free Evaluation of Segment Based Maps Rolf Lakaemper Temple University, Philadelphia,PA,USA.
Extending the Multi- Instance Problem to Model Instance Collaboration Anjali Koppal Advanced Machine Learning December 11, 2007.
Hierarchical Clustering of Gene Expression Data Author : Feng Luo, Kun Tang Latifur Khan Graduate : Chien-Ming Hsiao.
A Model for Learning the Semantics of Pictures V. Lavrenko, R. Manmatha, J. Jeon Center for Intelligent Information Retrieval Computer Science Department,
A Computational Study of Three Demon Algorithm Variants for Solving the TSP Bala Chandran, University of Maryland Bruce Golden, University of Maryland.
CCN COMPLEX COMPUTING NETWORKS1 This research has been supported in part by European Commission FP6 IYTE-Wireless Project (Contract No: )
1/27 High-level Representations for Game-Tree Search in RTS Games Alberto Uriarte and Santiago Ontañón Drexel University Philadelphia October 3, 2014.
Random Map Generation and Transport Unit AI for Strategy Games By Russell Kuchar.
Probability Evaluation 11/12 th Grade Statistics Fair Games Random Number Generator Probable Outcomes Resources Why Fair Games? Probable Outcome Examples.
6-2: STANDARD NORMAL AND UNIFORM DISTRIBUTIONS. IMPORTANT CHANGE Last chapter, we dealt with discrete probability distributions. This chapter we will.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology A modified version of the K-means algorithm with a distance.
Maximizing Lifetime per Unit Cost in Wireless Sensor Networks
Real-Time Tracking with Mean Shift Presented by: Qiuhua Liu May 6, 2005.
Outline ● Introduction – What is the problem ● Generate stochastic textures ● Improve realism ● High level approach - Don't just jump into details – Why.
Metaheuristics for the New Millennium Bruce L. Golden RH Smith School of Business University of Maryland by Presented at the University of Iowa, March.
1 Minimum Interference Algorithm for Integrated Topology Control and Routing in Wireless Optical Backbone Networks Fangting Sun Mark Shayman University.
A Binary Linear Programming Formulation of the Graph Edit Distance Presented by Shihao Ji Duke University Machine Learning Group July 17, 2006 Authors:
Shadow Detection in Remotely Sensed Images Based on Self-Adaptive Feature Selection Jiahang Liu, Tao Fang, and Deren Li IEEE TRANSACTIONS ON GEOSCIENCE.
Journal of Computational and Applied Mathematics Volume 253, 1 December 2013, Pages 14–25 Reporter : Zong-Dian Lee A hybrid quantum inspired harmony search.
1/23 A Benchmark for StarCraft Intelligent Agents Alberto Uriarte and Santiago Ontañón Drexel University Philadelphia November 15, 2015.
Shape2Pose: Human Centric Shape Analysis CMPT888 Vladimir G. Kim Siddhartha Chaudhuri Leonidas Guibas Thomas Funkhouser Stanford University Princeton University.
March 1, 2016Introduction to Artificial Intelligence Lecture 11: Machine Evolution 1 Let’s look at… Machine Evolution.
Automatic Learning of Combat Models for RTS Games
Prof. Yu-Chee Tseng Department of Computer Science
Improving Monte Carlo Tree Search Policies in StarCraft
Improving Terrain Analysis and Applications to RTS Game AI
Ho-Chul Cho, Kyung-Joong Kim, Sung-Bae Cho
Aiman H. El-Maleh Sadiq M. Sait Syed Z. Shazli
Anastasia Baryshnikova  Cell Systems 
Presentation transcript:

PSMAGE: Balanced Map Generation for StarCraft Alberto Uriarte and Santiago Ontañón Drexel University Philadelphia 1/34 August 11, 2013

2/34 Outline  Motivation  Introduction  Problem Definition  PSMAGE: Procedural Map Generation  Map Balance Analysis  Evaluation  Conclusions and Future Work

3/34 Motivation Creating balanced maps for tournaments:  Time consuming  Difficult to do with conventional tools A procedural map generation tool Can save a designer a significant amount of time Guarantee a fair playing field for the players

4/34 Outline  Motivation  Introduction  Problem Definition  PSMAGE: Procedural Map Generation  Map Balance Analysis  Evaluation  Conclusions and Future Work

5/34 Introduction Procedural map generation has a long way From dungeons To open worlds

6/34 Introduction Some previous work in RTS games Planet Wars (Lara Cabrera et al.) StarCraft (Togelius et al.)

7/34 Introduction picture from Ben Weber What is a Real-Time Strategy Game?

8/34 Outline  Motivation  Introduction  Problem Definition  PSMAGE: Procedural Map Generation  Map Balance Analysis  Evaluation  Conclusions and Future Work

9/34 Problem definition Balanced map  If all the players have the same skill level, they all have the same chances of winning the game.  In the case of StarCraft, no race has a significant advantage over any other race. Generate Balanced Maps for StarCraft

10/34 Problem definition Strategically interesting  There is a significant number of strategies with which a player can win the game.  There is no dominant strategy. We are assuming that the races are already perfectly balanced. Then balanced maps are those in which all players have equal access to strategic locations: regions and choke points.

11/34 Strategic locations Regions  List of choke points  Resources  Openness  Area Choke Points  Width  Ramp Starting points

12/34 Tournament maps

13/34 Outline  Motivation  Introduction  Problem Definition  PSMAGE: Procedural Map Generation  Map Balance Analysis  Evaluation  Conclusions and Future Work

14/34 PSMAGE 1.Region generation: which generates the base layout of the map. 2.Determine elevation: determines the elevations of all the regions. 3.Starting position placement: assigns some regions as the starting positions for players. 4.Addition of base locations: adds resources to some of the regions of the map, making them potential regions for additional bases for players. 5.Map symmetry: through the use of symmetries, generate a final map likely to be balanced. 6.Realization: the map is translated into an actual StarCraft map.

15/34 PSMAGE 1.Region generation: which generates the base layout of the map. Poisson disk sampling to generate the seed points. Fortune’s Algorithm to generate the Voronoi diagram.

16/34 PSMAGE 2.Determine elevation: determines the elevations of all the regions. We only consider 2 types of elevations: normal and high. The region’s elevation is selected randomly given a parameter that defines the percentage of high regions.

17/34 PSMAGE 3.Starting position placement: assigns some regions as the starting positions for players. We consider the k top-left- most regions in the map to be the starting point. Constrains: Openness of the starting region must be bigger than a threshold. A path must exist between the starting location and a region on the right border and a region on the bottom border.

18/34 PSMAGE 4.Addition of base locations: adds resources to some of the regions of the map, making them potential regions for additional bases for players. We have to ensure an equidistance distance from a base to all nearby resources

19/34 PSMAGE 5.Map symmetry: through the use of symmetries, generate a final map likely to be balanced.

20/34 PSMAGE 6.Realization: the map is translated into an actual StarCraft map.

21/34 PSMAGE Our map generation method can be categorized as:  Offline. Since it takes place during game design.  Necessary to play tournament games.  Combination of random seeds and a control vector.  Stochastic. Given the same features the output is unpredictable.  Constructive approach. Although in step 4 we follow a generate and test schema with a fitness function.

22/34 Outline  Motivation  Introduction  Problem Definition  PSMAGE: Procedural Map Generation  Map Balance Analysis  Evaluation  Conclusions and Future Work

23/34 Map balance analysis Metrics defined for balance maps  Starting location area  Starting location openess  Starting location ground distance  Starting location air distance  2 Expansions distance  All expansions distance  Choke point symmetry distance  Choke point symmetry width

24/34 Map balance analysis Starting Location Space Area. Openess. The maximum value of the distance transform.

25/34 Map balance analysis Starting Location Spread Ground distance. Air distance.

26/34 Map balance analysis Base Expansion Accessibility Ground distance to first and second expansion

27/34 Map balance analysis Base Location Distribution Minimize the standard deviation of the standard deviation of the ground distance from one starting point to all the base locations.

28/34 Map balance analysis Choke Points Symmetry For each pair of symmetric choke points compute:  Ground distance to base.  Width.

29/34 Map balance analysis Choke Points Symmetry For each pair of symmetric choke points compute:  Ground distance to base.  Width. BWTA has false negatives

30/34 Outline  Motivation  Introduction  Problem Definition  PSMAGE: Procedural Map Generation  Map Balance Analysis  Evaluation  Conclusions and Future Work

31/34 Evaluation We analyzed 11 StarCraft tournament maps Average Standard deviationPSMAGE Starting location area49, , , Starting location openess Starting location ground distance , Starting location air distance Expansions distance All expansions distance Choke point symmetry distance Choke point symmetry width

32/34 Outline  Motivation  Introduction  Problem Definition  PSMAGE: Procedural Map Generation  Map Balance Analysis  Evaluation  Conclusions and Future Work

33/34 Conclusions and Future Work Conclusions Future work Using the metric proposed we showed that the maps generated are comparable with the professional ones. Improve BWTA to produce less false negative. Add a decoration step for a better looking map. Use generative-and-test approach with the map balance features instead of symmetries. Add metrics to analyze the strategically interest of the map.

PSMAGE: Balanced Map Generation for StarCraft Alberto Uriarte Santiago Ontañón 34/34