Dynamic Task Allocation in a turn based strategy game Gilles Schtickzelle September 2012 ULB.

Slides:



Advertisements
Similar presentations
Approaches, Tools, and Applications Islam A. El-Shaarawy Shoubra Faculty of Eng.
Advertisements

Artificial Intelligence of a Scrabble System
Urban Economics 1 Dr. Adnan A. Alshiha.
Tactical Event Resolution Using Software Agents, Crisp Rules, and a Genetic Algorithm John M. D. Hill, Michael S. Miller, John Yen, and Udo W. Pooch Department.
Machine Learning in Computer Games Learning in Computer Games By: Marc Ponsen.
“The study of algorithms is the cornerstone of computer science.” Algorithms Winter 2012.
Implementation and Study of a “Term” based Role Playing Game using Client Server Paradigm. Vaithiyanathan Sundaram.
An Introduction to Artificial Intelligence. Introduction Getting machines to “think”. Imitation game and the Turing test. Chinese room test. Key processes.
Bell Ringer What two countries remained independent from European control in Africa? Why was South Africa an ideal place to settle for the Europeans?
Sogang University ICC Lab Using Game Theory to Analyze Wireless Ad Hoc networks.
Computer Science 313 – Advanced Programming Topics.
Artificial Intelligence in Game Design Introduction to Learning.
CS 452 – Software Engineering Workshop Acquire-Playing Agent System Group 1: Lisa Anthony Mike Czajkowski Luiza da Silva Winter 2001, Department of Mathematics.
Using Cellular Automata and Influence Maps in Games
Learning Shape in Computer Go David Silver. A brief introduction to Go Black and white take turns to place down stones Once played, a stone cannot move.
CS510 AI and Games Final Report on Dec Juncao Li.
Rome: Total War Mark Maratea CIS588 Winter FEB 2005.
Rule-based Price Discovery Methods in Transportation Procurement Auctions Jiongjiong Song Amelia Regan Institute of Transportation Studies University of.
WASP-LIKE AGENTS FOR DISTRIBUTED FACTORY COORDINATION Vincent A. Cicirello, Stephen F. Smith December 2001
CORE MECHANICS. WHAT ARE CORE MECHANICS? Core mechanics are the heart of a game; they generate the gameplay and implement the rules. Formal definition:
Kiting in RTS Games Using Influence Maps Alberto Uriarte and Santiago Ontañón Drexel University Philadelphia 1/26 October 9, 2012.
CHAPTER 12 ADVANCED INTELLIGENT SYSTEMS © 2005 Prentice Hall, Decision Support Systems and Intelligent Systems, 7th Edition, Turban, Aronson, and Liang.
Lecture 3 Tuesday, September 9 THE MARKET: HOW IT IS SUPPOSED TO WORK.
Invitation to Computer Science 5th Edition
Chapter 14: Artificial Intelligence Invitation to Computer Science, C++ Version, Third Edition.
Game AI Fundamentals. What is Artificial Intelligence (AI)? Not easy to answer… “Ability of a computer or other machine to perform those activities that.
计算机科学概述 Introduction to Computer Science 陆嘉恒 中国人民大学 信息学院
Video Game AI. Classical Games – Focus on optimal players using computationally expensive search techniques Video Game AI – Refers to games such as First.
Graph Coloring with Ants
Artificial Intelligence
Creating Optimal Multi- Layer Perceptron Networks to play Go with a Genetic Algorithm a.k.a. big Name, Run long time By Nathan Erickson ECE539 Final Proj.
Trust-Aware Optimal Crowdsourcing With Budget Constraint Xiangyang Liu 1, He He 2, and John S. Baras 1 1 Institute for Systems Research and Department.
The Design Document The Design Document Introduction Game Mechanics Artificial Intelligence Characters, Items, and Objects/Mechanisms Story.
Design of a real time strategy game with a genetic AI By Bharat Ponnaluri.
Computational Intelligence II Lecturer: Professor Pekka Toivanen Exercises: Nina Rogelj
StarCraft Learning Algorithms By Logan Yarnell, Steven Raines, and Dean Antel.
Othello Playing AI Matt Smith. Othello 8x8 Board game 8x8 Board game Try to outflank opponents pieces Try to outflank opponents pieces Winner ends up.
Selected topics in Ant 2002 By Hanh Nguyen. Selected topics in Ant 2002 Homogeneous Ants for Web Document Similarity Modeling and Categorization Ant Colonies.
Machine Learning in Computer Games Marc Ponsen 11/29/04.
1 S ystems Analysis Laboratory Helsinki University of Technology Kai Virtanen, Tuomas Raivio and Raimo P. Hämäläinen Systems Analysis Laboratory Helsinki.
Machine Learning for an Artificial Intelligence Playing Tic-Tac-Toe Computer Systems Lab 2005 By Rachel Miller.
1 CS 4701 – Project Proposal Jane Park (jp624) Ran Zhao (rz54)
Resource Constrained Project Scheduling Problem. Overview Resource Constrained Project Scheduling problem Job Shop scheduling problem Ant Colony Optimization.
Performance Objectives and Content Analysis Chapter 8 (c) 2007 McGraw-Hill Higher Education. All rights reserved.
Neural Networks and Machine Learning Applications CSC 563 Prof. Mohamed Batouche Computer Science Department CCIS – King Saud University Riyadh, Saudi.
Quoridor and Artificial Intelligence
Lecture 3 Tuesday, September 11 THE MARKET: HOW IT IS SUPPOSED TO WORK.
Adversary Models in Wireless Networks: Research Challenges Radha Poovendran Network Security Lab (NSL) University of Washington.
Path Planning Based on Ant Colony Algorithm and Distributed Local Navigation for Multi-Robot Systems International Conference on Mechatronics and Automation.
Design of a real time strategy game with a genetic AI By Bharat Ponnaluri.
Artificial Intelligence in Game Design Lecture 20: Hill Climbing and N-Grams.
RADHA-KRISHNA BALLA 19 FEBRUARY, 2009 UCT for Tactical Assault Battles in Real-Time Strategy Games.
Qualitative Spatial Analysis Part 2 Chris Mansley.
Adaptive Reinforcement Learning Agents in RTS Games Eric Kok.
An AI Game Project. Background Fivel is a unique hybrid of a NxM game and a sliding puzzle. The goals in making this project were: Create an original.
Teaching Computers to Think:
Understanding AI of 2 Player Games. Motivation Not much experience in AI (first AI project) and no specific interests/passion that I wanted to explore.
Evolutionary Computing Systems Lab (ECSL), University of Nevada, Reno 1 Authors : Siming Liu, Christopher Ballinger, Sushil Louis
The Game Development Process: Artificial Intelligence.
Self-organizing algorithms Márk Jelasity. Decide Object control measure control loop Centralized Mindset: Control Loop ● problem solving, knowledge (GOFAI)
Better Algorithms for Better Computers
C.-S. Shieh, EC, KUAS, Taiwan
An Implementation of the Card Game “Solo”
Artificial Intelligence
Interaction with artificial intelligence in games
Artificial Intelligence
Nest Building and Self-Assembling
Market-based Dynamic Task Allocation in Mobile Surveillance Systems
Factor Game Sample Game.
Cognitive Support for Intelligent Survivability Management
Presentation transcript:

Dynamic Task Allocation in a turn based strategy game Gilles Schtickzelle September 2012 ULB

Problem Statement Creating an intelligent player for a turn-based strategy game. Working Framework: Many possible challenges to meet: o Resource management o Adversarial planning o Spatial reasoning o …

A game of FreeCol Colonization of America Establish settlements, grow and develop them Victory : Declare independence & Beat the Royal Expeditionary Force

Colony Management Assigning tasks to units for optimal resources production

Division of labor in insect societies Ants and wasps colonies have efficient distributed task allocation mechanisms through stygmergy. Bonabeau, E., Theraulaz, G., & Deneubourg, J.-L. (1996).

Response Threshold Ants have probabilistic response to stimuli: Varying threshold θ induces specialization o Reduces switching costs o Increases individual efficiency

From insects to games FreeCol Colony Units Resources Expert units Ants/Wasps Colony Insects Tasks Specialization

Resources Dynamics Surplus: Extra workers. Shortage: Lose worker. Freedom. 50% required to win. Givesbonus or penalty to workers. required to make hammers Used to produce buildings or artileries required to make tools Used to produce buildings or artilleries

Allocation Mechanism One stimulus S r for each resource r = One set of dynamic thresholds θ ri per unit i

Stimuli and Thresholds Simple computation rules for each stimulus One set of dynamic thresholds θ ru per unit u Genetic Algorithm to find appropriate scale factors β r

Simple Scenario

AI goals 1.Reach the year 1776 with enough bells to be able to declare independence. 2. Have the best defense possible to resist the attack of the royal expeditionary force. 3.Allocate workers to 1.minimize famine 2.Keep the production modifier as high as possible

Results (Basic player) Freedom %SizeFamineMilitary EXPERT100%14024 MEAN (100 games)91.57 ± ± ± ± 0.62

Planning approach Suboptimal allocation: building too early Two planning methods: o Layered response threshold. o Rule-based planning.

Planning approach Layered response threshold : o Use two sets of scale factors: Optimized for growth Optimized for production Rule-based planning :

Planning Results (1) Layered AIRule-based AI

Planning Results (2) MilitarySoL %SizeFamine EXPERT MEAN (BASIC)15.99 ± ± ± ± 0.09 MEAN (LAYERED)17.49 ± ± ± ± 0.10 MEAN (RULE BASED)18.80 ± ± ± ± 0.09 Statistics for 100 games with the simple scenario.

Modified Threshold rule Unit u produces resource r Unit u does not produces resource r

“State of the art” player Modified Threshold update rule + rule-based planning

AI players comparison

AI goal completion 1.Reach the year 1776 with enough bells to be able to declare independence. 2. Have the best defense possible to resist the attack of the royal expeditionary force. 3.Allocate workers to 1.minimize famine 2.Keep the production modifier has high as possible Freedom %SizeFamineMilitary EXPERT100%14024 MEAN (100 games)100% ± ± ± ± 0.55

Conclusions Human-level performances can emerge from simple rules, without cheating. Easy to implement (compared to traditional rule-based only AI). Easy to tune down performances (if playing against non- expert). Hybrid system (with planning instructions) improves on basic RTM −Tendency to chaos with large number of stimuli −Difficult to extend to other game aspects (combat, spatial reasoning, diplomacy,…).